{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19670601,0.0014618954,0.5174134,0.0020336611,0.00043920524,0.00025897397,0.0031818792,0.0011139293,0.27739117],"genre_scores_gemma":[0.7130786,0.002109334,0.13829373,0.000920359,0.0004999812,0.00064466166,0.0044990587,0.001270352,0.13868389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992429,0.0001440553,0.000032384585,0.00023801926,0.00017127232,0.00017132965],"domain_scores_gemma":[0.9989511,0.00044490575,0.00012285126,0.0002042163,0.0001078888,0.0001690241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048607765,0.0013392874,0.0012769306,0.0010619997,0.00081990944,0.0023093743,0.0014533154,0.0010018031,0.055557568],"category_scores_gemma":[0.0022983428,0.00071417843,0.001081975,0.0014610062,0.0012287169,0.0040266295,0.0019621674,0.0035550387,0.006349626],"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.00027399688,0.00018017457,0.00037831583,0.00033628696,0.00005688796,0.00016858465,0.00024530882,0.01655587,0.0035216317,0.9109539,0.020304775,0.04702443],"study_design_scores_gemma":[0.000099042976,0.00008276265,0.00045556683,0.000060631646,0.000032919957,0.00040312417,0.00017474264,0.027878344,0.002167069,0.92987996,0.038728278,0.000037408718],"about_ca_topic_score_codex":0.00088556315,"about_ca_topic_score_gemma":0.0010021543,"teacher_disagreement_score":0.055557568,"about_ca_system_score_codex":0.0005847355,"about_ca_system_score_gemma":0.00029262365,"threshold_uncertainty_score":0.18585855},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002301384,0.00015866963,0.9951733,0.00013286113,0.0000629458,0.000050957377,0.000045149696,0.00026093348,0.0018137938],"genre_scores_gemma":[0.03269897,0.00017044686,0.9636718,0.00009115249,0.00006700198,0.00020481713,0.00018245308,0.00020950592,0.0027037938],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992907,0.00020745568,0.00002862278,0.00009681411,0.0003129761,0.000063506355],"domain_scores_gemma":[0.9983032,0.0010967812,0.00006838516,0.000098397366,0.0003421851,0.00009101101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00144356,0.0012120792,0.0017784847,0.0012060325,0.00094824174,0.0012349307,0.0017655593,0.0022583522,0.0077540143],"category_scores_gemma":[0.004658587,0.0010093839,0.0007664801,0.0019592775,0.0009093366,0.0015135068,0.0018652271,0.0035222585,0.0016081019],"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.00032922308,0.00025782973,0.0003733341,0.00022469743,0.0000833788,0.00010874417,0.000111894966,0.41691712,0.004449695,0.06466906,0.01577404,0.49670103],"study_design_scores_gemma":[0.00005032679,0.000036010555,0.00006467827,0.000015742595,0.000009746008,0.000022097724,0.000008438965,0.9774302,0.00056572305,0.019647533,0.00214192,0.000007607512],"about_ca_topic_score_codex":0.0037484306,"about_ca_topic_score_gemma":0.005178853,"teacher_disagreement_score":0.0077540143,"about_ca_system_score_codex":0.00079341565,"about_ca_system_score_gemma":0.0017832681,"threshold_uncertainty_score":0.025939822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003803048,0.000057738333,0.9941208,0.00010262027,0.000052935084,0.00005363328,0.000025252964,0.00037365785,0.0014103071],"genre_scores_gemma":[0.08809227,0.000079618774,0.9065218,0.00011622485,0.00003058707,0.00026599414,0.00012265716,0.00014612048,0.0046247635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961996,0.00009146698,0.000019063345,0.00008558734,0.00014193269,0.000042016483],"domain_scores_gemma":[0.99911934,0.00040847904,0.00006720286,0.0000914332,0.00024715706,0.000066477536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009038067,0.00065652706,0.0010736627,0.0005881896,0.0008811674,0.00078777707,0.001553517,0.0017082243,0.007511001],"category_scores_gemma":[0.0028954176,0.0005854548,0.00047711175,0.00071628735,0.0007027377,0.00095985335,0.0016158582,0.0020655242,0.001316739],"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.0003767984,0.00027963993,0.000861666,0.00018150902,0.00007273691,0.00014797856,0.00016956104,0.44363803,0.008781691,0.060048148,0.007967577,0.47747466],"study_design_scores_gemma":[0.00004706957,0.00004361543,0.00007744956,0.000011259804,0.00000641127,0.000031126165,0.000007851553,0.9903543,0.0009475935,0.0069306334,0.0015321609,0.000010520676],"about_ca_topic_score_codex":0.004042245,"about_ca_topic_score_gemma":0.00585579,"teacher_disagreement_score":0.007511001,"about_ca_system_score_codex":0.0006938319,"about_ca_system_score_gemma":0.0028183064,"threshold_uncertainty_score":0.025126755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022981105,0.00062210544,0.88927776,0.0031469292,0.00039705637,0.000062572195,0.00027601406,0.00016528649,0.083071075],"genre_scores_gemma":[0.6222122,0.0015900672,0.32710743,0.0025303285,0.0011811232,0.0005067365,0.0007306204,0.00046906245,0.043672413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988794,0.00042844628,0.000060809678,0.0002671852,0.00022056607,0.00014360408],"domain_scores_gemma":[0.99867237,0.000610529,0.00011589628,0.00020057803,0.00024712353,0.00015347717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002001014,0.00077086483,0.00090197555,0.0018696614,0.0023911123,0.004223857,0.0019803923,0.0018479889,0.012076503],"category_scores_gemma":[0.0039041426,0.0007601214,0.0018178212,0.0019179328,0.006345914,0.009556095,0.0047370614,0.006672739,0.001518908],"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.0000016742192,0.0000023039843,0.000016126802,0.0000046713944,8.906096e-7,0.0000065980457,0.000027170998,0.00015295623,0.000036596866,0.9988207,0.0002816834,0.0006486876],"study_design_scores_gemma":[0.0000035840978,0.000003372093,0.000018143026,0.000004743171,0.00000169008,0.000013864121,0.00002802254,0.0014445295,0.00004259192,0.99678814,0.0016486363,0.0000026901778],"about_ca_topic_score_codex":0.0010349262,"about_ca_topic_score_gemma":0.0010375308,"teacher_disagreement_score":0.012076503,"about_ca_system_score_codex":0.0015471978,"about_ca_system_score_gemma":0.0010131578,"threshold_uncertainty_score":0.04039991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13862306,0.0041180826,0.6623603,0.004071866,0.0004218732,0.00011556713,0.00020807542,0.00024377246,0.18983747],"genre_scores_gemma":[0.882364,0.0028492222,0.089281,0.0006501186,0.0007800565,0.00018670202,0.0002032585,0.0004238712,0.02326173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984029,0.0006526828,0.000051228064,0.00014548801,0.000467501,0.00028028947],"domain_scores_gemma":[0.9914083,0.006351111,0.00054206094,0.0003483439,0.00071161974,0.00063857593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037364033,0.0011628368,0.0013415612,0.0030243997,0.0016150991,0.0029412725,0.0025181738,0.0013849199,0.009732161],"category_scores_gemma":[0.02147795,0.000601354,0.0011055276,0.0020519842,0.0030712688,0.005249979,0.0028598025,0.004524783,0.00096883264],"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.000022959877,0.00003349578,0.00022724082,0.000062058985,0.0000095739215,0.000034049972,0.000102028374,0.01968241,0.00036023345,0.9701788,0.0017239372,0.007563242],"study_design_scores_gemma":[0.00001494076,0.000021198719,0.00023748109,0.000039996394,0.00001614006,0.00006038002,0.00007520783,0.24871519,0.00027951304,0.74781007,0.002715757,0.000014130726],"about_ca_topic_score_codex":0.0026114685,"about_ca_topic_score_gemma":0.002360416,"teacher_disagreement_score":0.009732161,"about_ca_system_score_codex":0.003169861,"about_ca_system_score_gemma":0.0013744399,"threshold_uncertainty_score":0.03255731},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30935282,0.0014847022,0.62077165,0.0031201886,0.0004810729,0.00015944336,0.0003616523,0.00043383503,0.06383467],"genre_scores_gemma":[0.8525236,0.00092088425,0.07634731,0.00079670816,0.0004573121,0.0003533913,0.0003589025,0.00039238506,0.06784945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999049,0.00037293104,0.000041912346,0.0001598224,0.00022072265,0.00015564295],"domain_scores_gemma":[0.99221474,0.0045615938,0.0008410531,0.00054214627,0.00078612554,0.0010543017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022439994,0.00076935155,0.00150323,0.0020727748,0.0020893477,0.0033549087,0.002518895,0.0022966298,0.0085405465],"category_scores_gemma":[0.01888084,0.0007199994,0.0012284116,0.0008483131,0.0033196325,0.0034030783,0.004623396,0.0031096851,0.0009378251],"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.000041137453,0.00001829533,0.00017464778,0.00003814169,0.000013134634,0.00003593908,0.00008751117,0.008271252,0.00049340754,0.9873532,0.0012654593,0.0022079088],"study_design_scores_gemma":[0.000034096713,0.00003326858,0.00025945707,0.000020966687,0.000012916129,0.000080468315,0.0000692618,0.120064855,0.00047189379,0.87698287,0.0019450544,0.000024846962],"about_ca_topic_score_codex":0.0011568845,"about_ca_topic_score_gemma":0.0010336643,"teacher_disagreement_score":0.0085405465,"about_ca_system_score_codex":0.001712864,"about_ca_system_score_gemma":0.0012955404,"threshold_uncertainty_score":0.02857095},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48027155,0.0015139865,0.3944311,0.012033376,0.00051264925,0.00015630535,0.0008127256,0.00053282786,0.10973554],"genre_scores_gemma":[0.92332965,0.0010414517,0.044036586,0.00051204214,0.0009386232,0.00017418235,0.0005786014,0.0002756747,0.029113013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970023,0.0010959866,0.00013081546,0.00047054124,0.00079094013,0.0005093774],"domain_scores_gemma":[0.9887449,0.0077015967,0.0008837822,0.00079041475,0.0006716353,0.0012076824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037037376,0.0011049949,0.0027115017,0.0034784654,0.0049991454,0.008327276,0.003251349,0.0035162738,0.01771668],"category_scores_gemma":[0.019489296,0.0011520222,0.0017617968,0.0037130534,0.0076365597,0.01766288,0.005022196,0.006451017,0.0015758737],"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.00003368077,0.000025237932,0.00014058905,0.00003513051,0.0000062844233,0.0000253298,0.00015515348,0.002040319,0.00011709098,0.9910204,0.0012041206,0.005196714],"study_design_scores_gemma":[0.000008519331,0.000005670288,0.00004220221,0.000006437066,0.0000032005369,0.000012708652,0.000051688443,0.0039322157,0.000081921906,0.995359,0.00049038825,0.000006048829],"about_ca_topic_score_codex":0.0015885624,"about_ca_topic_score_gemma":0.0018289717,"teacher_disagreement_score":0.01771668,"about_ca_system_score_codex":0.0022491983,"about_ca_system_score_gemma":0.0018260203,"threshold_uncertainty_score":0.059268177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019104034,0.00045146185,0.9610594,0.0008929139,0.000112639005,0.00007305303,0.00022682533,0.00007882406,0.018000878],"genre_scores_gemma":[0.45797434,0.0016311817,0.5035754,0.00083779596,0.0007526782,0.0007864621,0.00094000384,0.0005551047,0.032946967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655765,0.0018505093,0.0001395057,0.00049171876,0.00070176617,0.00025889167],"domain_scores_gemma":[0.99026734,0.0073263636,0.00071279856,0.0006472526,0.0004952686,0.0005510193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052389135,0.0025116273,0.0029637206,0.0022056776,0.0012369562,0.0048695863,0.002997827,0.0035194196,0.010479059],"category_scores_gemma":[0.020664422,0.0017743803,0.0022030585,0.0028531365,0.0029911506,0.0073217736,0.0058056274,0.0063460497,0.0013437477],"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.0001685937,0.000117023475,0.00046658592,0.00019759024,0.000116320705,0.0001425682,0.0000883001,0.41573048,0.0011804635,0.5571728,0.003466377,0.021152958],"study_design_scores_gemma":[0.000022569347,0.000054141106,0.00017204038,0.000055070956,0.000023371298,0.000048499758,0.000019358957,0.690343,0.0005166577,0.30709484,0.0016181518,0.000032246913],"about_ca_topic_score_codex":0.0018592832,"about_ca_topic_score_gemma":0.0011537991,"teacher_disagreement_score":0.010479059,"about_ca_system_score_codex":0.0015472664,"about_ca_system_score_gemma":0.0012442132,"threshold_uncertainty_score":0.035055935},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30197376,0.0021281554,0.6112642,0.00758547,0.00034896488,0.000103274695,0.00083665474,0.00030563408,0.07545388],"genre_scores_gemma":[0.90795875,0.001615919,0.06674104,0.0011213599,0.00048096554,0.00013895163,0.00052288285,0.00011667095,0.02130344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991647,0.0003407765,0.000041791824,0.0001582076,0.00018108673,0.00011343903],"domain_scores_gemma":[0.9973912,0.001365383,0.0003336847,0.00024794127,0.00027267972,0.00038921653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015219765,0.0006878298,0.0010697789,0.0016428721,0.0017830399,0.0025030118,0.0014981776,0.0016292025,0.0068130596],"category_scores_gemma":[0.006219465,0.00039066345,0.0010468449,0.0016874141,0.0030064073,0.0056861495,0.0022744287,0.0029412461,0.00060032035],"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.000017025854,0.000014641442,0.0001135392,0.00002812692,0.0000052390606,0.000024875546,0.00006239641,0.0028750538,0.00018964545,0.99331456,0.0010143477,0.0023405014],"study_design_scores_gemma":[0.0000038980493,0.000003986765,0.00004104711,0.00000412403,0.0000022906493,0.000018352011,0.000025987802,0.011254894,0.000056926456,0.9881179,0.00046636886,0.000004180178],"about_ca_topic_score_codex":0.002023423,"about_ca_topic_score_gemma":0.0019085148,"teacher_disagreement_score":0.0068130596,"about_ca_system_score_codex":0.0016403557,"about_ca_system_score_gemma":0.0013702608,"threshold_uncertainty_score":0.022791922},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54580253,0.0013815303,0.24001251,0.0025884344,0.00031780815,0.00016258264,0.0010636274,0.00048019784,0.20819071],"genre_scores_gemma":[0.90485346,0.0010669829,0.038068775,0.00053919794,0.00033606426,0.00022436955,0.00083646347,0.0002595673,0.053814996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913555,0.00017787036,0.00003864557,0.0001326356,0.00030272355,0.00021258552],"domain_scores_gemma":[0.9949085,0.003395675,0.0004989653,0.00026749555,0.00033423206,0.00059506984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091018743,0.0010010913,0.0010443978,0.0034389226,0.0017624603,0.00431776,0.0015677782,0.0016493064,0.015301367],"category_scores_gemma":[0.006137409,0.0010623256,0.00076779746,0.0022410066,0.0036522092,0.006518116,0.0026833008,0.0037302615,0.0013390796],"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.000026703401,0.000020992145,0.00018912167,0.00004122794,0.000006702036,0.00009676687,0.000090717425,0.002341841,0.00053511927,0.99291104,0.0011095504,0.002630193],"study_design_scores_gemma":[0.000016006765,0.000017255854,0.00026376668,0.000019538289,0.000008597926,0.00012234348,0.00009589297,0.0120460745,0.00066990935,0.98463875,0.0020870788,0.000014806874],"about_ca_topic_score_codex":0.0008627853,"about_ca_topic_score_gemma":0.0013079453,"teacher_disagreement_score":0.015301367,"about_ca_system_score_codex":0.0020141446,"about_ca_system_score_gemma":0.00082610565,"threshold_uncertainty_score":0.05118823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011454449,0.0018704134,0.97093505,0.0010775148,0.0002530098,0.00021127086,0.0007543019,0.0005491657,0.012894823],"genre_scores_gemma":[0.4884538,0.003415828,0.4857958,0.0011516822,0.0008350555,0.0011477219,0.0015008824,0.0011754609,0.016523782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556583,0.0012757734,0.00023540431,0.00076458085,0.0010003056,0.0011580146],"domain_scores_gemma":[0.9886951,0.008040808,0.00089527393,0.00073518185,0.00097154843,0.000662102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063989195,0.0039241225,0.0043594423,0.0017855987,0.0011781063,0.006036074,0.004891901,0.0038626574,0.015282138],"category_scores_gemma":[0.023252526,0.0025827142,0.0031656795,0.0032921797,0.0019206017,0.006332164,0.0032694219,0.00818796,0.0016817158],"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.00031254132,0.00020508577,0.0002779543,0.00062863197,0.00009224997,0.00014079822,0.00014477277,0.8814324,0.0016312479,0.080868654,0.0071802773,0.027085384],"study_design_scores_gemma":[0.000033701835,0.00006488317,0.00013114775,0.00007346388,0.00004444317,0.00004306639,0.000050507024,0.95455635,0.00050459936,0.043217875,0.0012615501,0.000018383424],"about_ca_topic_score_codex":0.004451157,"about_ca_topic_score_gemma":0.004331475,"teacher_disagreement_score":0.015282138,"about_ca_system_score_codex":0.0036622225,"about_ca_system_score_gemma":0.003953516,"threshold_uncertainty_score":0.051123798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011993117,0.0006746595,0.97639966,0.0019357377,0.000098263576,0.00008177441,0.000564316,0.00012457387,0.008127845],"genre_scores_gemma":[0.4592068,0.0027020776,0.5098284,0.0010424862,0.0007706004,0.000893043,0.0021476788,0.00066940126,0.022739522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838793,0.00079128885,0.00004422045,0.00033604147,0.00029325,0.00014725202],"domain_scores_gemma":[0.99186796,0.006668621,0.00043693616,0.0003244279,0.0004265598,0.00027547678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029790679,0.0017478565,0.0022763524,0.0009951784,0.0008069797,0.0025199626,0.0033238067,0.0028183977,0.0073493253],"category_scores_gemma":[0.014663013,0.0011605418,0.001168709,0.0021147605,0.002589006,0.004421868,0.0025759095,0.0042028544,0.00090467813],"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.00016313787,0.00017572567,0.0005156469,0.0004457484,0.00009775217,0.00013141592,0.00011757544,0.66670614,0.0010391226,0.29395768,0.013279356,0.02337071],"study_design_scores_gemma":[0.000024528252,0.000016266948,0.00011742881,0.000019886576,0.000009526098,0.00002778342,0.000029933512,0.8712849,0.00015632669,0.12723993,0.0010634913,0.00001001718],"about_ca_topic_score_codex":0.0053380434,"about_ca_topic_score_gemma":0.0069127264,"teacher_disagreement_score":0.0073493253,"about_ca_system_score_codex":0.0025401732,"about_ca_system_score_gemma":0.002285821,"threshold_uncertainty_score":0.024585903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029454296,0.0014644099,0.9180783,0.0010339757,0.00033571207,0.000107829546,0.00030855948,0.00027515183,0.048941888],"genre_scores_gemma":[0.34884334,0.0016994964,0.59433323,0.0008293212,0.00068268663,0.00059932563,0.0011446717,0.0005879787,0.05127991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986205,0.00058553915,0.0000519217,0.00018548517,0.00041497193,0.00014159376],"domain_scores_gemma":[0.9978492,0.0013715819,0.00018794365,0.0001543166,0.0002568231,0.00018014565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023841339,0.0017806336,0.0012633975,0.002006775,0.0014628837,0.0033703842,0.0018829653,0.0015291527,0.008260891],"category_scores_gemma":[0.007855499,0.00096847076,0.0009459588,0.002250969,0.0024026975,0.0034738139,0.0022069237,0.005295396,0.00090872607],"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.00008053933,0.000034317003,0.00016477803,0.00011213313,0.000021388209,0.00003404144,0.00008830857,0.021453327,0.000638295,0.93958473,0.0043603056,0.033427864],"study_design_scores_gemma":[0.000017034154,0.000026011037,0.00011947938,0.000034163288,0.000011036604,0.000038858885,0.0000277081,0.06315036,0.0002795394,0.9316743,0.0046113124,0.0000102987115],"about_ca_topic_score_codex":0.002133038,"about_ca_topic_score_gemma":0.0029950151,"teacher_disagreement_score":0.008260891,"about_ca_system_score_codex":0.0021318812,"about_ca_system_score_gemma":0.00097174733,"threshold_uncertainty_score":0.027635396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11674342,0.0005033241,0.58860695,0.0061832834,0.000628465,0.00017207758,0.0016166309,0.00052650715,0.28501928],"genre_scores_gemma":[0.7041756,0.0006435313,0.16897629,0.001387916,0.0006592422,0.00033746986,0.0014704373,0.00057663606,0.12177296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989121,0.0002571214,0.000046202582,0.00026872364,0.00029303817,0.0002228556],"domain_scores_gemma":[0.9987225,0.00046979406,0.00011884123,0.00029223415,0.0002043755,0.0001921639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008002292,0.0005365632,0.0011473611,0.0007216278,0.0017475123,0.0036130766,0.0018041829,0.0014036295,0.032996595],"category_scores_gemma":[0.0037527508,0.0006548773,0.0008146538,0.0010848168,0.0020803816,0.0055682845,0.0025297645,0.0045413193,0.003694736],"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.00005985292,0.000033574153,0.00009647834,0.00005043924,0.000009041628,0.000054084256,0.00007820129,0.0025175144,0.0005419571,0.97635263,0.007335469,0.012870775],"study_design_scores_gemma":[0.000023708448,0.000021259251,0.000108689856,0.000018200517,0.000005792423,0.0000847829,0.0000832054,0.015294814,0.0008482973,0.9753421,0.00815721,0.000011965504],"about_ca_topic_score_codex":0.0008874946,"about_ca_topic_score_gemma":0.0009078013,"teacher_disagreement_score":0.032996595,"about_ca_system_score_codex":0.0008779688,"about_ca_system_score_gemma":0.00097470806,"threshold_uncertainty_score":0.11038458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042243674,0.00013121664,0.9858803,0.00014740948,0.00013291326,0.00003334774,0.000050687428,0.00008659221,0.009313216],"genre_scores_gemma":[0.18708129,0.000637017,0.7703568,0.0004934198,0.00028722847,0.00044432413,0.00037595886,0.0004339807,0.039890002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976844,0.000092856855,0.0000071766913,0.00003547636,0.00007628849,0.000019813418],"domain_scores_gemma":[0.99975985,0.00006851845,0.000017202414,0.000045557586,0.00007503831,0.000033796718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053900905,0.00077085604,0.0006932833,0.00085282105,0.000501046,0.00086993043,0.00096879527,0.0011082967,0.008842523],"category_scores_gemma":[0.0012048067,0.00042469066,0.00069845567,0.00060952595,0.00066683674,0.0009349813,0.0014065806,0.0015484587,0.0026687752],"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.000096030926,0.00013853626,0.00020282225,0.00015633808,0.00006255697,0.00009303439,0.00010348996,0.121562146,0.0116692595,0.7420187,0.010536228,0.11336097],"study_design_scores_gemma":[0.000031257794,0.000041248804,0.00007126991,0.000025123962,0.00001538867,0.00004942988,0.000018428686,0.7358601,0.0016756987,0.2546248,0.0075736702,0.000013588175],"about_ca_topic_score_codex":0.00041307407,"about_ca_topic_score_gemma":0.00061426644,"teacher_disagreement_score":0.008842523,"about_ca_system_score_codex":0.00031147312,"about_ca_system_score_gemma":0.00063572783,"threshold_uncertainty_score":0.02958119},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045037314,0.00021481387,0.88385147,0.0009562363,0.00044306036,0.00015556352,0.00042387875,0.0006482268,0.0682694],"genre_scores_gemma":[0.5921814,0.00061647943,0.34258905,0.00086680724,0.00055323396,0.00039041272,0.001427395,0.0013858345,0.059989303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992762,0.00020434981,0.000028913755,0.00011448193,0.00027075436,0.000105258914],"domain_scores_gemma":[0.99956197,0.00015440494,0.000034764496,0.00010469685,0.00009530547,0.000048760856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007477133,0.000862722,0.00094867335,0.0006531193,0.0005938904,0.0018136995,0.0012258966,0.00061263255,0.008577839],"category_scores_gemma":[0.0018089525,0.00033137086,0.0016615512,0.0006098037,0.0011410541,0.0019608336,0.002059993,0.0030283143,0.0019170501],"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.00007531278,0.00018559527,0.00008349494,0.00009300349,0.000024950969,0.00008419877,0.000114045164,0.021487303,0.0022040058,0.9156582,0.011274091,0.048715957],"study_design_scores_gemma":[0.000029433791,0.0000556184,0.00006297379,0.00001364284,0.000014093011,0.00006768433,0.00004060442,0.112179995,0.002078866,0.87928754,0.0061538774,0.000015606727],"about_ca_topic_score_codex":0.0006621523,"about_ca_topic_score_gemma":0.0008974432,"teacher_disagreement_score":0.008577839,"about_ca_system_score_codex":0.00068118767,"about_ca_system_score_gemma":0.0010844117,"threshold_uncertainty_score":0.028695762},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04240591,0.0004360541,0.94780385,0.00040963377,0.00012404926,0.00007052707,0.00010438654,0.0004934053,0.008152175],"genre_scores_gemma":[0.4313684,0.00033208154,0.554927,0.00036855252,0.000108815526,0.0002214483,0.0002850873,0.00039543572,0.011993247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992798,0.00028281898,0.000039440398,0.0001152153,0.00021942564,0.00006336554],"domain_scores_gemma":[0.9982224,0.00085886277,0.00011291379,0.00053101935,0.00020055039,0.000074296266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012742486,0.0006014835,0.0017189786,0.0012237652,0.00055671623,0.0013513865,0.0018067884,0.0017636134,0.008337486],"category_scores_gemma":[0.0078072743,0.0007206959,0.0007577546,0.002142467,0.001009183,0.0034711228,0.0023642709,0.0012550983,0.001151953],"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.00073023903,0.00019548845,0.0017717424,0.00047699647,0.00022111366,0.00032198863,0.00015779618,0.22032891,0.007434571,0.37285405,0.010225863,0.38528123],"study_design_scores_gemma":[0.00009066155,0.00007070668,0.00021057621,0.000020591518,0.000030174164,0.00013412409,0.000023559014,0.76534814,0.0017404179,0.23012516,0.0021904223,0.000015463691],"about_ca_topic_score_codex":0.0005658096,"about_ca_topic_score_gemma":0.001035546,"teacher_disagreement_score":0.008337486,"about_ca_system_score_codex":0.000391501,"about_ca_system_score_gemma":0.0007611818,"threshold_uncertainty_score":0.027891695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4741322,0.0017899252,0.24019237,0.037745066,0.0013053302,0.00006326613,0.00056348415,0.0006644163,0.24354392],"genre_scores_gemma":[0.96524996,0.0005072642,0.013836478,0.0021334656,0.000737987,0.00006409024,0.00019923433,0.00017207864,0.017099356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809974,0.0007638094,0.00007979262,0.00039912216,0.0003657975,0.00029173904],"domain_scores_gemma":[0.99349385,0.0039896388,0.0004445766,0.00078717916,0.0006928167,0.00059192657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003083487,0.0007108875,0.0014100154,0.0018929086,0.0036538593,0.0046210177,0.0015638229,0.0025414943,0.007234082],"category_scores_gemma":[0.015299178,0.0007159051,0.001194603,0.0021720424,0.009364689,0.0109194275,0.0048015974,0.005052672,0.0006989684],"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.000010072585,0.0000057183156,0.000059071568,0.0000075629046,0.000001850789,0.00001279441,0.0000832212,0.00018613796,0.000042192518,0.99849653,0.0006391724,0.00045568048],"study_design_scores_gemma":[0.0000062193412,0.0000024154972,0.00004846051,0.000004705039,0.0000020433577,0.000016936856,0.00003605513,0.0016405109,0.00006765368,0.9973902,0.00078036514,0.0000044463145],"about_ca_topic_score_codex":0.0018635261,"about_ca_topic_score_gemma":0.0009716761,"teacher_disagreement_score":0.007234082,"about_ca_system_score_codex":0.0022348694,"about_ca_system_score_gemma":0.0011355258,"threshold_uncertainty_score":0.02420044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15371953,0.0009578491,0.80063593,0.0008312438,0.00008710185,0.00008812783,0.00040798384,0.00026917394,0.04300295],"genre_scores_gemma":[0.88278675,0.0012625675,0.100439146,0.0004019403,0.00032137873,0.00024979995,0.0005931445,0.00022364542,0.013721512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882084,0.00047318972,0.00006639014,0.00017676908,0.00028542543,0.00017728283],"domain_scores_gemma":[0.9976254,0.0010114224,0.0003168243,0.00023822892,0.00043372362,0.00037434767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017263021,0.000915384,0.00066535024,0.0016847661,0.001108123,0.002449982,0.0011168784,0.0008916415,0.0063479203],"category_scores_gemma":[0.0046040444,0.0005805876,0.0010198419,0.0016364129,0.0021606425,0.005684543,0.0033686787,0.0033324854,0.000693091],"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.000017468956,0.000018102755,0.00016131517,0.000034673147,0.000007014559,0.000044751283,0.00015177908,0.0013088803,0.00094714755,0.9920804,0.00050936296,0.0047192257],"study_design_scores_gemma":[0.000007850078,0.000037314585,0.00018503258,0.000024599376,0.000007841376,0.00018674239,0.00014214133,0.01652141,0.0007980276,0.9798522,0.0022204735,0.000016409174],"about_ca_topic_score_codex":0.0002560201,"about_ca_topic_score_gemma":0.00028832234,"teacher_disagreement_score":0.0063479203,"about_ca_system_score_codex":0.0006636028,"about_ca_system_score_gemma":0.0005397754,"threshold_uncertainty_score":0.021235943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016079472,0.0006717611,0.9624991,0.00067761634,0.00022689534,0.00031791604,0.00057593075,0.00023089633,0.01872045],"genre_scores_gemma":[0.3865513,0.0047547626,0.5901939,0.0009041762,0.0009079345,0.0022112934,0.0029682696,0.0011401998,0.010368182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956026,0.00133498,0.00042345174,0.0005303809,0.0016973418,0.00041130433],"domain_scores_gemma":[0.97279716,0.018078374,0.001622719,0.0014630309,0.005282216,0.0007564335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010157324,0.0026480213,0.0024186806,0.0028971033,0.0019717782,0.003977945,0.0029366938,0.0035900034,0.006234088],"category_scores_gemma":[0.067861244,0.0010515767,0.0019382392,0.0022654966,0.003903711,0.0039524925,0.0050604544,0.008037418,0.0024966341],"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.00053499773,0.00024867442,0.0011567821,0.0010859347,0.00016263401,0.00062172284,0.00068458554,0.17080545,0.031256538,0.72328967,0.008855352,0.061297596],"study_design_scores_gemma":[0.00014722999,0.00018745927,0.00086931296,0.00049968116,0.00008642535,0.00036791197,0.00032953633,0.4940956,0.018407708,0.47270918,0.012205423,0.00009440996],"about_ca_topic_score_codex":0.0027172535,"about_ca_topic_score_gemma":0.0013624959,"teacher_disagreement_score":0.010157324,"about_ca_system_score_codex":0.0008857939,"about_ca_system_score_gemma":0.0036414945,"threshold_uncertainty_score":0.053717732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06966328,0.000087281485,0.9258429,0.00089157524,0.00011092242,0.000037378682,0.000020360847,0.00037473932,0.0029715507],"genre_scores_gemma":[0.5963571,0.00013325857,0.3995314,0.00027110107,0.00007768035,0.000073965784,0.00007248135,0.00032127983,0.0031616753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947125,0.00016687177,0.000026905735,0.0001561081,0.00010991781,0.00006886068],"domain_scores_gemma":[0.9977276,0.0014186294,0.00018327053,0.00024880594,0.00031615226,0.00010554696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020247533,0.00043719207,0.0008067264,0.00043956295,0.0004501497,0.0011559784,0.0011529833,0.0025604118,0.0028962465],"category_scores_gemma":[0.01178516,0.000477809,0.00064013025,0.00037328925,0.00081512437,0.002880407,0.0010128248,0.0012943649,0.0005487517],"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.00008016517,0.00005865971,0.0016277483,0.000049079048,0.000060327748,0.00007318108,0.000081031576,0.9152201,0.0021792888,0.02459347,0.0010365485,0.054940425],"study_design_scores_gemma":[0.0000066076104,0.000009401496,0.00007813208,0.000003302884,0.000004832784,0.000012076252,0.000006961558,0.9955407,0.00028979382,0.003892355,0.00015228624,0.00000362396],"about_ca_topic_score_codex":0.003177293,"about_ca_topic_score_gemma":0.0020229754,"teacher_disagreement_score":0.003177293,"about_ca_system_score_codex":0.0005768888,"about_ca_system_score_gemma":0.00087805325,"threshold_uncertainty_score":0.010708034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029094566,0.0003051676,0.9951178,0.00019849173,0.0000785594,0.000016110624,0.000011692203,0.000040468163,0.001322235],"genre_scores_gemma":[0.2572363,0.0012123872,0.7298312,0.00031208654,0.00023565034,0.0002974465,0.00017131669,0.00030628702,0.0103972815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991048,0.00052630313,0.000038131275,0.00010263074,0.00018195108,0.000046163794],"domain_scores_gemma":[0.9966233,0.002582193,0.00018551521,0.00021616156,0.00031063447,0.00008222851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023683773,0.00087637664,0.00088268414,0.00062699115,0.00050047465,0.0011694985,0.0014045334,0.0013698518,0.0026327907],"category_scores_gemma":[0.009657412,0.0007552333,0.00083536207,0.0009444255,0.0022304177,0.0022685532,0.0018574346,0.0027916818,0.0004887571],"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.00018657438,0.00008885543,0.00045752665,0.00037098944,0.000057540547,0.00009845496,0.0002828755,0.62993526,0.0055098217,0.2882291,0.0035151937,0.07126786],"study_design_scores_gemma":[0.000009323694,0.000021410524,0.000036634978,0.000013038482,0.0000043503305,0.000013325208,0.0000140523225,0.9734379,0.0005487284,0.024749191,0.0011450495,0.0000069647817],"about_ca_topic_score_codex":0.003189601,"about_ca_topic_score_gemma":0.0034279355,"teacher_disagreement_score":0.003189601,"about_ca_system_score_codex":0.000781604,"about_ca_system_score_gemma":0.0011279548,"threshold_uncertainty_score":0.01252532},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004728652,0.000051418072,0.9913799,0.000076963915,0.000046982626,0.00003660281,0.000013503976,0.00036390687,0.0033020268],"genre_scores_gemma":[0.08223605,0.00010197407,0.9137229,0.00009546362,0.000030809875,0.0001351567,0.000073474526,0.00024204188,0.0033620826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932504,0.00025758293,0.000025626314,0.0000585743,0.0002734227,0.000059786908],"domain_scores_gemma":[0.99916327,0.0003726352,0.00003918948,0.00013886896,0.00024484505,0.00004114973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647343,0.00091960886,0.0011296232,0.0006030529,0.0009454465,0.001004325,0.0014697174,0.0011416723,0.005782886],"category_scores_gemma":[0.00397144,0.0005163309,0.0005911663,0.0009830217,0.0009133318,0.0013338005,0.0016791847,0.002169607,0.001601113],"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.0003927441,0.0002574052,0.00054779806,0.00019399304,0.000048468,0.00010667308,0.00019644268,0.55821085,0.008008554,0.10440538,0.005999732,0.32163203],"study_design_scores_gemma":[0.000023678189,0.000027548896,0.000032441316,0.0000087247445,0.0000044962644,0.00001725532,0.000011582618,0.9873077,0.0013831164,0.009405501,0.0017726924,0.000005165731],"about_ca_topic_score_codex":0.003599539,"about_ca_topic_score_gemma":0.004360995,"teacher_disagreement_score":0.005782886,"about_ca_system_score_codex":0.00045100035,"about_ca_system_score_gemma":0.0010294729,"threshold_uncertainty_score":0.019345641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041140676,0.000044110777,0.98919684,0.00015314374,0.00006629546,0.00006979914,0.00013681398,0.00042851726,0.005790381],"genre_scores_gemma":[0.25024202,0.0001707677,0.7356813,0.00021066294,0.00008975616,0.00023936185,0.0005642291,0.00036137048,0.0124406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933165,0.0001613123,0.000039702845,0.00011834839,0.00026039564,0.00008862524],"domain_scores_gemma":[0.99912053,0.0002741071,0.000056968784,0.00031682831,0.00017212666,0.000059520622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009629205,0.0005614533,0.00062848954,0.0007345673,0.00091400906,0.001366075,0.0020072116,0.0008017,0.013910449],"category_scores_gemma":[0.003057949,0.00036885362,0.00069972355,0.0011085533,0.00080583134,0.0018196114,0.002973066,0.0024816522,0.0024277535],"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.00031235605,0.0001593809,0.00022892002,0.00010940047,0.000021995706,0.00011207645,0.00014290545,0.11087312,0.01000382,0.61944115,0.011585878,0.247009],"study_design_scores_gemma":[0.00005799548,0.000066040164,0.00007496517,0.000025509798,0.0000108765325,0.000064627835,0.000020663372,0.84245765,0.0038441876,0.14305629,0.010299935,0.000021281026],"about_ca_topic_score_codex":0.001373195,"about_ca_topic_score_gemma":0.0018999885,"teacher_disagreement_score":0.013910449,"about_ca_system_score_codex":0.00090437225,"about_ca_system_score_gemma":0.00094676524,"threshold_uncertainty_score":0.046535075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13533488,0.0012524574,0.7799886,0.0018499197,0.00037493755,0.000093287425,0.0003010439,0.00016181631,0.08064305],"genre_scores_gemma":[0.85463375,0.0016872669,0.10742863,0.0005595921,0.000614214,0.0002352661,0.00035529135,0.0003269176,0.034159053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994387,0.00019778393,0.000023102883,0.00009376186,0.00012619709,0.000120486904],"domain_scores_gemma":[0.9986551,0.00048718406,0.00024562163,0.000118587996,0.000211892,0.00028167132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013333877,0.0012170757,0.0008272199,0.0013919631,0.001480353,0.0024542417,0.0014806843,0.0013237995,0.0098885065],"category_scores_gemma":[0.0037502882,0.0005701673,0.00078218896,0.0012702758,0.002466711,0.0033770637,0.002078465,0.0019665398,0.0009121903],"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.000012482285,0.0000169144,0.00008814491,0.000017761708,0.0000038523876,0.000018311272,0.00006225448,0.013630998,0.0003344674,0.9806466,0.0007744402,0.0043937056],"study_design_scores_gemma":[0.000004291461,0.000014410866,0.000095795454,0.000011665167,0.0000027438384,0.000011782857,0.000045567605,0.06586155,0.00009675869,0.9327211,0.0011252494,0.000009009406],"about_ca_topic_score_codex":0.0020016027,"about_ca_topic_score_gemma":0.0028488704,"teacher_disagreement_score":0.0098885065,"about_ca_system_score_codex":0.0011449744,"about_ca_system_score_gemma":0.0010312614,"threshold_uncertainty_score":0.03308034},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051441306,0.016112054,0.004247647,0.03633302,0.89608145,0.000062004896,0.00051619223,0.00021547964,0.045917813],"genre_scores_gemma":[0.0054916623,0.013621199,0.0019790689,0.010407677,0.7468601,0.00011037327,0.0010514132,0.00063674996,0.21984173],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991523,0.0001122107,0.00009120107,0.00018113646,0.00039264225,0.00007037345],"domain_scores_gemma":[0.99598324,0.0012294136,0.00025436663,0.00024189409,0.0017229087,0.00056827796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400415,0.0026022112,0.0026528765,0.002944509,0.0015148715,0.0045175124,0.001440936,0.003907404,0.08964048],"category_scores_gemma":[0.00486155,0.0004979935,0.001239077,0.0018926375,0.00078809995,0.0046606455,0.0011843798,0.004053681,0.050808746],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000027709517,0.000016547338,0.000033650278,0.00018777463,0.000010632537,0.00004816058,0.000006141141,0.00009212129,0.00020112986,0.0024995555,0.9804598,0.016416736],"study_design_scores_gemma":[0.000022356608,0.00006506122,0.0005968108,0.00020577056,0.000034250803,0.00023766019,0.000024140798,0.001061423,0.00047999705,0.010508499,0.9867437,0.000020282481],"about_ca_topic_score_codex":0.0004596679,"about_ca_topic_score_gemma":0.0012328001,"teacher_disagreement_score":0.08964048,"about_ca_system_score_codex":0.0014477775,"about_ca_system_score_gemma":0.0010487784,"threshold_uncertainty_score":0.2998773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022042427,0.0002728704,0.97188675,0.0006682698,0.000045502602,0.000027991853,0.00008193664,0.0000673914,0.004906828],"genre_scores_gemma":[0.8301515,0.00069712184,0.15643705,0.00016016762,0.00014007636,0.00020582175,0.00013431552,0.00009673018,0.011977248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858785,0.0007261067,0.000046129662,0.00022334742,0.00026712887,0.00014943202],"domain_scores_gemma":[0.99782157,0.0014241333,0.00030633286,0.000107821914,0.00021644664,0.00012371184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028502552,0.000981372,0.0013067817,0.0006359127,0.00052687794,0.002727962,0.0021068868,0.0023242447,0.002243754],"category_scores_gemma":[0.0063055144,0.0010025019,0.00096366485,0.0009982241,0.0016775834,0.0026091149,0.0012803479,0.0024058165,0.00028631088],"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.000018442619,0.000024047242,0.00008161272,0.00002107023,0.000017618659,0.00004130031,0.000019788362,0.8790499,0.00046159062,0.11761022,0.0003111397,0.002343214],"study_design_scores_gemma":[0.000005939566,0.000012278638,0.000029587103,0.0000034107607,0.000006084851,0.000009547351,0.0000031277773,0.97762364,0.00008785635,0.02201183,0.00019944963,0.000007275456],"about_ca_topic_score_codex":0.0024801972,"about_ca_topic_score_gemma":0.0020729918,"teacher_disagreement_score":0.0028502552,"about_ca_system_score_codex":0.0018897076,"about_ca_system_score_gemma":0.0018048434,"threshold_uncertainty_score":0.015073717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025029069,0.0020705576,0.9346903,0.0053334883,0.00020776893,0.000050034552,0.00046866463,0.00008944839,0.032060727],"genre_scores_gemma":[0.7559467,0.009084015,0.20066456,0.0021393152,0.0019381994,0.00067971373,0.001248183,0.00027166415,0.02802762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977673,0.0011840983,0.00006820383,0.00026575575,0.0005554552,0.00015925703],"domain_scores_gemma":[0.98932487,0.008189277,0.0007823378,0.00033109688,0.00091130566,0.0004610993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032931578,0.0017662302,0.001601366,0.0021215442,0.0009295178,0.003856556,0.0017397841,0.0016413695,0.0070137414],"category_scores_gemma":[0.017403431,0.00077948236,0.0010614637,0.0018961817,0.0046904143,0.0054607764,0.0034554983,0.0056515713,0.0008050553],"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.00003187021,0.000017886196,0.00014790588,0.00006903452,0.000017276283,0.00004291809,0.00006803188,0.015562252,0.0003803471,0.97642446,0.0020743427,0.005163558],"study_design_scores_gemma":[0.00001121955,0.000021645232,0.000108910346,0.00002064985,0.0000054314464,0.000032940574,0.000032917902,0.06449594,0.0001330565,0.9337033,0.0014242319,0.000009812893],"about_ca_topic_score_codex":0.0016627167,"about_ca_topic_score_gemma":0.0010423199,"teacher_disagreement_score":0.0070137414,"about_ca_system_score_codex":0.0017426137,"about_ca_system_score_gemma":0.0010659051,"threshold_uncertainty_score":0.023463309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042332258,0.0009476809,0.9149286,0.0043597147,0.00022403257,0.00022856976,0.0007719238,0.001293894,0.034913436],"genre_scores_gemma":[0.3932998,0.0013479859,0.5698802,0.0017443644,0.0007164936,0.0010142744,0.0023869346,0.0013777427,0.028232144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968483,0.0011608562,0.000123598,0.0007154365,0.0007030213,0.00044883133],"domain_scores_gemma":[0.98774314,0.0085328575,0.0005843768,0.0019464212,0.00070872536,0.00048442863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030354748,0.002244497,0.001983083,0.0015223258,0.0022231424,0.00564871,0.0053320765,0.0027699603,0.013999281],"category_scores_gemma":[0.019111875,0.0013583938,0.0025382978,0.0030443883,0.0034367202,0.013898341,0.00563289,0.009339146,0.0023524114],"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.00051683356,0.0005451869,0.0008370996,0.00041725533,0.00008468943,0.000056114623,0.0003278609,0.06231426,0.0019123192,0.80024534,0.02472439,0.108018614],"study_design_scores_gemma":[0.000073020885,0.0000379497,0.00018241847,0.000030390467,0.00003249656,0.000048729125,0.000060848764,0.151387,0.0008718615,0.8443739,0.0028819912,0.000019471723],"about_ca_topic_score_codex":0.0029163738,"about_ca_topic_score_gemma":0.005600083,"teacher_disagreement_score":0.013999281,"about_ca_system_score_codex":0.004052667,"about_ca_system_score_gemma":0.0038468644,"threshold_uncertainty_score":0.046832263},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09329771,0.00011939411,0.9023368,0.00024026263,0.00006220706,0.000025322192,0.000073573276,0.00026746085,0.0035774023],"genre_scores_gemma":[0.7852034,0.00021126981,0.20885406,0.00007918931,0.0000528683,0.000045638997,0.00025008837,0.0003129241,0.0049905796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936515,0.00023552062,0.000025715992,0.00008970594,0.00019778994,0.00008620011],"domain_scores_gemma":[0.99754757,0.0014027435,0.00018634008,0.0002584102,0.00038934583,0.0002155956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890358,0.00072719576,0.00096283696,0.001100676,0.00043353104,0.0025203847,0.0010751709,0.001079704,0.005505748],"category_scores_gemma":[0.01216727,0.00054535747,0.00053881516,0.0010182322,0.0013278162,0.0026133745,0.002093467,0.0017956977,0.00096336973],"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.0006430328,0.000179938,0.0032888604,0.00023336327,0.000069659676,0.00023463528,0.00027169412,0.56914306,0.009598839,0.26582232,0.0035310052,0.14698367],"study_design_scores_gemma":[0.000012701599,0.00006968321,0.00037367232,0.000017023222,0.000011163686,0.00006139869,0.00006913849,0.94465446,0.0041818204,0.04966881,0.0008665246,0.000013562624],"about_ca_topic_score_codex":0.0010545026,"about_ca_topic_score_gemma":0.001021932,"teacher_disagreement_score":0.005505748,"about_ca_system_score_codex":0.001095964,"about_ca_system_score_gemma":0.0011250012,"threshold_uncertainty_score":0.01841855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009915563,0.00007902614,0.99713194,0.00007138232,0.000047079073,0.00002579061,0.000026040923,0.000077043915,0.0015501945],"genre_scores_gemma":[0.04929928,0.00027262737,0.9439216,0.00017652778,0.00013546308,0.00027666902,0.00020272448,0.00029923415,0.0054157544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993395,0.0001764838,0.000018084214,0.000085596956,0.0003325944,0.000047711448],"domain_scores_gemma":[0.998858,0.0005946925,0.000059651233,0.00006518538,0.0003451445,0.000077292105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014333888,0.001001386,0.0013395757,0.0012822095,0.00061801885,0.0014874416,0.0018097502,0.0014838956,0.008246558],"category_scores_gemma":[0.004184294,0.0006264338,0.00083925243,0.0010961796,0.00087108754,0.001530431,0.0019327125,0.0031956912,0.0014575877],"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.00031960494,0.00026880423,0.0003599074,0.0004132124,0.000097874734,0.00012560678,0.00016762088,0.27374256,0.013141371,0.3421292,0.0194257,0.34980854],"study_design_scores_gemma":[0.00003373943,0.00004469582,0.000065537715,0.00002063231,0.000015030363,0.00004777036,0.0000141287055,0.95569587,0.0010755433,0.03762836,0.0053466964,0.000012019728],"about_ca_topic_score_codex":0.0018133076,"about_ca_topic_score_gemma":0.0019600545,"teacher_disagreement_score":0.008246558,"about_ca_system_score_codex":0.0008722068,"about_ca_system_score_gemma":0.0015313982,"threshold_uncertainty_score":0.027587533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014504191,0.00018824653,0.97695315,0.00040366722,0.000059296286,0.00007495932,0.000046436006,0.000100041354,0.00766998],"genre_scores_gemma":[0.31960148,0.0005883798,0.6636315,0.00039585974,0.00017978692,0.0005024292,0.00021152906,0.00038485785,0.014504178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910057,0.00045344193,0.000037136182,0.0001321474,0.00020438054,0.00007227351],"domain_scores_gemma":[0.99711967,0.0023280578,0.00013405047,0.0001555155,0.00015448048,0.00010823155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020649128,0.0013895796,0.0017752259,0.00070262694,0.0007249207,0.0018915226,0.0013955056,0.0022553885,0.0055143763],"category_scores_gemma":[0.00932856,0.0010559658,0.0012661532,0.0014131005,0.0020876105,0.0028721797,0.00350551,0.0028739064,0.0005570695],"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.00009633649,0.00015904605,0.00034179538,0.00027555486,0.000049543927,0.00008692784,0.00016225303,0.74042624,0.0013076735,0.21371503,0.0023671298,0.041012418],"study_design_scores_gemma":[0.000011700583,0.000029864128,0.00003389824,0.000012838155,0.000005879827,0.00001062343,0.000013222107,0.9350828,0.00017748134,0.06388531,0.00073098356,0.000005459984],"about_ca_topic_score_codex":0.0021512727,"about_ca_topic_score_gemma":0.0025716864,"teacher_disagreement_score":0.0055143763,"about_ca_system_score_codex":0.0007955218,"about_ca_system_score_gemma":0.0010105434,"threshold_uncertainty_score":0.018447459},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23677652,0.0008083449,0.7064205,0.0029142092,0.0001590342,0.00023225186,0.00093954155,0.00032645,0.05142317],"genre_scores_gemma":[0.82453257,0.001208166,0.15877141,0.0006018602,0.0005573883,0.0005293323,0.0021403506,0.00039715334,0.011261749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763846,0.0005255089,0.00015673498,0.0005189071,0.000848872,0.00031151218],"domain_scores_gemma":[0.9719173,0.020012645,0.0032188864,0.0020449164,0.0018435743,0.000962762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024001058,0.001004281,0.0011653196,0.0028066959,0.0019815548,0.006090558,0.003207936,0.0023126306,0.011536684],"category_scores_gemma":[0.028558984,0.0016019372,0.0020194915,0.004488996,0.003980606,0.013260262,0.0027670262,0.006299175,0.0010033953],"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.00008810605,0.000095134434,0.0011554305,0.00014522602,0.000021337224,0.000092542396,0.00038369242,0.016188486,0.0017532686,0.96264863,0.0017712713,0.015656846],"study_design_scores_gemma":[0.000018343255,0.000035503046,0.00061326363,0.000029952065,0.000018636207,0.00020285988,0.0001636439,0.025070185,0.0006968606,0.9713111,0.0018242762,0.000015312673],"about_ca_topic_score_codex":0.0007228184,"about_ca_topic_score_gemma":0.00094424025,"teacher_disagreement_score":0.011536684,"about_ca_system_score_codex":0.0015533661,"about_ca_system_score_gemma":0.0013159892,"threshold_uncertainty_score":0.038594067},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07431375,0.010720363,0.8163413,0.0052316356,0.00065867376,0.00011813955,0.00029136325,0.000164546,0.09216027],"genre_scores_gemma":[0.7176469,0.01198361,0.23227838,0.001754409,0.0014568815,0.00037770654,0.00035348732,0.00024959544,0.03389901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985898,0.00074177823,0.00008046805,0.00017456252,0.000275377,0.00013798829],"domain_scores_gemma":[0.9930483,0.004796982,0.0005045245,0.00026982726,0.00094272604,0.00043748762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005150905,0.0010236723,0.0014503752,0.002793367,0.0015343582,0.0028733215,0.0015386216,0.001658606,0.0055356505],"category_scores_gemma":[0.012307699,0.00060388923,0.0016987912,0.002116516,0.0037896049,0.006006917,0.0027825823,0.0052642496,0.0005423276],"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.000045107838,0.00004782929,0.00029206934,0.00015248335,0.000018869203,0.00011694772,0.00022939677,0.005632243,0.0019479322,0.97461104,0.0016362282,0.015269758],"study_design_scores_gemma":[0.000010143336,0.00003281612,0.00025753994,0.000055312725,0.00001193002,0.00013381042,0.0001163925,0.057101596,0.0008271648,0.93710804,0.004317573,0.000027625403],"about_ca_topic_score_codex":0.0016530236,"about_ca_topic_score_gemma":0.0015711915,"teacher_disagreement_score":0.0055356505,"about_ca_system_score_codex":0.0013297372,"about_ca_system_score_gemma":0.0014185295,"threshold_uncertainty_score":0.027240872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08702057,0.001034958,0.8668405,0.0033813645,0.00025523815,0.00013644376,0.000487365,0.00030075698,0.040542837],"genre_scores_gemma":[0.6829575,0.0017707614,0.26670128,0.0012699952,0.0008622137,0.000700104,0.0011421737,0.0005740488,0.044022005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969627,0.0010919392,0.00014045353,0.0005841968,0.00083998195,0.00038067467],"domain_scores_gemma":[0.98526275,0.010459967,0.00090259215,0.0012057888,0.0011267134,0.0010420901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034302936,0.0012867894,0.0018888247,0.0015928783,0.0025926854,0.006038712,0.0027418283,0.0015671686,0.009054913],"category_scores_gemma":[0.017029801,0.0016336294,0.0016842057,0.0024906618,0.004935509,0.012942287,0.0060315663,0.011183013,0.001000207],"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.000068751804,0.000044731594,0.00017654442,0.00006872008,0.000015533218,0.000019420211,0.00016511302,0.0065165763,0.0003286306,0.98237234,0.002109552,0.008114064],"study_design_scores_gemma":[0.000009647522,0.000010668828,0.000059384,0.000009981724,0.0000067623323,0.000018313387,0.000031448562,0.021065785,0.00022027292,0.97707886,0.0014807929,0.000008098873],"about_ca_topic_score_codex":0.0023778477,"about_ca_topic_score_gemma":0.0021809028,"teacher_disagreement_score":0.009054913,"about_ca_system_score_codex":0.0034375077,"about_ca_system_score_gemma":0.0020560944,"threshold_uncertainty_score":0.030291677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104656525,0.0030151003,0.801531,0.009166197,0.00051108043,0.0002748637,0.003280707,0.0006954009,0.07686911],"genre_scores_gemma":[0.7050945,0.0028819512,0.24234319,0.001473761,0.0009688666,0.0005183289,0.0031699971,0.0005949657,0.04295443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863845,0.0004002,0.00006213152,0.00040992262,0.00027213944,0.00021710947],"domain_scores_gemma":[0.9942286,0.004138719,0.0004365166,0.0004169998,0.00037440273,0.00040474112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013326596,0.0011361543,0.0017089067,0.0011499834,0.0012178174,0.005107108,0.003918099,0.0032182643,0.013732766],"category_scores_gemma":[0.008650244,0.0010439517,0.0010026437,0.0031125115,0.0019316202,0.0072453883,0.0021768513,0.004432309,0.0012791393],"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.0005078846,0.00028063677,0.0011816641,0.0010836715,0.00012922482,0.00027247358,0.00022012921,0.24993709,0.0017375699,0.6102939,0.042705726,0.09165004],"study_design_scores_gemma":[0.00006106285,0.00003522606,0.00040318706,0.00007444382,0.000037176946,0.000275799,0.00010718458,0.2716936,0.00080845156,0.71828836,0.008183212,0.00003237566],"about_ca_topic_score_codex":0.0018170583,"about_ca_topic_score_gemma":0.0019885784,"teacher_disagreement_score":0.013732766,"about_ca_system_score_codex":0.0021960218,"about_ca_system_score_gemma":0.001819354,"threshold_uncertainty_score":0.045940638},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12947744,0.0014734732,0.84731025,0.0014214905,0.0001808645,0.00017473254,0.00044935266,0.0012618967,0.018250473],"genre_scores_gemma":[0.43646166,0.0010749381,0.55367845,0.00028050668,0.00018615443,0.00032275927,0.0010941614,0.0004908002,0.0064106556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800783,0.0006947898,0.000091570975,0.00033154263,0.0005284661,0.0003457834],"domain_scores_gemma":[0.9912845,0.0069327946,0.00052673754,0.00071172504,0.00030724445,0.00023705992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021992968,0.0018001077,0.0021858395,0.0018253573,0.0009319551,0.0033491356,0.0024773604,0.0020498158,0.007081305],"category_scores_gemma":[0.015178596,0.0013041743,0.0014880012,0.0036329562,0.0011682115,0.008684224,0.0023871604,0.003566096,0.00080505345],"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.00045364964,0.000469961,0.0016390677,0.0002974857,0.0000803123,0.000082652616,0.00017091657,0.7905889,0.0013521027,0.089564905,0.006372939,0.108927116],"study_design_scores_gemma":[0.00003089202,0.00004266788,0.00011389935,0.000016160093,0.000017355382,0.000026740809,0.0000433862,0.9333862,0.00060112594,0.064672634,0.0010433289,0.000005640134],"about_ca_topic_score_codex":0.0029823086,"about_ca_topic_score_gemma":0.004472892,"teacher_disagreement_score":0.007081305,"about_ca_system_score_codex":0.0022287692,"about_ca_system_score_gemma":0.0016141298,"threshold_uncertainty_score":0.02368933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02668675,0.0001915643,0.9712435,0.00013753244,0.00003451077,0.000051996278,0.000042997424,0.00018485988,0.0014263247],"genre_scores_gemma":[0.35065615,0.0004649781,0.6420283,0.000068043795,0.00007884657,0.00021428612,0.0002952776,0.00038790662,0.005806265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899155,0.0004349057,0.00004163534,0.0001616673,0.00027597902,0.00009421655],"domain_scores_gemma":[0.9953566,0.0032934654,0.00026053644,0.00023171659,0.00056377763,0.00029389656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032727043,0.0016740065,0.0023311125,0.0023939824,0.00085787167,0.0020742824,0.0019344792,0.0023556824,0.0038789508],"category_scores_gemma":[0.014849747,0.0016104869,0.0010490293,0.0013453342,0.0021790173,0.0026977602,0.003305448,0.002781397,0.0009230926],"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.000392842,0.00020698972,0.0011410456,0.00040482698,0.00010816949,0.00016569397,0.0002742788,0.7614292,0.004592224,0.1262148,0.0026827427,0.102387175],"study_design_scores_gemma":[0.000026933145,0.00008904053,0.00016890897,0.000029610672,0.000016691301,0.000031953354,0.0000488529,0.917621,0.0021472913,0.078985214,0.0008217303,0.000012764512],"about_ca_topic_score_codex":0.0021087544,"about_ca_topic_score_gemma":0.0028406912,"teacher_disagreement_score":0.0038789508,"about_ca_system_score_codex":0.0013509633,"about_ca_system_score_gemma":0.0017157847,"threshold_uncertainty_score":0.017307878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001741496,0.003420454,0.98812765,0.00072854705,0.0005780935,0.000028526896,0.000040787632,0.00010562561,0.0052288766],"genre_scores_gemma":[0.20256484,0.020838125,0.7420939,0.0022196777,0.0059355386,0.0009578286,0.00042897515,0.0015388262,0.023422342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906138,0.0046479367,0.0006062396,0.00082784303,0.0029103302,0.00039381103],"domain_scores_gemma":[0.9179041,0.0638807,0.0037091943,0.0038869202,0.009406069,0.0012130339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021896672,0.0037591513,0.002517999,0.0070001255,0.0013027635,0.005449771,0.004305236,0.0045571043,0.0064412844],"category_scores_gemma":[0.11663951,0.0015408832,0.002782097,0.004852992,0.0068003237,0.011551157,0.008134025,0.012267901,0.0022474665],"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.000112862006,0.000066440596,0.00048046221,0.00041063628,0.00011621654,0.00010459075,0.00039106587,0.09850123,0.0017436146,0.8349971,0.005562107,0.05751371],"study_design_scores_gemma":[0.00001822495,0.000046015095,0.00022933637,0.00021668099,0.000056273588,0.00010663159,0.000066236775,0.49181056,0.00153741,0.49745274,0.008384845,0.00007509642],"about_ca_topic_score_codex":0.0013589892,"about_ca_topic_score_gemma":0.0011392925,"teacher_disagreement_score":0.021896672,"about_ca_system_score_codex":0.0021913063,"about_ca_system_score_gemma":0.0015344804,"threshold_uncertainty_score":0.11580205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062118724,0.0003318657,0.9047351,0.0006423343,0.0001392369,0.00004018782,0.0000758712,0.00017651757,0.031740196],"genre_scores_gemma":[0.73997223,0.0010322074,0.1813979,0.00060691335,0.00042555865,0.00026142056,0.00022864414,0.0004917527,0.07558342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995376,0.00016728537,0.000017345123,0.000058941056,0.00017768248,0.00004115365],"domain_scores_gemma":[0.99934465,0.0003145604,0.000080813,0.000075501266,0.000103682454,0.000080883394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011048007,0.0006388717,0.0005952116,0.00085483055,0.0006474374,0.0021543785,0.0007488268,0.0011851302,0.008043952],"category_scores_gemma":[0.0022304964,0.0004155017,0.0006781123,0.00067051983,0.0014522992,0.0033032938,0.0021664484,0.002615553,0.0013587853],"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.000021021639,0.000022730721,0.000052191856,0.000021186672,0.000006377891,0.00002735418,0.00010088788,0.0056442353,0.0021800702,0.98107946,0.0007991365,0.010045365],"study_design_scores_gemma":[0.000011590177,0.000030807554,0.000054026576,0.000008656782,0.0000059490503,0.000076524506,0.00004095327,0.1185263,0.0012118084,0.8765333,0.0034863786,0.000013734409],"about_ca_topic_score_codex":0.00021979258,"about_ca_topic_score_gemma":0.00027980973,"teacher_disagreement_score":0.008043952,"about_ca_system_score_codex":0.00070662337,"about_ca_system_score_gemma":0.0004486897,"threshold_uncertainty_score":0.02690965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052056305,0.0011901491,0.9102406,0.002936946,0.0007163587,0.00035577518,0.0010960278,0.004130193,0.027277634],"genre_scores_gemma":[0.13502738,0.0005047527,0.84665596,0.0005297021,0.00030541193,0.00042036778,0.0018179666,0.00039363935,0.014344925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850404,0.0002436559,0.00009848044,0.00038267273,0.0005279149,0.0002433322],"domain_scores_gemma":[0.9982955,0.0006777773,0.00016474669,0.0004140811,0.00028148585,0.00016650898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010268653,0.001678157,0.001677114,0.0013246388,0.0010938477,0.0024550976,0.0034814815,0.002440007,0.014464374],"category_scores_gemma":[0.0044517764,0.0008884358,0.0017386863,0.0026648345,0.00083839195,0.0043746373,0.002446755,0.0036497735,0.0055649984],"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.0017221654,0.0009056593,0.0015014977,0.0005946725,0.00023038844,0.0001823571,0.0002675345,0.14715627,0.016540036,0.061808035,0.061757363,0.707334],"study_design_scores_gemma":[0.00064084603,0.00032885245,0.0012198477,0.00007396129,0.00015463785,0.0006007425,0.00013935263,0.85877496,0.006916829,0.11040364,0.02066943,0.00007694125],"about_ca_topic_score_codex":0.0029951248,"about_ca_topic_score_gemma":0.005083207,"teacher_disagreement_score":0.014464374,"about_ca_system_score_codex":0.0026716487,"about_ca_system_score_gemma":0.0029930694,"threshold_uncertainty_score":0.048388183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016391538,0.000108805056,0.97191477,0.00027490073,0.00011452236,0.00005848784,0.000063936226,0.00010612294,0.010966795],"genre_scores_gemma":[0.46933037,0.00046421483,0.5098907,0.00031181815,0.00026002672,0.00033572785,0.00020601109,0.00044713132,0.018754026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952006,0.000261595,0.000014355545,0.000054614156,0.000105725194,0.000043729717],"domain_scores_gemma":[0.99842036,0.0010160782,0.00011811378,0.00014098818,0.0001588446,0.00014562673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018600355,0.00078675715,0.0010761126,0.0007010996,0.0007229776,0.0013202564,0.0016380209,0.001257858,0.008979104],"category_scores_gemma":[0.0059977113,0.0004833883,0.001165737,0.0013119188,0.0016587701,0.0019982222,0.0019179328,0.002801557,0.0007603434],"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.00006264861,0.00009834264,0.00026116797,0.00005885892,0.00001886377,0.00012251681,0.000085299165,0.2892154,0.0010786873,0.6835835,0.002214695,0.023200074],"study_design_scores_gemma":[0.0000147579785,0.00002055897,0.000036820486,0.0000076076826,0.0000044619655,0.000016127015,0.000012667054,0.78845185,0.00017977974,0.21042591,0.00082239177,0.000007124463],"about_ca_topic_score_codex":0.0015919275,"about_ca_topic_score_gemma":0.0018572226,"teacher_disagreement_score":0.008979104,"about_ca_system_score_codex":0.0009157883,"about_ca_system_score_gemma":0.0011027561,"threshold_uncertainty_score":0.030038118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010407752,0.00006606267,0.99743587,0.000028218474,0.00003730288,0.00001851543,0.000004953056,0.000106902226,0.0012614042],"genre_scores_gemma":[0.036637764,0.00019855362,0.96068496,0.000038345806,0.000061082894,0.00014160029,0.000033205,0.0001681983,0.002036248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990916,0.00025315623,0.000037998845,0.000085280146,0.0004781997,0.000053731073],"domain_scores_gemma":[0.9988418,0.0006753478,0.00006193756,0.00009543738,0.00027402068,0.00005151653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018821985,0.0010576592,0.0024855435,0.0013127389,0.00066434726,0.001304224,0.0020916427,0.0018664746,0.005321627],"category_scores_gemma":[0.0037419614,0.0008432893,0.0010733206,0.0017641153,0.000902435,0.0017044896,0.0012519826,0.0025085744,0.0019909695],"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.00015807334,0.00032416772,0.00047410128,0.0002512508,0.00007777944,0.00011204118,0.00013009715,0.5493877,0.008833712,0.08633695,0.0035051527,0.35040894],"study_design_scores_gemma":[0.000014140374,0.0000319025,0.000049614595,0.000011460281,0.0000127745925,0.000027989186,0.0000043654863,0.9912144,0.00070596393,0.006167457,0.0017528195,0.0000071419504],"about_ca_topic_score_codex":0.0028713648,"about_ca_topic_score_gemma":0.0025861817,"teacher_disagreement_score":0.005321627,"about_ca_system_score_codex":0.00056675874,"about_ca_system_score_gemma":0.0014581305,"threshold_uncertainty_score":0.017802596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01321498,0.0017193981,0.95835745,0.0025757346,0.00045745398,0.00011648406,0.00029425716,0.00028414637,0.022980055],"genre_scores_gemma":[0.12462711,0.0024117054,0.85666907,0.0010131446,0.0011015761,0.0004752729,0.00088422716,0.00057872734,0.01223925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817395,0.0007510717,0.00008235401,0.00027549476,0.0005525758,0.00016448347],"domain_scores_gemma":[0.9961165,0.00230366,0.00040671765,0.0004948,0.00038050866,0.00029786167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027708062,0.001876541,0.0018503617,0.0018364534,0.0012053399,0.0031565137,0.0035887617,0.0023863714,0.007862358],"category_scores_gemma":[0.012970387,0.0012686526,0.0020741178,0.0031559616,0.0020207872,0.0066193547,0.0043020323,0.008053938,0.001471018],"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.00022422556,0.00026589053,0.00040189663,0.00042190304,0.00008290912,0.00008819396,0.0002930022,0.18819267,0.0021593391,0.6698818,0.027446976,0.110541165],"study_design_scores_gemma":[0.00007479238,0.0000719716,0.00018980789,0.00007081525,0.000031154148,0.00010464488,0.00008417109,0.47725216,0.00064031826,0.5059269,0.015516291,0.000036940128],"about_ca_topic_score_codex":0.0014758152,"about_ca_topic_score_gemma":0.0021532143,"teacher_disagreement_score":0.007862358,"about_ca_system_score_codex":0.0023032157,"about_ca_system_score_gemma":0.0015710368,"threshold_uncertainty_score":0.026302218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02232997,0.011412852,0.9375955,0.0032694456,0.00093643175,0.00009546582,0.00025517173,0.00031501334,0.02379017],"genre_scores_gemma":[0.54170287,0.020876788,0.36789238,0.0039512566,0.0033775463,0.0009704095,0.0018804901,0.0027665517,0.056581683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99093425,0.0036910127,0.00051365484,0.0011029048,0.0028444235,0.00091381633],"domain_scores_gemma":[0.9180068,0.067236766,0.002251999,0.0037180814,0.006469704,0.002316818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023468144,0.00478363,0.0041607916,0.005353895,0.0018798053,0.0061306264,0.0055682906,0.0057789995,0.00823218],"category_scores_gemma":[0.08017739,0.0018028393,0.002826075,0.0043491926,0.007664478,0.012581091,0.010706866,0.015803507,0.0013915038],"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.00057719834,0.00021121516,0.0012977077,0.0009544217,0.00020965844,0.00025183544,0.00082611985,0.15005928,0.004131104,0.77710253,0.006931085,0.057447962],"study_design_scores_gemma":[0.000032802793,0.00011647215,0.0006401644,0.0003451558,0.000076283475,0.00009745552,0.00012673292,0.4832416,0.001990837,0.5081217,0.005153092,0.000057655143],"about_ca_topic_score_codex":0.005571954,"about_ca_topic_score_gemma":0.003056789,"teacher_disagreement_score":0.023468144,"about_ca_system_score_codex":0.005266225,"about_ca_system_score_gemma":0.0023211397,"threshold_uncertainty_score":0.124112904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06525591,0.0045089275,0.83614814,0.0054579987,0.00026183968,0.00012416046,0.0005343944,0.0002364356,0.087472245],"genre_scores_gemma":[0.7919317,0.010962648,0.17121413,0.0018835065,0.0018489788,0.0005081814,0.0011971605,0.00052388,0.01992984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997407,0.0009295382,0.00017071798,0.00054581295,0.0006384819,0.00030834947],"domain_scores_gemma":[0.98856914,0.0073288186,0.0012022275,0.0011066423,0.0011298471,0.0006633442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066612945,0.0018248248,0.0026875432,0.003504851,0.0024643969,0.004853033,0.0025797493,0.003130568,0.005907318],"category_scores_gemma":[0.021182379,0.000987211,0.003117672,0.005925778,0.008975197,0.014540647,0.005366288,0.009210597,0.0008088964],"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.000009420407,0.000007869979,0.0001004603,0.000033628454,0.000007873162,0.000029135577,0.000071655646,0.0024294727,0.000122066114,0.9938996,0.0006690002,0.002619929],"study_design_scores_gemma":[0.000008305242,0.000013356237,0.00016895215,0.000020603127,0.000009687954,0.00005947617,0.00004271099,0.016135493,0.000106796666,0.9814301,0.001995435,0.00000919189],"about_ca_topic_score_codex":0.0017007509,"about_ca_topic_score_gemma":0.0011870984,"teacher_disagreement_score":0.0066612945,"about_ca_system_score_codex":0.0025511454,"about_ca_system_score_gemma":0.0011105817,"threshold_uncertainty_score":0.03522873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084667915,0.00012321405,0.99779236,0.000108312415,0.00001835652,0.000007768882,0.000010868278,0.00003348738,0.0010590174],"genre_scores_gemma":[0.15107135,0.0021801637,0.83581245,0.00040428364,0.0004551934,0.00036645122,0.00019423285,0.0003286511,0.009187257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977715,0.001135824,0.00009698327,0.00024306071,0.00067075127,0.00008203608],"domain_scores_gemma":[0.99432725,0.004548011,0.00027084604,0.00024626125,0.0005355203,0.00007204417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032619531,0.0013575733,0.0013398335,0.0013405693,0.00059372344,0.0012427848,0.0013373483,0.0013604648,0.0030976478],"category_scores_gemma":[0.01084739,0.0007686514,0.0011335652,0.001985115,0.0019348927,0.003244427,0.0028278695,0.0024440843,0.001017015],"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.00013920739,0.000091151756,0.00031367232,0.0003582365,0.00008898394,0.00010304702,0.00020191538,0.30604234,0.004640228,0.55812126,0.00544555,0.124454424],"study_design_scores_gemma":[0.000010060542,0.00003780791,0.000078680256,0.00002909399,0.000021274254,0.00007553333,0.000018130731,0.783476,0.0019555336,0.2119367,0.002337281,0.00002385823],"about_ca_topic_score_codex":0.00077829586,"about_ca_topic_score_gemma":0.00052338466,"teacher_disagreement_score":0.0032619531,"about_ca_system_score_codex":0.000754561,"about_ca_system_score_gemma":0.0012563822,"threshold_uncertainty_score":0.017251074},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007891015,0.00006701966,0.9962759,0.000091115275,0.0000627779,0.00002514966,0.000018393866,0.00014236504,0.0025281974],"genre_scores_gemma":[0.075180106,0.0003654201,0.91216624,0.0003062531,0.000265238,0.00028677422,0.00017523335,0.00047097844,0.010783668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993211,0.0003053093,0.000022584209,0.0000828158,0.0002287357,0.000039438415],"domain_scores_gemma":[0.9989157,0.0005410292,0.000053047446,0.00017855209,0.00025873104,0.00005298768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008363218,0.0009516136,0.0008290558,0.0010821997,0.0009372124,0.0009970213,0.0014851297,0.0011180866,0.009660924],"category_scores_gemma":[0.0030181273,0.0005073236,0.0011268996,0.0010803811,0.0008098697,0.0015294914,0.0016221182,0.001833648,0.0033865343],"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.00009319728,0.0001823434,0.0002550229,0.00022845632,0.000058500853,0.00021032088,0.00019665659,0.13075882,0.008263585,0.6023862,0.017790977,0.23957597],"study_design_scores_gemma":[0.000020167456,0.00005217677,0.00006037294,0.000022269878,0.000013441444,0.00011199382,0.000021729407,0.7154746,0.0014310773,0.27549076,0.0072802906,0.000021123098],"about_ca_topic_score_codex":0.0006483606,"about_ca_topic_score_gemma":0.0012082326,"teacher_disagreement_score":0.009660924,"about_ca_system_score_codex":0.0003266646,"about_ca_system_score_gemma":0.0005648591,"threshold_uncertainty_score":0.03231901},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044612694,0.00036198777,0.9918013,0.00033610585,0.00006570682,0.00003313157,0.00010439604,0.00029333486,0.0025427134],"genre_scores_gemma":[0.28401983,0.0008298551,0.70485514,0.00037815815,0.00026684362,0.00055995997,0.00082800654,0.0004438814,0.007818376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810445,0.0009727222,0.000078407575,0.00024036667,0.00038087118,0.00022318757],"domain_scores_gemma":[0.98931855,0.008495176,0.00043832214,0.00044804742,0.000977351,0.00032253907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040715355,0.0019029566,0.0029587862,0.0016872896,0.0009907287,0.0030182162,0.0043950253,0.0030707724,0.0077180155],"category_scores_gemma":[0.015488684,0.0017353939,0.0015670008,0.0033473917,0.0016957452,0.0037885606,0.0025366878,0.0053622075,0.0013488675],"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.00009533324,0.00009641193,0.00021210634,0.000091045025,0.00003561001,0.000022395556,0.00004827693,0.9441409,0.00019589243,0.023164157,0.002956676,0.028941184],"study_design_scores_gemma":[0.000008924533,0.000007581351,0.000016906562,0.0000062863655,0.000004202982,0.000003913913,0.00000712972,0.9905612,0.00005957527,0.0090814335,0.00023964001,0.0000031234417],"about_ca_topic_score_codex":0.01290093,"about_ca_topic_score_gemma":0.0089267725,"teacher_disagreement_score":0.01290093,"about_ca_system_score_codex":0.0038057198,"about_ca_system_score_gemma":0.0031826834,"threshold_uncertainty_score":0.027612627},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44488028,0.00015916437,0.5476717,0.0008754659,0.00007515117,0.0002441213,0.0008669101,0.0011733058,0.0040539587],"genre_scores_gemma":[0.8195826,0.000079274316,0.17652859,0.000098439785,0.000052224266,0.00019976162,0.0019966078,0.00021773126,0.0012446739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957231,0.0015243542,0.00020962181,0.0009895125,0.0012680003,0.0002854379],"domain_scores_gemma":[0.96920335,0.02337923,0.0018970532,0.002906739,0.0017831892,0.0008304332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037846535,0.0010965649,0.0011663747,0.0011124457,0.0005434979,0.0023558617,0.002573802,0.0020873742,0.0021377027],"category_scores_gemma":[0.038036644,0.0007895138,0.0009387987,0.0011912091,0.0015678894,0.0029859163,0.0022228993,0.0029185629,0.0002648924],"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.0005325561,0.0006896193,0.009952879,0.00029262973,0.00012007501,0.00026895554,0.00033196723,0.78391516,0.006441112,0.114045784,0.005606894,0.07780234],"study_design_scores_gemma":[0.000027852473,0.00007631487,0.0005976451,0.0000096657195,0.0000072939115,0.000045986355,0.00004778123,0.95566165,0.002703473,0.04050936,0.00030317725,0.000009684995],"about_ca_topic_score_codex":0.00088962424,"about_ca_topic_score_gemma":0.0012494557,"teacher_disagreement_score":0.0037846535,"about_ca_system_score_codex":0.0014744358,"about_ca_system_score_gemma":0.0010474524,"threshold_uncertainty_score":0.020015419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66388947,0.0021119528,0.18144941,0.01034663,0.0006009747,0.00009383722,0.0012594898,0.00036252744,0.13988563],"genre_scores_gemma":[0.94437826,0.0025216085,0.020343171,0.00061339524,0.0009605714,0.00007723683,0.0007359262,0.00026281227,0.030107034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993979,0.00015120649,0.000013132319,0.00014704617,0.00013654129,0.00015417907],"domain_scores_gemma":[0.99458176,0.0038965764,0.00043052857,0.0002771522,0.0003907921,0.00042325302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010026122,0.00095829094,0.0009371053,0.0027852312,0.0015019802,0.0028315668,0.0018018417,0.001198388,0.010671458],"category_scores_gemma":[0.006551609,0.0005126689,0.000685887,0.0033092552,0.0046748794,0.0066856747,0.0018490887,0.0038579064,0.0010339406],"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.00012385091,0.000052912947,0.0010233783,0.00008925761,0.000016118402,0.00006203638,0.00036981155,0.015267231,0.0012582474,0.9637182,0.005879147,0.012139777],"study_design_scores_gemma":[0.000025863763,0.00002684893,0.0007569413,0.000030325882,0.000020670615,0.00007799424,0.00011865287,0.044395197,0.00048323348,0.9506826,0.0033569054,0.00002487023],"about_ca_topic_score_codex":0.008164284,"about_ca_topic_score_gemma":0.0067654178,"teacher_disagreement_score":0.010671458,"about_ca_system_score_codex":0.0032313785,"about_ca_system_score_gemma":0.0013497453,"threshold_uncertainty_score":0.035699606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046960894,0.0011443375,0.87441486,0.005614507,0.00080396683,0.00012999077,0.00080631673,0.00015984016,0.06996535],"genre_scores_gemma":[0.75263214,0.0015586787,0.16727099,0.002607183,0.0014827639,0.0004741072,0.0011448463,0.00039813202,0.07243129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714285,0.0011244022,0.0001671329,0.0006102041,0.0006360026,0.00031940898],"domain_scores_gemma":[0.99340534,0.00365854,0.00063371594,0.000760803,0.0010955156,0.0004460701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005466954,0.0010977194,0.0021218522,0.0015095011,0.0012613048,0.0024917722,0.0028622292,0.00323056,0.024121974],"category_scores_gemma":[0.01603518,0.00082282297,0.0015499591,0.0015007885,0.0035191854,0.008792704,0.0036972184,0.005938457,0.001651393],"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.000069881,0.000047973623,0.00014016304,0.00014691231,0.00001869261,0.00014875353,0.0001087245,0.01686569,0.0016068232,0.9700742,0.004005265,0.0067669405],"study_design_scores_gemma":[0.00005454846,0.00004828078,0.00039013135,0.000030491137,0.000014182642,0.00012804639,0.00004961113,0.15619028,0.00094749185,0.83619744,0.0059094015,0.000040129908],"about_ca_topic_score_codex":0.0026811552,"about_ca_topic_score_gemma":0.0018799807,"teacher_disagreement_score":0.024121974,"about_ca_system_score_codex":0.0018692715,"about_ca_system_score_gemma":0.0022033583,"threshold_uncertainty_score":0.08069605},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002039945,0.00036832536,0.9907013,0.0006580886,0.00014944466,0.00007256313,0.00008957838,0.0002370918,0.0056836433],"genre_scores_gemma":[0.08920204,0.00065111514,0.89260274,0.00044952467,0.00027639055,0.000837933,0.00028678658,0.0008298001,0.014863714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983374,0.0007364145,0.000064989064,0.00013802105,0.00059090747,0.00013233135],"domain_scores_gemma":[0.99206674,0.0061449637,0.00026975138,0.0005811114,0.00068963226,0.00024777255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004369251,0.0025297527,0.0017149502,0.0010808392,0.0010135445,0.002637667,0.0027361535,0.0021943538,0.0129825715],"category_scores_gemma":[0.016361663,0.000917559,0.001214336,0.001334474,0.0025626083,0.003425905,0.0032835384,0.008854479,0.0028099983],"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.00033493002,0.00041579036,0.00042421903,0.00047411243,0.000065142915,0.000113216374,0.0001697067,0.29613757,0.0015480217,0.56820625,0.017203642,0.114907525],"study_design_scores_gemma":[0.000038331364,0.00003029078,0.00005130546,0.000032290467,0.000008100727,0.000025916692,0.000017894383,0.89375305,0.0004963892,0.10303965,0.0024948928,0.000011889858],"about_ca_topic_score_codex":0.0044304114,"about_ca_topic_score_gemma":0.008190772,"teacher_disagreement_score":0.0129825715,"about_ca_system_score_codex":0.0022811713,"about_ca_system_score_gemma":0.0035851216,"threshold_uncertainty_score":0.043431044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02952023,0.0023498596,0.8784534,0.003485943,0.00044906168,0.00006323865,0.00047169096,0.00006891173,0.08513766],"genre_scores_gemma":[0.76688397,0.0075040855,0.16848902,0.0022536456,0.0014311564,0.0005434902,0.0008461348,0.00030821798,0.051740274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931145,0.00030791815,0.000027265536,0.000080730126,0.00018135236,0.00009134993],"domain_scores_gemma":[0.99711144,0.0022357716,0.00015053389,0.000098219185,0.0002822675,0.00012176385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020770193,0.0012127975,0.00092620566,0.0014194739,0.00093914807,0.0023252799,0.0015170744,0.0012278407,0.007680063],"category_scores_gemma":[0.00924136,0.00043831998,0.0010650504,0.0018402465,0.002290648,0.0034251837,0.0022759973,0.0036628002,0.00071114866],"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.000031744312,0.000018857452,0.00017050178,0.00008019621,0.000014900638,0.000053158932,0.00007517709,0.038628258,0.0006415733,0.9436735,0.0036254597,0.012986508],"study_design_scores_gemma":[0.000010912978,0.000015493837,0.000117116746,0.000032099873,0.000008918234,0.00003198043,0.000032588276,0.21022001,0.00019672146,0.78633875,0.0029839843,0.000011539556],"about_ca_topic_score_codex":0.0035198529,"about_ca_topic_score_gemma":0.0030264922,"teacher_disagreement_score":0.007680063,"about_ca_system_score_codex":0.0016155696,"about_ca_system_score_gemma":0.0015731773,"threshold_uncertainty_score":0.025692344},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2756799,0.011836676,0.5164641,0.014838135,0.0006195544,0.00011020337,0.00054850284,0.00018587075,0.1797171],"genre_scores_gemma":[0.893678,0.010228841,0.05952921,0.0009367267,0.0012484944,0.00018385865,0.00031180462,0.00018346454,0.03369957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937755,0.0002889517,0.000029397812,0.00008720141,0.00013375914,0.000083143204],"domain_scores_gemma":[0.99188614,0.005419032,0.00082896475,0.00028169889,0.00071997126,0.00086422917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028269067,0.0010467313,0.0014084493,0.0031814429,0.00255153,0.0043280628,0.0016684589,0.001852419,0.0058229784],"category_scores_gemma":[0.011789248,0.00082513527,0.0012487546,0.0032218639,0.005107399,0.006999801,0.0025245408,0.0050772973,0.0004639976],"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.000010369084,0.000011887861,0.00010812657,0.000015788437,0.0000030856754,0.000028331808,0.000064222346,0.0046590893,0.00007138011,0.9931778,0.0006262546,0.001223752],"study_design_scores_gemma":[0.0000038758976,0.0000047501762,0.000062755185,0.000013335611,0.0000023310154,0.00001770412,0.000026889982,0.018269297,0.00002233665,0.9806623,0.0009091729,0.0000052200294],"about_ca_topic_score_codex":0.0037724606,"about_ca_topic_score_gemma":0.0027012534,"teacher_disagreement_score":0.0058229784,"about_ca_system_score_codex":0.0025462627,"about_ca_system_score_gemma":0.0013766892,"threshold_uncertainty_score":0.019479811},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002645331,0.00007278578,0.99627566,0.00006098712,0.00004420204,0.000016498154,0.000007692298,0.00012096427,0.0007558504],"genre_scores_gemma":[0.117136054,0.00023242763,0.8785647,0.00015402724,0.00010440497,0.00022879231,0.000074608826,0.000117802185,0.0033872216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992393,0.00026130138,0.00003769807,0.00013251927,0.0002551021,0.00007408583],"domain_scores_gemma":[0.99825424,0.0011472944,0.00008245282,0.00015991704,0.0002929075,0.00006320816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015568199,0.00083600427,0.0010570538,0.00075422594,0.00047951317,0.0010352293,0.0019354977,0.0016581182,0.0042044674],"category_scores_gemma":[0.008596743,0.0006117072,0.00076491135,0.0009882913,0.0010800528,0.0014969946,0.0017317209,0.0023488733,0.0008630998],"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.00038177057,0.00015246207,0.0007970324,0.00015853821,0.00007345109,0.00008677647,0.00016707176,0.48262104,0.008533249,0.1085789,0.005333425,0.39311635],"study_design_scores_gemma":[0.000025370828,0.000021905524,0.000041813146,0.0000062337276,0.000006224472,0.000018651499,0.000005215741,0.9916821,0.0004558499,0.0069680046,0.00076328916,0.000005362838],"about_ca_topic_score_codex":0.0031289598,"about_ca_topic_score_gemma":0.0030898727,"teacher_disagreement_score":0.0042044674,"about_ca_system_score_codex":0.0008971872,"about_ca_system_score_gemma":0.0014209258,"threshold_uncertainty_score":0.014065385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012224433,0.00020593143,0.9803004,0.0003599077,0.00006884655,0.00016376282,0.00018227227,0.00039050757,0.006103921],"genre_scores_gemma":[0.080508485,0.00023575619,0.9106948,0.00014948493,0.00006361561,0.0003164502,0.00048395692,0.00019701567,0.007350426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995233,0.00015459405,0.000016666409,0.00010965287,0.00010609086,0.00008976447],"domain_scores_gemma":[0.9989311,0.0006951186,0.00008095292,0.000062459294,0.00013295164,0.000097428805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011509708,0.0012299956,0.0018583066,0.0012089526,0.0012084295,0.001372921,0.0021823696,0.002274615,0.010236502],"category_scores_gemma":[0.002494635,0.0008951178,0.0008857057,0.0020336448,0.00079722505,0.0019420572,0.0015834703,0.002129437,0.0012753225],"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.00020274511,0.00037404726,0.00055267836,0.00017476037,0.00006758276,0.00010394984,0.0001019518,0.6915604,0.0014972736,0.045276243,0.012158926,0.24792945],"study_design_scores_gemma":[0.000061913204,0.000054388514,0.00009651905,0.000014240443,0.000016665064,0.000030169827,0.000024561627,0.9734308,0.00033283213,0.023576615,0.002353496,0.000007752428],"about_ca_topic_score_codex":0.006260364,"about_ca_topic_score_gemma":0.008134841,"teacher_disagreement_score":0.010236502,"about_ca_system_score_codex":0.0012253725,"about_ca_system_score_gemma":0.0025612863,"threshold_uncertainty_score":0.034244537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05954456,0.0017518935,0.9099048,0.002530553,0.00029739458,0.00013732744,0.0002691786,0.00034665153,0.025217596],"genre_scores_gemma":[0.9087021,0.0026405633,0.0726324,0.0015848919,0.00064250437,0.00035477607,0.00039760326,0.00064914353,0.012395987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929617,0.0045880917,0.00018071356,0.0008152221,0.0009926003,0.00046157162],"domain_scores_gemma":[0.90682644,0.081878684,0.0037059,0.0022934151,0.0034136884,0.0018819423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012647139,0.0028104673,0.0028046572,0.0027902883,0.0012694575,0.0037223366,0.0020840366,0.0025283212,0.0059536085],"category_scores_gemma":[0.08095013,0.0018769455,0.0021742296,0.0019035971,0.0064924606,0.006581623,0.006237312,0.0067117587,0.00042834214],"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.00032094284,0.00017101549,0.0009906149,0.00048018634,0.00017625035,0.00031877006,0.00056975323,0.32950604,0.0065963482,0.63934493,0.0043990896,0.017125998],"study_design_scores_gemma":[0.00002149242,0.00007894238,0.0004515888,0.00008597862,0.00003776119,0.00011241952,0.00007618606,0.60513496,0.001514103,0.39157918,0.0008523172,0.000055022276],"about_ca_topic_score_codex":0.0018375489,"about_ca_topic_score_gemma":0.0009371039,"teacher_disagreement_score":0.012647139,"about_ca_system_score_codex":0.002579655,"about_ca_system_score_gemma":0.0017113327,"threshold_uncertainty_score":0.06688523},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07094704,0.0039172424,0.8992126,0.0060215937,0.00019344165,0.0001591877,0.0004224459,0.0002990314,0.0188274],"genre_scores_gemma":[0.81773484,0.0033217403,0.16600165,0.0013272746,0.0019283197,0.0010711589,0.0009437394,0.00042380227,0.007247454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9808157,0.006412455,0.0009442162,0.003087336,0.006410963,0.002329269],"domain_scores_gemma":[0.82897717,0.1388993,0.01171258,0.008500021,0.006260491,0.005650545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016931556,0.0028376372,0.0033813335,0.008380854,0.0027169422,0.012955,0.0061772387,0.0052848593,0.005746134],"category_scores_gemma":[0.1110765,0.0020702041,0.0039348262,0.0069190213,0.009549895,0.025454452,0.008651962,0.014020308,0.00056949357],"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.00008807953,0.00009192774,0.0009787931,0.00014020207,0.00004704878,0.0000327333,0.00026779494,0.018484322,0.00055474933,0.96752506,0.0012453472,0.010543931],"study_design_scores_gemma":[0.00002001689,0.0000651165,0.0010998183,0.00007297107,0.000039630424,0.0001064313,0.000100236524,0.16848491,0.00057531963,0.827561,0.0018166943,0.00005778066],"about_ca_topic_score_codex":0.0011801663,"about_ca_topic_score_gemma":0.0007854765,"teacher_disagreement_score":0.016931556,"about_ca_system_score_codex":0.008318814,"about_ca_system_score_gemma":0.0027682763,"threshold_uncertainty_score":0.08954364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21961844,0.0012971498,0.6434333,0.006853388,0.00023310551,0.00037289216,0.004375308,0.00046143713,0.12335508],"genre_scores_gemma":[0.8795477,0.0009537856,0.058571,0.0005212158,0.00015145769,0.00029519916,0.0013637888,0.00010333522,0.058492396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933463,0.00023502341,0.000017232165,0.00016620973,0.00009920182,0.00014757365],"domain_scores_gemma":[0.9986443,0.00082976616,0.0001564488,0.000073985095,0.00010919409,0.00018632661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062390184,0.00078594865,0.001300408,0.00066578604,0.00093379675,0.0030026883,0.0022018314,0.002633115,0.011085587],"category_scores_gemma":[0.002400646,0.00064227864,0.00069011684,0.0016852723,0.0015077018,0.0019931914,0.0011696968,0.0022542977,0.0008715695],"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.000108336826,0.00015179113,0.0003730863,0.00014487767,0.000034975976,0.0003159649,0.00012471431,0.35582274,0.00076095265,0.6271497,0.008728864,0.0062840236],"study_design_scores_gemma":[0.000073335075,0.000035678815,0.00013037048,0.000014272187,0.00001303422,0.000059893853,0.000065063105,0.7223574,0.00014585242,0.2740801,0.0030088562,0.000016160819],"about_ca_topic_score_codex":0.01540596,"about_ca_topic_score_gemma":0.01708575,"teacher_disagreement_score":0.01540596,"about_ca_system_score_codex":0.0029637867,"about_ca_system_score_gemma":0.002298522,"threshold_uncertainty_score":0.037084997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119395,0.0046690255,0.9565749,0.009296448,0.00061118306,0.000051730953,0.00012420124,0.0004597851,0.016273212],"genre_scores_gemma":[0.30770397,0.004700687,0.66717154,0.0031747161,0.001263522,0.00048505317,0.00037377948,0.0021849333,0.0129417665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870249,0.0065704486,0.00035736454,0.0010696088,0.004261747,0.0007160417],"domain_scores_gemma":[0.9120801,0.0705162,0.0023058287,0.00934185,0.004157024,0.0015990176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014459569,0.0023042941,0.0035508673,0.0020660935,0.0016894693,0.00487206,0.0032831938,0.004379797,0.009565938],"category_scores_gemma":[0.12220429,0.0016075546,0.0025339373,0.001972255,0.0080166375,0.018234428,0.007462808,0.012763548,0.0023915193],"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.00035378672,0.000095508425,0.0012031221,0.0002827461,0.00014146711,0.000058699963,0.00023942198,0.11492417,0.0010202528,0.7754178,0.012282547,0.09398043],"study_design_scores_gemma":[0.000038166334,0.000051971492,0.00021888559,0.000114230636,0.0000261669,0.00004640315,0.000046122463,0.23331036,0.001028418,0.7597757,0.0053153224,0.00002829737],"about_ca_topic_score_codex":0.0019524149,"about_ca_topic_score_gemma":0.0021738415,"teacher_disagreement_score":0.014459569,"about_ca_system_score_codex":0.0018869163,"about_ca_system_score_gemma":0.00222596,"threshold_uncertainty_score":0.076470375},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0085786125,0.00017387758,0.9885937,0.00013739614,0.000034767818,0.00005671322,0.0000623,0.000053379463,0.0023093184],"genre_scores_gemma":[0.3751153,0.00046884696,0.6179766,0.00017219382,0.00010829845,0.00044047035,0.00041768924,0.00016810969,0.005132487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892837,0.0005170565,0.000045316687,0.00014702306,0.0002566249,0.00010552253],"domain_scores_gemma":[0.99809784,0.001295831,0.0001686364,0.00016694248,0.000208662,0.00006208071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023534915,0.0010151651,0.001433397,0.00092451856,0.0008500261,0.0017548775,0.0015594511,0.001013657,0.0036510986],"category_scores_gemma":[0.0048483354,0.0009834606,0.0010231141,0.002114562,0.0006306881,0.0026470982,0.0019066537,0.0015480326,0.0002855329],"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.00007080337,0.00006268394,0.00021174784,0.00011358154,0.000048021215,0.000060661507,0.00006472829,0.92111063,0.0012860572,0.03794512,0.0017305998,0.037295368],"study_design_scores_gemma":[0.0000090728445,0.000018598786,0.000054595585,0.000007955251,0.0000072670578,0.000013939363,0.000012199918,0.9862293,0.0003799412,0.012547786,0.00071508595,0.00000432094],"about_ca_topic_score_codex":0.002742024,"about_ca_topic_score_gemma":0.0037966084,"teacher_disagreement_score":0.0036510986,"about_ca_system_score_codex":0.00095626933,"about_ca_system_score_gemma":0.0010068681,"threshold_uncertainty_score":0.012446582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023102276,0.00020087247,0.9653386,0.00029262694,0.000112284055,0.00015956667,0.00027484962,0.000249034,0.01026991],"genre_scores_gemma":[0.642033,0.00062197103,0.3329771,0.00015851401,0.00027255356,0.00041836884,0.0004598885,0.00020329993,0.022855261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984119,0.000620053,0.00006296771,0.00025417696,0.0003227489,0.0003281624],"domain_scores_gemma":[0.99824524,0.0009344479,0.0002064943,0.00014293827,0.0003064352,0.00016453852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019824547,0.0013384848,0.0017299914,0.0014783491,0.0011028975,0.002742428,0.0030381903,0.0014768639,0.008275271],"category_scores_gemma":[0.005466889,0.0015162706,0.0012405531,0.004076254,0.000759982,0.0029361018,0.0015325324,0.0016342277,0.001032594],"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.00020050627,0.00012717636,0.00035868163,0.00019806677,0.000045489625,0.00013256398,0.00008303715,0.89317435,0.0008857976,0.06438001,0.003140398,0.03727389],"study_design_scores_gemma":[0.00001819947,0.00005247741,0.00009290862,0.0000094302495,0.000023638448,0.000037521408,0.000025519508,0.96462226,0.0005212771,0.033402745,0.0011819185,0.000012086171],"about_ca_topic_score_codex":0.005867438,"about_ca_topic_score_gemma":0.006180096,"teacher_disagreement_score":0.008275271,"about_ca_system_score_codex":0.0023587223,"about_ca_system_score_gemma":0.0023764218,"threshold_uncertainty_score":0.027683556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35064954,0.0011523599,0.5818549,0.0022445277,0.00026098342,0.00017417324,0.0005350356,0.0005171574,0.06261131],"genre_scores_gemma":[0.7716635,0.0015881581,0.18584682,0.0007713171,0.0006192485,0.00038115916,0.001356688,0.0005100138,0.03726307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998852,0.00036760757,0.00006571654,0.0002163751,0.00033827798,0.00015999142],"domain_scores_gemma":[0.9936941,0.00405974,0.0009184103,0.000509718,0.00033334055,0.00048464997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011380705,0.0009032221,0.0014403001,0.0028027897,0.0019169871,0.004409209,0.0018893884,0.0022145072,0.008522787],"category_scores_gemma":[0.008069434,0.002237722,0.0014572886,0.00390013,0.0028589321,0.007931883,0.0027060132,0.00390689,0.0012595953],"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.00004752861,0.00006972908,0.0004031584,0.0000946503,0.00002342815,0.00011346938,0.00033764524,0.013755254,0.00051104417,0.9690699,0.0036672354,0.011906951],"study_design_scores_gemma":[0.000012004503,0.000011909766,0.00011742697,0.000015794649,0.0000111844765,0.00006431706,0.00007970171,0.03169609,0.000232189,0.96668565,0.0010675857,0.0000061936666],"about_ca_topic_score_codex":0.000705414,"about_ca_topic_score_gemma":0.0011304122,"teacher_disagreement_score":0.008522787,"about_ca_system_score_codex":0.0011268111,"about_ca_system_score_gemma":0.00059068704,"threshold_uncertainty_score":0.028511524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068274654,0.00098357,0.91627026,0.0011644863,0.00014355713,0.00038619037,0.00016497816,0.00022883115,0.012383575],"genre_scores_gemma":[0.79163295,0.0011040976,0.19316965,0.000212937,0.00025286197,0.00086442876,0.0001688219,0.00013103388,0.01246321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991647,0.0050952826,0.0004248003,0.0006962527,0.0012227636,0.0009138908],"domain_scores_gemma":[0.9802915,0.013938743,0.0016177607,0.00248748,0.0008867743,0.0007777595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012869326,0.0016980537,0.003966885,0.001678225,0.0015357996,0.00552401,0.005858958,0.0034149059,0.0058707935],"category_scores_gemma":[0.034852084,0.001314898,0.0017491583,0.0033036422,0.0025900134,0.008850893,0.0042739045,0.003648132,0.0005642731],"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.0004623528,0.00044634932,0.0003879813,0.00039650267,0.00013310486,0.00006296573,0.00022244595,0.15825787,0.0013115503,0.7760726,0.003182012,0.059064053],"study_design_scores_gemma":[0.00018217122,0.00013067044,0.00018809205,0.00005665273,0.000058230977,0.000067639296,0.000058321122,0.29293144,0.0005997999,0.7038012,0.001887806,0.00003806932],"about_ca_topic_score_codex":0.0007183683,"about_ca_topic_score_gemma":0.0007478174,"teacher_disagreement_score":0.012869326,"about_ca_system_score_codex":0.0028267442,"about_ca_system_score_gemma":0.0036562802,"threshold_uncertainty_score":0.06806034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058496575,0.000096382246,0.9980508,0.00013150582,0.000035368732,0.000021611135,0.00002790074,0.00007475645,0.0009767497],"genre_scores_gemma":[0.041405056,0.0004140677,0.9490022,0.00022386582,0.00016369301,0.00041067498,0.00025938274,0.00040553414,0.0077154385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988772,0.00054855837,0.000047672464,0.00017593075,0.00029814674,0.000052477128],"domain_scores_gemma":[0.9971656,0.001869868,0.0001704561,0.00022998398,0.00048674704,0.00007725408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024376486,0.0019082034,0.0013938819,0.000972059,0.0005773993,0.0016724995,0.0024423085,0.0026013202,0.0062334826],"category_scores_gemma":[0.009634188,0.0010850225,0.0010211972,0.0011792538,0.001885732,0.0021463619,0.0027306876,0.0031118754,0.0019587276],"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.00009431022,0.00012129703,0.00025336276,0.00052546116,0.00010812742,0.00013784542,0.00014006344,0.6840877,0.0040019853,0.16625431,0.013513514,0.13076206],"study_design_scores_gemma":[0.0000065063114,0.000011667194,0.000018904559,0.000014168166,0.0000052330556,0.000015912874,0.000009243683,0.98071414,0.00049590936,0.016820569,0.0018806377,0.000007152882],"about_ca_topic_score_codex":0.0034073647,"about_ca_topic_score_gemma":0.004736338,"teacher_disagreement_score":0.0062334826,"about_ca_system_score_codex":0.0009340352,"about_ca_system_score_gemma":0.0018436629,"threshold_uncertainty_score":0.020853102},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009736371,0.00027758608,0.9808624,0.0002267206,0.00016287657,0.00014173666,0.00021410499,0.00093107246,0.00744707],"genre_scores_gemma":[0.11031975,0.00024111418,0.8843786,0.000190822,0.000107422886,0.0002659439,0.000612238,0.00062912615,0.0032549766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783593,0.0010476388,0.0001228312,0.00017028624,0.000566888,0.00025631834],"domain_scores_gemma":[0.99258703,0.0048818206,0.0003168339,0.000912926,0.0010849291,0.00021645216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033359446,0.001839431,0.0014620278,0.0018236614,0.001067649,0.0023191508,0.001771274,0.0008499766,0.01817049],"category_scores_gemma":[0.011293205,0.00095903483,0.0010034111,0.0026493664,0.0009168049,0.0038767902,0.0016945233,0.004581421,0.0025276705],"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.0013462098,0.0005433627,0.0006827036,0.0006531673,0.00007207945,0.00018553446,0.0002584045,0.19421178,0.013314338,0.24938111,0.016730977,0.5226204],"study_design_scores_gemma":[0.00020047186,0.0001456629,0.00015811782,0.00008712922,0.000033313943,0.000052120948,0.000060133927,0.86032313,0.00897588,0.11961225,0.010320356,0.000031521944],"about_ca_topic_score_codex":0.0030475901,"about_ca_topic_score_gemma":0.006433477,"teacher_disagreement_score":0.01817049,"about_ca_system_score_codex":0.00082590966,"about_ca_system_score_gemma":0.0023700881,"threshold_uncertainty_score":0.060786426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010892992,0.00008139182,0.99586415,0.000075419055,0.00004250174,0.000031483716,0.00005242787,0.00021445463,0.0025487468],"genre_scores_gemma":[0.09317889,0.0003063093,0.8963793,0.00028364174,0.000115945324,0.0005403737,0.00044084646,0.0006538008,0.0081009185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981256,0.00077050156,0.00007103844,0.0002125832,0.0006781365,0.00014219312],"domain_scores_gemma":[0.99572337,0.0025743423,0.00016932008,0.0005620272,0.0008259808,0.00014501343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722232,0.002163315,0.0017694354,0.0013665798,0.0008913675,0.0020076002,0.002434095,0.0017977554,0.011244174],"category_scores_gemma":[0.009795479,0.0009685825,0.0013923715,0.0016698138,0.0013257754,0.0021995197,0.0025206173,0.005889762,0.002520187],"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.00030427316,0.00036631207,0.0003168531,0.00047696682,0.000103869264,0.00019936042,0.00025812176,0.54179776,0.010926009,0.24816185,0.020432191,0.1766565],"study_design_scores_gemma":[0.00001724258,0.000022840462,0.00005444592,0.000025213827,0.000009603112,0.000029330899,0.000008559466,0.95947516,0.0014818112,0.036771398,0.0020936993,0.0000106721545],"about_ca_topic_score_codex":0.002664533,"about_ca_topic_score_gemma":0.0034329446,"teacher_disagreement_score":0.011244174,"about_ca_system_score_codex":0.0011721607,"about_ca_system_score_gemma":0.0020609882,"threshold_uncertainty_score":0.037615538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42960396,0.0021778438,0.54690456,0.0014948556,0.00013276559,0.000036994184,0.00017285705,0.00009662929,0.01937953],"genre_scores_gemma":[0.94702035,0.00095994637,0.04399616,0.00018667016,0.00028100438,0.00007420341,0.0001530606,0.000080901635,0.00724761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822325,0.00063613756,0.00011616577,0.00037206316,0.0004574574,0.0001949344],"domain_scores_gemma":[0.9923632,0.0048093074,0.00094025856,0.000387247,0.0007202708,0.00077961286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038562592,0.0008315718,0.0013871626,0.002016937,0.0013922467,0.0037384718,0.0018271358,0.0011816038,0.0019979503],"category_scores_gemma":[0.013846865,0.0007872142,0.0010290742,0.001491761,0.0037850707,0.007969712,0.0028882858,0.003232205,0.00014932934],"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.00003488071,0.000019440033,0.00041967395,0.000032234442,0.00002488444,0.000063738014,0.00015383064,0.0071493834,0.0010115474,0.9872701,0.00030032298,0.0035199693],"study_design_scores_gemma":[0.0000046451432,0.000016645023,0.00043306008,0.000008953918,0.000011914122,0.00005269084,0.000071880066,0.041303027,0.00029208232,0.9574551,0.00033799716,0.000011958813],"about_ca_topic_score_codex":0.0012750669,"about_ca_topic_score_gemma":0.0014057336,"teacher_disagreement_score":0.0038562592,"about_ca_system_score_codex":0.0014041153,"about_ca_system_score_gemma":0.00093833153,"threshold_uncertainty_score":0.020394087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032239135,0.00091053604,0.93875325,0.0019091088,0.0005897815,0.00048303904,0.00050031004,0.0048484616,0.019766353],"genre_scores_gemma":[0.18404502,0.000378025,0.8045894,0.0006440558,0.00036188582,0.0007324978,0.0008607991,0.0009342201,0.007454069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832386,0.00039737832,0.00008393669,0.00038759172,0.0005398274,0.00026745588],"domain_scores_gemma":[0.9964455,0.0016824408,0.00020209861,0.00086793595,0.0005514796,0.00025055074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021709525,0.002172701,0.0023554582,0.0019443487,0.0013245639,0.0024434507,0.003217972,0.00197333,0.020523835],"category_scores_gemma":[0.008947925,0.0009759059,0.0012997783,0.0032209728,0.0010516789,0.005965597,0.00340173,0.004015889,0.0029709972],"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.0007248259,0.0007427308,0.0006813339,0.00053651346,0.00009192531,0.0001151996,0.00027483507,0.24084587,0.0112507185,0.09402691,0.05004032,0.6006687],"study_design_scores_gemma":[0.00020022842,0.0001104529,0.0001901401,0.00003386642,0.000029030765,0.00007828744,0.000056045366,0.91092694,0.002970575,0.078987464,0.006390208,0.000026707308],"about_ca_topic_score_codex":0.004859442,"about_ca_topic_score_gemma":0.0049691084,"teacher_disagreement_score":0.020523835,"about_ca_system_score_codex":0.0022998783,"about_ca_system_score_gemma":0.0034161962,"threshold_uncertainty_score":0.06865913},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28770557,0.0012216854,0.19579841,0.008468649,0.0010407744,0.00022982403,0.0014038368,0.0027021687,0.501429],"genre_scores_gemma":[0.89664364,0.00037309053,0.013145556,0.0012364784,0.0006389526,0.00014809975,0.0003872822,0.00064505066,0.0867818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862254,0.0003333974,0.000041148804,0.0002760953,0.00038514295,0.0003417036],"domain_scores_gemma":[0.99205536,0.0036432538,0.00056940556,0.0015200751,0.0010347854,0.0011770704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010065074,0.0008508364,0.0014816964,0.0024717506,0.002257,0.004821924,0.0017307098,0.0018742281,0.04695028],"category_scores_gemma":[0.012868314,0.0006272541,0.00061087345,0.0009633601,0.0037245438,0.0056033474,0.003680883,0.0040408056,0.0052805725],"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.00009428721,0.000036949325,0.0002911916,0.00006591718,0.000012741052,0.000095819705,0.00010745953,0.001541444,0.0021462627,0.9780059,0.0079165185,0.009685489],"study_design_scores_gemma":[0.00002145255,0.000026466678,0.00025466728,0.000013175531,0.00000997758,0.00015057616,0.00008518522,0.007825191,0.001328595,0.98507047,0.0051985946,0.00001568456],"about_ca_topic_score_codex":0.0007245488,"about_ca_topic_score_gemma":0.0011233567,"teacher_disagreement_score":0.04695028,"about_ca_system_score_codex":0.0008971094,"about_ca_system_score_gemma":0.00113882,"threshold_uncertainty_score":0.15706432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15019776,0.0005975743,0.7907757,0.003995113,0.000096006785,0.00024358578,0.0003107065,0.00021922459,0.053564396],"genre_scores_gemma":[0.92401713,0.0007622152,0.052398827,0.00034590694,0.00013427068,0.00045265045,0.00015486212,0.00009179127,0.02164232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977835,0.0012299524,0.000062043284,0.0002537313,0.0003154802,0.00035529133],"domain_scores_gemma":[0.98613715,0.011276762,0.0009328587,0.0003669276,0.00070958945,0.00057678676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032615333,0.0012427357,0.0015379632,0.0014518186,0.001425186,0.004578002,0.0024175674,0.0028904565,0.006060603],"category_scores_gemma":[0.0168225,0.00089237996,0.0009724309,0.0012602708,0.0029736143,0.005046657,0.0024298897,0.0025083416,0.0006013666],"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.00010922918,0.000072896655,0.0003357899,0.000096974574,0.000034494646,0.00011413165,0.00019091468,0.12898909,0.00052892225,0.86170584,0.0026595134,0.0051620975],"study_design_scores_gemma":[0.00003975747,0.000028464017,0.00008093524,0.00002442312,0.000016723288,0.000053899745,0.00011778614,0.40554458,0.00026240657,0.5927373,0.0010798078,0.000013888616],"about_ca_topic_score_codex":0.002454285,"about_ca_topic_score_gemma":0.0022890072,"teacher_disagreement_score":0.006060603,"about_ca_system_score_codex":0.002825051,"about_ca_system_score_gemma":0.0014854925,"threshold_uncertainty_score":0.020497262},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104827415,0.0015509739,0.9782543,0.0022352752,0.00024126552,0.000089036315,0.00018905968,0.00022118707,0.006736066],"genre_scores_gemma":[0.4548116,0.0049252254,0.5113168,0.0018124786,0.0019165364,0.0014831887,0.0012303843,0.0013348814,0.021168884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99381495,0.0031556,0.00022238634,0.0005141101,0.0018734606,0.00041947278],"domain_scores_gemma":[0.94934255,0.04294986,0.0018067495,0.0023097266,0.0027024266,0.00088876166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008267175,0.0022399377,0.002736044,0.0019178122,0.0013932667,0.003359248,0.0030895274,0.0027890175,0.0066505126],"category_scores_gemma":[0.049355194,0.0012594536,0.0016349208,0.0023484307,0.0036977879,0.0077665234,0.004730847,0.0077688023,0.0010696321],"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.0003043475,0.00015671337,0.0010600265,0.0003197157,0.00009874386,0.00010359791,0.0001439271,0.3368514,0.0014720765,0.6201964,0.00822258,0.031070458],"study_design_scores_gemma":[0.000024760306,0.000033040655,0.0001905877,0.000026904267,0.000014205054,0.000019043917,0.0000113539145,0.84201235,0.0003054271,0.15637688,0.00096991425,0.000015422484],"about_ca_topic_score_codex":0.0049329763,"about_ca_topic_score_gemma":0.0047600744,"teacher_disagreement_score":0.008267175,"about_ca_system_score_codex":0.0034675272,"about_ca_system_score_gemma":0.004020049,"threshold_uncertainty_score":0.043721557},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010465249,0.0019629973,0.9719651,0.0013443665,0.0003959047,0.000045878187,0.00013839961,0.00022224491,0.013459944],"genre_scores_gemma":[0.73134696,0.005026627,0.23079517,0.001270139,0.0014421002,0.000531318,0.00080742844,0.00090095465,0.027879283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956741,0.001377376,0.00020895521,0.0005786518,0.0016983945,0.0004625448],"domain_scores_gemma":[0.96008706,0.029917374,0.001967963,0.0017117888,0.00547557,0.0008401989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008653405,0.0027087398,0.0020484214,0.0022974757,0.0011087101,0.004495878,0.0025297033,0.0026039938,0.008232406],"category_scores_gemma":[0.039132692,0.0008957483,0.00083663943,0.0018270079,0.0038470384,0.0060078767,0.0047680307,0.0065714614,0.0013949688],"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.00030287952,0.00012911635,0.0006189419,0.0005271538,0.00009088542,0.00010809794,0.00044933642,0.3929849,0.0034025724,0.5426935,0.0073527703,0.05133976],"study_design_scores_gemma":[0.000009920398,0.00003611555,0.00014933861,0.00007695765,0.000014482368,0.000032642867,0.000052173105,0.8471635,0.0009865245,0.1499247,0.0015291193,0.000024575687],"about_ca_topic_score_codex":0.0026724036,"about_ca_topic_score_gemma":0.0021751598,"teacher_disagreement_score":0.008653405,"about_ca_system_score_codex":0.0024560401,"about_ca_system_score_gemma":0.0019215543,"threshold_uncertainty_score":0.04576409},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066278973,0.00016237418,0.989908,0.00011066392,0.000043746622,0.000026559946,0.000047724225,0.00022081226,0.0028522492],"genre_scores_gemma":[0.17179538,0.00037737237,0.82035774,0.00011746529,0.00010967969,0.00019766932,0.00035712667,0.00044945395,0.006238119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917233,0.0002180277,0.00003795903,0.00012470728,0.00034230345,0.000104680184],"domain_scores_gemma":[0.9978662,0.0012203668,0.00012793316,0.00029206043,0.0003535009,0.00013996758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011806784,0.0007805716,0.0012449903,0.0013347497,0.0010120985,0.0018576132,0.0016119297,0.00084974634,0.0046474654],"category_scores_gemma":[0.006620229,0.000653406,0.0013085615,0.0015717766,0.0015642085,0.0029670268,0.0031607416,0.0038852587,0.0009390506],"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.00032026073,0.00020245994,0.001949648,0.00023442619,0.000048783448,0.000039559087,0.00025917232,0.21919549,0.0041678413,0.42372122,0.011338036,0.3385232],"study_design_scores_gemma":[0.000029048759,0.000036728776,0.00021332156,0.000020844505,0.000015108345,0.000032560813,0.000036143763,0.83429104,0.0018194119,0.15956339,0.003926296,0.000016052993],"about_ca_topic_score_codex":0.002522259,"about_ca_topic_score_gemma":0.0040477775,"teacher_disagreement_score":0.0046474654,"about_ca_system_score_codex":0.0010768889,"about_ca_system_score_gemma":0.0017025312,"threshold_uncertainty_score":0.015547335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016308683,0.0019311102,0.98911285,0.0008395584,0.00023517774,0.00002093547,0.000038126196,0.00005034545,0.0061411043],"genre_scores_gemma":[0.117892124,0.0072806776,0.8563565,0.00097272353,0.0021511402,0.00036059073,0.00021078975,0.0002745907,0.014500831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835026,0.00065066555,0.00007369098,0.00021236557,0.0006438789,0.00006917077],"domain_scores_gemma":[0.9963708,0.0025303098,0.00026514346,0.0002933413,0.00040555518,0.00013492983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022909727,0.0017418467,0.0015651091,0.0019811427,0.0006986424,0.0031143867,0.002896252,0.0014825382,0.005479633],"category_scores_gemma":[0.0074637583,0.00091447384,0.0017069652,0.0024109753,0.001992721,0.005542716,0.0028222918,0.0055616195,0.0008338836],"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.000024425652,0.00007737062,0.00024259285,0.00030610975,0.00009430575,0.00004167448,0.00010316156,0.16625331,0.00065426907,0.7741138,0.0048387595,0.05325031],"study_design_scores_gemma":[0.000013728073,0.000013983638,0.00008585924,0.000036493828,0.00002135156,0.000029735469,0.000023990478,0.43216676,0.0001987522,0.5588407,0.008554425,0.0000142622],"about_ca_topic_score_codex":0.0011047838,"about_ca_topic_score_gemma":0.0017793357,"teacher_disagreement_score":0.005479633,"about_ca_system_score_codex":0.0018286112,"about_ca_system_score_gemma":0.0010649206,"threshold_uncertainty_score":0.01833123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16963208,0.00080213323,0.7982449,0.0013252932,0.00009443731,0.00006880427,0.00030085634,0.00036654915,0.02916485],"genre_scores_gemma":[0.9308661,0.00087944756,0.05834596,0.00025209668,0.00020188537,0.00013358923,0.0004740695,0.0005362841,0.008310651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961559,0.0018469105,0.00020952501,0.00051464705,0.00083810714,0.0004348897],"domain_scores_gemma":[0.9791626,0.013085246,0.0011931729,0.0050765593,0.0010342528,0.0004481498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050800587,0.00083367707,0.0014323668,0.0016409984,0.00059107254,0.0041925893,0.0019448485,0.0010700846,0.0070512146],"category_scores_gemma":[0.03777514,0.00069600774,0.0011130929,0.0019488327,0.0035853107,0.009247099,0.0036318863,0.0029990675,0.0014688141],"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.0001886282,0.000067497254,0.00077563204,0.00005893215,0.000033666318,0.00004872962,0.00017053672,0.022317847,0.002328096,0.93607074,0.001456631,0.036483012],"study_design_scores_gemma":[0.000025360958,0.00007021986,0.00059479417,0.000014787867,0.000018011693,0.00006156865,0.000060280567,0.09973019,0.0021618092,0.8959538,0.001296584,0.000012724399],"about_ca_topic_score_codex":0.00062668946,"about_ca_topic_score_gemma":0.00032650208,"teacher_disagreement_score":0.0070512146,"about_ca_system_score_codex":0.0011267462,"about_ca_system_score_gemma":0.0008187988,"threshold_uncertainty_score":0.026866257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064002395,0.001794872,0.8764941,0.00367561,0.00026064838,0.0001032777,0.00044840062,0.00034941692,0.0528713],"genre_scores_gemma":[0.5128234,0.0026659807,0.4438509,0.0012454217,0.0006605244,0.00041971356,0.0013738079,0.0005151873,0.036445044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843293,0.0006241502,0.00005197238,0.00026983174,0.00037827718,0.00024283153],"domain_scores_gemma":[0.9937848,0.004876372,0.00042352066,0.0003328014,0.00031586955,0.00026671862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018029056,0.0011540332,0.0014691442,0.0014662265,0.0013656932,0.0051482785,0.002203279,0.0023244417,0.0123492135],"category_scores_gemma":[0.011670004,0.0011599903,0.0013724373,0.002832178,0.0029116813,0.0072155446,0.002095815,0.006916744,0.0013327713],"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.000121983845,0.00010312765,0.00027705508,0.00015486211,0.000025692298,0.00004621122,0.00014254531,0.07931405,0.0006733469,0.88683474,0.0074666315,0.024839878],"study_design_scores_gemma":[0.000015537522,0.000010027377,0.00009315386,0.000022655824,0.000006495083,0.000022116297,0.00002876013,0.085132234,0.00022272025,0.912868,0.001570402,0.000007910409],"about_ca_topic_score_codex":0.0025349208,"about_ca_topic_score_gemma":0.0030318205,"teacher_disagreement_score":0.0123492135,"about_ca_system_score_codex":0.003109184,"about_ca_system_score_gemma":0.0014460614,"threshold_uncertainty_score":0.041312277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016368134,0.003772407,0.9655235,0.0024714107,0.00034580412,0.00010717233,0.00015638307,0.00033940654,0.010915784],"genre_scores_gemma":[0.24524817,0.0069236797,0.730673,0.001021199,0.0018969816,0.0006985887,0.00070881646,0.0005748604,0.0122546395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997003,0.0014289138,0.00012572,0.0003516864,0.00076548895,0.0003251473],"domain_scores_gemma":[0.9773284,0.018515946,0.0012029639,0.0014061605,0.0010656755,0.0004808608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006679699,0.0021120661,0.0024711534,0.0035786936,0.0017366052,0.0049045444,0.0041194432,0.004255189,0.0063250456],"category_scores_gemma":[0.041220576,0.0014656397,0.0028673671,0.0077937073,0.0029828772,0.009262809,0.003547474,0.007875432,0.0009225691],"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.0002645025,0.00035343145,0.0010715463,0.00034547475,0.00010709865,0.00007751711,0.00035603245,0.38518324,0.00081998983,0.4734344,0.014152573,0.12383416],"study_design_scores_gemma":[0.000042008858,0.000026792346,0.00017095137,0.000037646692,0.00002825661,0.000060589406,0.000045492987,0.7045528,0.0002272934,0.29209056,0.0027004094,0.00001717096],"about_ca_topic_score_codex":0.004168595,"about_ca_topic_score_gemma":0.004230979,"teacher_disagreement_score":0.006679699,"about_ca_system_score_codex":0.004269031,"about_ca_system_score_gemma":0.002383222,"threshold_uncertainty_score":0.035326064},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013111863,0.0039863344,0.962044,0.0022582205,0.0003175682,0.00009738994,0.00015606164,0.00021781518,0.017810768],"genre_scores_gemma":[0.47555906,0.0072651994,0.4847843,0.0025581268,0.001743084,0.0008209859,0.00080963824,0.0008602973,0.025599172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916875,0.003938606,0.00027997457,0.0007557851,0.0026215224,0.0007167397],"domain_scores_gemma":[0.9692486,0.021554003,0.0012510493,0.0018866212,0.0043915734,0.0016681732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021087892,0.0026317853,0.0030112453,0.005039422,0.0017764551,0.0038686208,0.004306432,0.0031964732,0.006923088],"category_scores_gemma":[0.05818595,0.0011726521,0.003079772,0.003115983,0.0048878565,0.0074225278,0.0076728095,0.011209307,0.0014659467],"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.00016774616,0.00014555009,0.0007632508,0.00041816494,0.00012776969,0.00007424407,0.00039076037,0.06564546,0.0016713218,0.8926623,0.0072688805,0.030664602],"study_design_scores_gemma":[0.000023258364,0.00010045999,0.00040069688,0.000116572075,0.000044331424,0.000062331295,0.000059376565,0.7240184,0.0006763015,0.27122506,0.0032348572,0.00003831227],"about_ca_topic_score_codex":0.0039612935,"about_ca_topic_score_gemma":0.0030657419,"teacher_disagreement_score":0.021087892,"about_ca_system_score_codex":0.0051874905,"about_ca_system_score_gemma":0.0030691875,"threshold_uncertainty_score":0.11152482},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006163192,0.00007070782,0.9983621,0.000098119606,0.000019822739,0.000007820737,0.000019176756,0.000023689237,0.00078231544],"genre_scores_gemma":[0.067052126,0.0006854304,0.92531276,0.0001649743,0.00016164462,0.00022891593,0.00019775405,0.0001333368,0.0060629863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949396,0.00023686381,0.000019696747,0.000049323815,0.0001701643,0.00003009103],"domain_scores_gemma":[0.9989404,0.0006664029,0.00007781787,0.000075683565,0.00019547893,0.00004425315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012489138,0.0009059954,0.0010538021,0.0008160115,0.00043582582,0.0011844311,0.0012740338,0.0010866745,0.002872517],"category_scores_gemma":[0.0035650185,0.0006468543,0.00086285395,0.0010713465,0.0010981947,0.0014631322,0.0017673419,0.0021168473,0.0007124966],"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.000035621888,0.00006182313,0.00018240849,0.00019635621,0.000044866192,0.000091057664,0.00008271286,0.60139155,0.0023546796,0.32027647,0.0052238335,0.07005864],"study_design_scores_gemma":[0.0000042023985,0.000011114405,0.000018541465,0.0000071706163,0.000004282636,0.000012874113,0.000005569451,0.9656085,0.00017224732,0.032783736,0.0013669429,0.000004801556],"about_ca_topic_score_codex":0.0021449723,"about_ca_topic_score_gemma":0.0029751132,"teacher_disagreement_score":0.002872517,"about_ca_system_score_codex":0.0004956822,"about_ca_system_score_gemma":0.0013216214,"threshold_uncertainty_score":0.00960958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01326203,0.0014571276,0.97508574,0.000948915,0.000258536,0.000032679156,0.000056412955,0.00012402292,0.0087745525],"genre_scores_gemma":[0.27247542,0.0038937328,0.6922397,0.0010478406,0.0009300672,0.00038373072,0.0003707681,0.00051416364,0.028144512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951065,0.00025979927,0.000025323596,0.00006303257,0.00011746377,0.000023718547],"domain_scores_gemma":[0.99825627,0.00090198213,0.00016130428,0.00015748598,0.00038695298,0.00013597052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022414823,0.0011835605,0.00096431276,0.0012217951,0.00058038067,0.0013919438,0.0012157289,0.0015459049,0.003254542],"category_scores_gemma":[0.0059897765,0.0007603865,0.0008562706,0.0007592816,0.00182569,0.002956893,0.0014378369,0.00282768,0.00074273004],"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.00012764146,0.00011508417,0.00026048836,0.00022468054,0.000044182187,0.00006717757,0.00015833191,0.09089096,0.0027313037,0.83427835,0.0074975453,0.0636043],"study_design_scores_gemma":[0.000038576225,0.00006829792,0.00009260232,0.000044914537,0.000015444939,0.000053745825,0.000038830945,0.5026067,0.00068790617,0.48943743,0.006889701,0.00002581228],"about_ca_topic_score_codex":0.0005278587,"about_ca_topic_score_gemma":0.001023022,"teacher_disagreement_score":0.003254542,"about_ca_system_score_codex":0.00057880185,"about_ca_system_score_gemma":0.000657821,"threshold_uncertainty_score":0.011854231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024898746,0.000034969762,0.99588543,0.00016002807,0.000020836065,0.00002514913,0.000018257166,0.00010635694,0.0012591336],"genre_scores_gemma":[0.28053784,0.0002463832,0.7090016,0.00028666377,0.00010415834,0.0005434029,0.00016568626,0.0003908041,0.008723408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923015,0.00040593257,0.000026894011,0.000112409674,0.00019158128,0.00003304334],"domain_scores_gemma":[0.99743587,0.0017811864,0.00016949486,0.00021160363,0.0002628843,0.00013900433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026073484,0.0014048463,0.0014738567,0.000524222,0.0005206562,0.0015068486,0.0015315244,0.0016470137,0.0044760564],"category_scores_gemma":[0.0080393,0.00078635727,0.0007121467,0.0006276545,0.0015216831,0.0022299604,0.0028336155,0.0026688932,0.0009951484],"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.00016708836,0.0002179374,0.00033679596,0.00023120476,0.000079671256,0.00016952713,0.00012428137,0.5821975,0.0044812416,0.33693781,0.0070316615,0.068025246],"study_design_scores_gemma":[0.00001389452,0.000022413808,0.000016727352,0.000004149611,0.0000030754293,0.000011814019,0.000004374636,0.9690985,0.0002848515,0.0301486,0.0003868418,0.000004786693],"about_ca_topic_score_codex":0.0007767947,"about_ca_topic_score_gemma":0.0010361775,"teacher_disagreement_score":0.0044760564,"about_ca_system_score_codex":0.0006376703,"about_ca_system_score_gemma":0.0015081723,"threshold_uncertainty_score":0.014973938},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009854377,0.00046507872,0.98157597,0.00039968564,0.000091218484,0.000046509136,0.00010564226,0.000055074328,0.0074064936],"genre_scores_gemma":[0.47579867,0.00087044353,0.50071853,0.00035914205,0.00019613915,0.00048100195,0.00033598888,0.00022503469,0.021015026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909365,0.00033229258,0.00004229161,0.00017357114,0.00027990516,0.00007835493],"domain_scores_gemma":[0.99910647,0.00056595093,0.00010143774,0.0000486945,0.00011981205,0.000057570833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018830308,0.0013316814,0.0016376355,0.00094184076,0.0006176676,0.0020469401,0.0015629653,0.0024672553,0.0036735719],"category_scores_gemma":[0.0037398306,0.00080787105,0.0009832226,0.0014247843,0.00089505425,0.0018741747,0.002389185,0.0015829719,0.00044267165],"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.00007960848,0.00009347372,0.00035362772,0.00028572368,0.00012022012,0.00025180826,0.000065184075,0.794762,0.004688161,0.14792965,0.0027221867,0.04864839],"study_design_scores_gemma":[0.000017728062,0.000039791594,0.0001356932,0.000024439469,0.000020886886,0.000057782192,0.000014282441,0.9533873,0.0011169934,0.042869207,0.0023048406,0.000010971236],"about_ca_topic_score_codex":0.0013258304,"about_ca_topic_score_gemma":0.0011916301,"teacher_disagreement_score":0.0036735719,"about_ca_system_score_codex":0.000953639,"about_ca_system_score_gemma":0.0009829374,"threshold_uncertainty_score":0.012289345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017110044,0.0006193087,0.9703078,0.002109628,0.00009957933,0.000063374995,0.0003365272,0.000076284035,0.009277417],"genre_scores_gemma":[0.40939167,0.0023964106,0.5488406,0.0010884306,0.0007916455,0.0009752117,0.0017372465,0.0005328671,0.03424605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984195,0.00084131525,0.000035911264,0.00027185702,0.00031669147,0.00011461681],"domain_scores_gemma":[0.9928531,0.0055036047,0.00046798322,0.0002950621,0.00052219996,0.00035807816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032771775,0.0013819832,0.0019266952,0.0012327806,0.0009968142,0.0022963602,0.0029682766,0.0031476754,0.0059034247],"category_scores_gemma":[0.015614402,0.001027201,0.00090085564,0.0019827131,0.003294548,0.0042207353,0.0028820867,0.004238251,0.000676272],"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.00009414746,0.000103964674,0.00035137637,0.00024502413,0.00004861136,0.000061910985,0.00012940215,0.2594862,0.0007522504,0.7115536,0.0075698188,0.019603709],"study_design_scores_gemma":[0.000018090614,0.000020195092,0.00012254884,0.000022788867,0.000006302221,0.000028807493,0.00004119814,0.6255973,0.00017814977,0.3724661,0.0014829572,0.000015644091],"about_ca_topic_score_codex":0.004527499,"about_ca_topic_score_gemma":0.0062854122,"teacher_disagreement_score":0.0059034247,"about_ca_system_score_codex":0.0023547458,"about_ca_system_score_gemma":0.0021624712,"threshold_uncertainty_score":0.019748926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005524793,0.0007915018,0.9807755,0.0004609822,0.00022746042,0.00007509244,0.00019176221,0.000870471,0.011082481],"genre_scores_gemma":[0.121090785,0.0009563486,0.86458874,0.00040549936,0.00038247867,0.00048300065,0.00076528464,0.00076890946,0.010558929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968816,0.0008705944,0.00012108436,0.0004295064,0.0013134305,0.00038382344],"domain_scores_gemma":[0.9940124,0.0036298481,0.00025785813,0.00095738145,0.0009732467,0.00016929983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196622,0.0022762008,0.0020728498,0.0025488713,0.001041078,0.0039170687,0.0045808256,0.0025575298,0.016461581],"category_scores_gemma":[0.014377233,0.0013021915,0.0016748188,0.0037261506,0.0014406211,0.0051939883,0.003117798,0.005986896,0.0034152449],"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.00035861807,0.00039069937,0.00038983312,0.0003214222,0.00008047476,0.00007153097,0.00014466228,0.6220709,0.0026034333,0.13721047,0.019899303,0.21645868],"study_design_scores_gemma":[0.000049329657,0.000033466793,0.000108506785,0.000029598516,0.000018796225,0.00003096123,0.000017010587,0.94233966,0.00079828815,0.052978616,0.0035785087,0.000017168773],"about_ca_topic_score_codex":0.0054645925,"about_ca_topic_score_gemma":0.0070440536,"teacher_disagreement_score":0.016461581,"about_ca_system_score_codex":0.003306512,"about_ca_system_score_gemma":0.003636626,"threshold_uncertainty_score":0.055069447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036174068,0.0010314959,0.9851953,0.0005012313,0.00012023401,0.000098871715,0.00012634916,0.00008429473,0.009224836],"genre_scores_gemma":[0.120365106,0.004571186,0.85632056,0.0003572946,0.00041938055,0.00064324745,0.0005683586,0.0003642094,0.016390597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981949,0.0006413171,0.000061124185,0.00027651186,0.00062940526,0.00019678098],"domain_scores_gemma":[0.9963606,0.0027869327,0.00024073265,0.0001328533,0.00033017254,0.0001486654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003522883,0.0029719213,0.004061852,0.0029936186,0.0020089545,0.004467258,0.0043294257,0.004368691,0.009658637],"category_scores_gemma":[0.009763055,0.0028136778,0.003014998,0.0059616086,0.003232838,0.006441248,0.002433333,0.0057731834,0.0017555518],"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.00011352236,0.00019304137,0.00020624755,0.00023216364,0.000058503883,0.00005636349,0.00008366455,0.79524404,0.0004667885,0.15515432,0.0061204256,0.04207089],"study_design_scores_gemma":[0.000023896802,0.000027993026,0.000050078455,0.000038879407,0.00002293524,0.00002552781,0.00002017041,0.91909385,0.00021961662,0.0786225,0.0018416705,0.0000129812815],"about_ca_topic_score_codex":0.011458303,"about_ca_topic_score_gemma":0.0071257693,"teacher_disagreement_score":0.011458303,"about_ca_system_score_codex":0.0032782245,"about_ca_system_score_gemma":0.0034190202,"threshold_uncertainty_score":0.03231138},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19637306,0.00053462724,0.7485513,0.0012253154,0.00033238146,0.00016280063,0.0020883558,0.0029855494,0.047746632],"genre_scores_gemma":[0.7491712,0.0004902697,0.20601173,0.00040154633,0.00028587648,0.0001545239,0.0065479637,0.0007416695,0.03619513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999418,0.00007401792,0.000044467055,0.00022882794,0.00014288732,0.000091905575],"domain_scores_gemma":[0.9988701,0.00038582375,0.00016803789,0.00021925494,0.00025680722,0.000100012905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029538234,0.00072368386,0.0005946426,0.0013239634,0.001009436,0.0027728057,0.0009424475,0.0010516108,0.014075169],"category_scores_gemma":[0.0027998032,0.0006075875,0.00058012956,0.0012887985,0.00064551696,0.0056155883,0.0014221139,0.0016397358,0.004182139],"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.00049183285,0.0002568344,0.004039592,0.0003279084,0.00005615493,0.00042429706,0.00077094976,0.024126742,0.04461311,0.612319,0.028503941,0.28406954],"study_design_scores_gemma":[0.00002896607,0.00008697196,0.0011140588,0.00004587622,0.000028135668,0.000329134,0.00040675563,0.10656305,0.016082207,0.8450315,0.030252917,0.000030466883],"about_ca_topic_score_codex":0.0013282432,"about_ca_topic_score_gemma":0.0021352903,"teacher_disagreement_score":0.014075169,"about_ca_system_score_codex":0.000555315,"about_ca_system_score_gemma":0.00045730174,"threshold_uncertainty_score":0.04708612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008037454,0.00010272479,0.99833953,0.000029742707,0.00003387365,0.00001553374,0.000019921252,0.00008343339,0.0005715152],"genre_scores_gemma":[0.08734763,0.00047084893,0.9051334,0.00008856976,0.00014818419,0.00023620203,0.00021817841,0.00047734755,0.0058796257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890614,0.0004911211,0.000056274424,0.00013845283,0.0003565619,0.000051471277],"domain_scores_gemma":[0.9954397,0.002747104,0.00030494307,0.0004755897,0.00086389127,0.00016874526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032523044,0.0011921898,0.0016410814,0.00069599744,0.00048264515,0.0014787933,0.0023892736,0.0016325924,0.0056086536],"category_scores_gemma":[0.012634516,0.0010385405,0.0012269433,0.00082441146,0.0011749995,0.00209156,0.002254936,0.002448357,0.0019545793],"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.0004706171,0.00009997346,0.0006316547,0.0005042065,0.00012792484,0.00019451852,0.00017489804,0.757632,0.0073919967,0.10512229,0.0058713304,0.12177853],"study_design_scores_gemma":[0.0000112289135,0.00004009821,0.000033203956,0.000013804189,0.000010855066,0.000031962925,0.0000043732007,0.9926231,0.0007484191,0.0045415238,0.0019309531,0.000010588915],"about_ca_topic_score_codex":0.003016618,"about_ca_topic_score_gemma":0.0019581069,"teacher_disagreement_score":0.0056086536,"about_ca_system_score_codex":0.0005738261,"about_ca_system_score_gemma":0.0014722092,"threshold_uncertainty_score":0.018762767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083663955,0.0056148274,0.85430354,0.007990994,0.00037502838,0.0002148038,0.0011682127,0.00065305864,0.04601557],"genre_scores_gemma":[0.7328678,0.0057628867,0.23157422,0.001872282,0.0013119208,0.00080473494,0.0018365023,0.0012845881,0.022685079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950885,0.0015745695,0.00015520876,0.0009219485,0.001264118,0.000995684],"domain_scores_gemma":[0.927836,0.061349455,0.0034569432,0.0031166524,0.002321615,0.0019193026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006751909,0.004225361,0.0033492278,0.0035788193,0.0020683056,0.009656841,0.006714181,0.0037569732,0.013706724],"category_scores_gemma":[0.05055624,0.0021801216,0.003176179,0.005436358,0.0057462323,0.019244434,0.006312752,0.013931597,0.0014877194],"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.00097451394,0.0004818258,0.002620798,0.0011966075,0.00020952374,0.00018728428,0.00087360194,0.40529725,0.0033091013,0.5074505,0.014227569,0.06317148],"study_design_scores_gemma":[0.000065042805,0.000092614064,0.0007372839,0.00014162541,0.00009008786,0.000085679334,0.00019685847,0.41367787,0.0010112057,0.5814664,0.002397157,0.00003820159],"about_ca_topic_score_codex":0.0040259776,"about_ca_topic_score_gemma":0.008018481,"teacher_disagreement_score":0.013706724,"about_ca_system_score_codex":0.008559079,"about_ca_system_score_gemma":0.0036474369,"threshold_uncertainty_score":0.062100768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33865488,0.00039357092,0.65003014,0.0011763516,0.000071511626,0.00012643207,0.00022278175,0.00029850236,0.009025845],"genre_scores_gemma":[0.9448975,0.00030319326,0.045890797,0.00016783873,0.00010745265,0.00021585186,0.0003154416,0.00017856188,0.007923314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928325,0.0003342396,0.00002276404,0.0001870617,0.000084921514,0.00008782201],"domain_scores_gemma":[0.98127705,0.015500876,0.0012596895,0.0005216042,0.0006114182,0.0008292642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012913635,0.001136832,0.0015341969,0.002241686,0.001510241,0.0026347572,0.001513617,0.0018002893,0.0062830565],"category_scores_gemma":[0.015853409,0.0009984238,0.00095879677,0.0009877731,0.0025800045,0.0029331972,0.0019780272,0.002533077,0.0005187691],"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.00026059488,0.00016829699,0.002951484,0.00023805971,0.00013659164,0.00028098497,0.0006312543,0.16725418,0.007125974,0.79791987,0.0057300236,0.017302701],"study_design_scores_gemma":[0.000041378684,0.000036944006,0.0002794789,0.000017487517,0.000019563005,0.000028894112,0.00014501982,0.35704094,0.000825962,0.6410422,0.00050740084,0.000014731218],"about_ca_topic_score_codex":0.0015068493,"about_ca_topic_score_gemma":0.001948138,"teacher_disagreement_score":0.0062830565,"about_ca_system_score_codex":0.0011118101,"about_ca_system_score_gemma":0.0007438556,"threshold_uncertainty_score":0.021018863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095541833,0.000049446033,0.99838614,0.000034199806,0.000020628771,0.000014582609,0.000014707709,0.00008713984,0.00043777522],"genre_scores_gemma":[0.10542803,0.00021339237,0.8879991,0.00012892613,0.00010077616,0.00026314228,0.00015020215,0.00020481154,0.0055116555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920124,0.0002571061,0.000034892193,0.0000940155,0.00036652453,0.000046212695],"domain_scores_gemma":[0.99853945,0.0008169142,0.00010877573,0.00014406609,0.00032932113,0.00006136617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013741009,0.00092459965,0.0015434824,0.0005429328,0.000371441,0.0009994117,0.0014394746,0.0014778395,0.0042652236],"category_scores_gemma":[0.0046864776,0.00057136634,0.0006689334,0.00072475534,0.0007149741,0.001112725,0.0012433425,0.0014870443,0.0012846928],"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.00017199229,0.000088709494,0.00024700534,0.0002235352,0.00006910653,0.00013176144,0.000073474475,0.8019512,0.00743198,0.040923204,0.0042990325,0.14438896],"study_design_scores_gemma":[0.0000061332466,0.0000123670225,0.000016545166,0.000002283802,0.0000027982903,0.000011052169,0.0000017626223,0.99715734,0.0002887864,0.0020555574,0.00044179303,0.0000036850593],"about_ca_topic_score_codex":0.004008511,"about_ca_topic_score_gemma":0.0038754183,"teacher_disagreement_score":0.0042652236,"about_ca_system_score_codex":0.0005252976,"about_ca_system_score_gemma":0.0015001585,"threshold_uncertainty_score":0.014268577},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5764634,0.0028723541,0.3694616,0.0025717886,0.00021798561,0.00018347136,0.00065019174,0.00033794114,0.047241315],"genre_scores_gemma":[0.9478266,0.0009388754,0.04761529,0.00028492435,0.00016734382,0.00018120189,0.00044565226,0.0001542226,0.0023858133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944174,0.0023620855,0.0002271421,0.00067665946,0.001774722,0.0005419699],"domain_scores_gemma":[0.8798634,0.10417184,0.0071291085,0.002278289,0.0038068858,0.0027504459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010792338,0.001173427,0.0017340158,0.005064252,0.0024909782,0.0068472433,0.0030570305,0.0036378303,0.00870368],"category_scores_gemma":[0.08119086,0.0019353125,0.0013804146,0.0040367967,0.0048463205,0.010203553,0.0036193545,0.005702205,0.00046490695],"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.00080113544,0.00018335698,0.007909185,0.00034636818,0.00016832602,0.0005058508,0.0007409776,0.07776169,0.002919412,0.8675242,0.0023492323,0.038790233],"study_design_scores_gemma":[0.000068277295,0.00014145211,0.0022407866,0.0001924121,0.00012165639,0.00047326132,0.0006044584,0.24811344,0.0020650881,0.7440666,0.0018515778,0.000060958944],"about_ca_topic_score_codex":0.00091349805,"about_ca_topic_score_gemma":0.000939008,"teacher_disagreement_score":0.010792338,"about_ca_system_score_codex":0.0018966655,"about_ca_system_score_gemma":0.0009674886,"threshold_uncertainty_score":0.057076037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087000035,0.0001425842,0.8766216,0.0004631884,0.00010198803,0.00020708202,0.00054851105,0.00042425707,0.03449069],"genre_scores_gemma":[0.5453446,0.00047770204,0.42184004,0.0002971037,0.00012409384,0.0005483058,0.002391861,0.0007386365,0.02823774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995005,0.000081916194,0.000018247478,0.000078542405,0.00019948688,0.00012127865],"domain_scores_gemma":[0.99904424,0.0005361776,0.00006764061,0.00011879815,0.00014512734,0.00008792485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005577727,0.0006166815,0.00086040405,0.00086384814,0.0008069948,0.0023965768,0.0013172639,0.0008837845,0.00937863],"category_scores_gemma":[0.0025671744,0.00053208496,0.0015258756,0.0009138963,0.0013304828,0.001770085,0.0015823208,0.0028407841,0.0014300538],"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.00009011967,0.00018851264,0.00088404294,0.00022502532,0.000031697342,0.00018157599,0.00053606747,0.055008784,0.0046216333,0.8429458,0.015295453,0.07999132],"study_design_scores_gemma":[0.000038802413,0.00003886515,0.000185364,0.000029038645,0.00001632673,0.00008142613,0.00017334732,0.19054973,0.001847117,0.80215836,0.0048643826,0.000017166787],"about_ca_topic_score_codex":0.00326131,"about_ca_topic_score_gemma":0.0046851365,"teacher_disagreement_score":0.00937863,"about_ca_system_score_codex":0.00093650265,"about_ca_system_score_gemma":0.0008958179,"threshold_uncertainty_score":0.031374693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003256794,0.00023505381,0.9885153,0.00039236734,0.00007804123,0.00003900627,0.000057025118,0.00013097521,0.0072954255],"genre_scores_gemma":[0.2298435,0.0006461963,0.74585974,0.00035085154,0.00017605275,0.00035170763,0.00032363506,0.00074861676,0.021699695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994431,0.000246437,0.000016539325,0.000091396214,0.00014475254,0.00005767773],"domain_scores_gemma":[0.998604,0.00090743817,0.00008649815,0.00014354957,0.00017317793,0.00008523674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017058118,0.0014017406,0.0017150105,0.00071531563,0.0009398149,0.001643375,0.0028396,0.0018622626,0.008302035],"category_scores_gemma":[0.0062959073,0.001032805,0.0013575422,0.0009167726,0.0017800404,0.0029919469,0.003008366,0.004818966,0.0013099854],"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.00018651092,0.00016990818,0.00026792285,0.0003254372,0.0000480122,0.00007203272,0.00014061488,0.44511434,0.001157222,0.45625168,0.011191907,0.085074306],"study_design_scores_gemma":[0.000023960265,0.000020118194,0.000038089398,0.000022676904,0.000009855118,0.000018277357,0.000016152124,0.8535443,0.0003517089,0.1440507,0.0018959173,0.000008212004],"about_ca_topic_score_codex":0.0034723585,"about_ca_topic_score_gemma":0.003586294,"teacher_disagreement_score":0.008302035,"about_ca_system_score_codex":0.0012291097,"about_ca_system_score_gemma":0.0017389702,"threshold_uncertainty_score":0.027773082},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21576759,0.0022045637,0.749945,0.0014256509,0.0003059805,0.00015865374,0.00018489196,0.0028434119,0.027164292],"genre_scores_gemma":[0.8656532,0.0005555207,0.1281489,0.0003718539,0.00027456874,0.00018755648,0.0002927739,0.0009444398,0.0035711955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99390393,0.0030657395,0.00016932657,0.00059163716,0.001471534,0.00079776277],"domain_scores_gemma":[0.9685637,0.024361832,0.0015306862,0.002808902,0.00200287,0.0007319926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008807912,0.0020131462,0.0014807119,0.0012666543,0.000920172,0.0024716037,0.0021620493,0.0019385841,0.004582961],"category_scores_gemma":[0.042518463,0.0006234222,0.0005343072,0.0012728253,0.0019352454,0.004029292,0.0018822317,0.0020489506,0.0011332618],"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.004016107,0.0004498062,0.002529873,0.0003380801,0.0001283254,0.00012748496,0.00017900384,0.8208567,0.013841846,0.039350364,0.0062348214,0.11194762],"study_design_scores_gemma":[0.00005456738,0.0001771845,0.00027909054,0.00001479051,0.00002187998,0.00004282336,0.000022106206,0.98882115,0.0025255799,0.0077247997,0.00030634247,0.000009783429],"about_ca_topic_score_codex":0.0016413367,"about_ca_topic_score_gemma":0.0011098059,"teacher_disagreement_score":0.008807912,"about_ca_system_score_codex":0.0024051298,"about_ca_system_score_gemma":0.0029228118,"threshold_uncertainty_score":0.04658127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002050546,0.000032990585,0.9970937,0.00009493921,0.0000141102955,0.00001377439,0.000011169073,0.000038687383,0.00065001706],"genre_scores_gemma":[0.25766677,0.0003159655,0.733048,0.00017604235,0.00011227581,0.000307625,0.00017025581,0.00047275287,0.0077303182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892896,0.00056720036,0.000044993398,0.0001607791,0.0002522167,0.000045826848],"domain_scores_gemma":[0.99722385,0.0017331125,0.00021886939,0.00034498362,0.00037121098,0.00010791715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021932255,0.0011029305,0.0014626823,0.0005849893,0.00042629827,0.001646421,0.0013121364,0.002583315,0.0026360943],"category_scores_gemma":[0.008401576,0.00084583473,0.0011119429,0.00057936675,0.001488515,0.0025708019,0.0026317202,0.0023913477,0.00056962064],"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.00012164491,0.00006491534,0.0003150463,0.00017873824,0.000058191068,0.00013367255,0.00010554772,0.78947115,0.0082623055,0.16365586,0.0026055574,0.035027254],"study_design_scores_gemma":[0.0000057185257,0.000010766204,0.000015233949,0.0000036782053,0.000004304024,0.000015584166,0.000003958411,0.98811483,0.0005560435,0.010741694,0.00052475644,0.0000035606795],"about_ca_topic_score_codex":0.0013037018,"about_ca_topic_score_gemma":0.0008810368,"teacher_disagreement_score":0.0026360943,"about_ca_system_score_codex":0.000788261,"about_ca_system_score_gemma":0.0012080376,"threshold_uncertainty_score":0.011599004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32144484,0.039176222,0.3944667,0.024319299,0.0010704144,0.0001431942,0.0012171854,0.0003922554,0.21776997],"genre_scores_gemma":[0.86513084,0.01854768,0.06231584,0.0017936612,0.0032240257,0.00027213496,0.0007391578,0.00011073729,0.047865957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.00041189117,0.000066047294,0.0002992226,0.00025183422,0.00013013804],"domain_scores_gemma":[0.9965204,0.0018673132,0.0006048886,0.000390968,0.00028656967,0.00032985787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020513907,0.0007065301,0.0011479662,0.0019682795,0.0016845913,0.004414753,0.0012207719,0.0017390944,0.0067762085],"category_scores_gemma":[0.0065497034,0.0006244557,0.0007473799,0.0041449345,0.0044976454,0.011351848,0.002439415,0.0036209074,0.00078956835],"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.000018323944,0.000026906599,0.00020950435,0.000041656032,0.0000055134856,0.000018267432,0.00008046336,0.001051402,0.00011011429,0.9880661,0.0016742456,0.008697555],"study_design_scores_gemma":[0.0000033418594,0.000004194798,0.000057028497,0.0000074654945,0.0000035387804,0.00003137463,0.00003289919,0.0012941902,0.000025999696,0.9965469,0.0019906657,0.0000024056328],"about_ca_topic_score_codex":0.0010661605,"about_ca_topic_score_gemma":0.001348305,"teacher_disagreement_score":0.0067762085,"about_ca_system_score_codex":0.0015635391,"about_ca_system_score_gemma":0.0009044813,"threshold_uncertainty_score":0.02266872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40783623,0.0020425431,0.5006387,0.0042904997,0.00016769205,0.00010879127,0.00053642935,0.000116622636,0.08426249],"genre_scores_gemma":[0.94676244,0.0011432213,0.03316342,0.00025762187,0.00019850637,0.00012193893,0.0002429856,0.000062331055,0.018047407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992238,0.00030199075,0.000026913649,0.00011912233,0.00020125766,0.00012678365],"domain_scores_gemma":[0.99815863,0.00071166956,0.00035914328,0.000105522304,0.00034263876,0.00032236992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015899318,0.0006619983,0.0008354512,0.0017374147,0.0012724088,0.0036204176,0.0014264529,0.0009664513,0.0035108197],"category_scores_gemma":[0.0043247314,0.00046575486,0.0006419852,0.00092651276,0.0028551342,0.0037746604,0.0019204317,0.0020321964,0.00027821338],"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.000010643627,0.000009499567,0.00007589075,0.000009959771,0.0000029410046,0.00001107536,0.000030127147,0.0034232815,0.00015552226,0.99500567,0.0003633437,0.0009020527],"study_design_scores_gemma":[0.00001367641,0.000016455511,0.00019229592,0.000009498649,0.000004823165,0.000028603397,0.000069826456,0.036598753,0.00027649762,0.96171135,0.0010714348,0.0000068100285],"about_ca_topic_score_codex":0.0018460627,"about_ca_topic_score_gemma":0.0013578695,"teacher_disagreement_score":0.0036204176,"about_ca_system_score_codex":0.00245162,"about_ca_system_score_gemma":0.0013499594,"threshold_uncertainty_score":0.017787814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017094124,0.00084851694,0.9276854,0.0012296187,0.00029836665,0.00018786924,0.00075461826,0.00018015987,0.051721405],"genre_scores_gemma":[0.5720803,0.004136856,0.36709678,0.0012186599,0.000988147,0.001523729,0.0024055622,0.0010903254,0.0494595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981668,0.0005582462,0.000110663284,0.00026748775,0.00059974357,0.00029705773],"domain_scores_gemma":[0.9908896,0.0061956765,0.00063666765,0.0002827995,0.0016249655,0.00037020532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038102835,0.0025317543,0.0017646645,0.0024007221,0.0012590734,0.0045840335,0.0017555701,0.0022282838,0.013489046],"category_scores_gemma":[0.011548935,0.0013710904,0.0015850858,0.0018483346,0.0029922428,0.0053084376,0.0019321404,0.007761954,0.0020480743],"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.00004680292,0.00010933373,0.00013822594,0.00023326553,0.00002064206,0.00011454317,0.00023349319,0.057913348,0.0020742565,0.92510074,0.0043901247,0.009625213],"study_design_scores_gemma":[0.000035178215,0.00007441805,0.00021912578,0.00012298116,0.000020847554,0.00009686996,0.0001130139,0.31528082,0.002108454,0.6760441,0.005840315,0.000043889984],"about_ca_topic_score_codex":0.003477462,"about_ca_topic_score_gemma":0.0041834894,"teacher_disagreement_score":0.013489046,"about_ca_system_score_codex":0.0026041833,"about_ca_system_score_gemma":0.0043320837,"threshold_uncertainty_score":0.045125306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017265245,0.00054273434,0.96880305,0.00072184135,0.00021817282,0.00007792921,0.00016360784,0.00074821996,0.011459119],"genre_scores_gemma":[0.33692762,0.00049935357,0.6500163,0.0008193675,0.00028843922,0.00046734445,0.0004907317,0.000989841,0.009500987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99172604,0.003094672,0.00040904732,0.0012249094,0.002875674,0.0006696816],"domain_scores_gemma":[0.97393,0.019645149,0.0011490049,0.0035607975,0.0011496911,0.0005653537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007278307,0.002380196,0.0024685522,0.0019672606,0.001451274,0.00448824,0.0047669034,0.0025552756,0.010304735],"category_scores_gemma":[0.048084363,0.0027800566,0.002589235,0.0023373754,0.0037865709,0.009757062,0.011823562,0.008473829,0.0021648637],"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.00048926927,0.00021045016,0.00071927387,0.0005108484,0.00014422182,0.00011977726,0.00030392458,0.26396137,0.0025748685,0.6406272,0.007489836,0.08284894],"study_design_scores_gemma":[0.00003275399,0.000050600003,0.00005996574,0.000063060106,0.00002468897,0.000038670998,0.0000293068,0.43041605,0.0013419149,0.5654716,0.002456302,0.0000150913],"about_ca_topic_score_codex":0.0008641824,"about_ca_topic_score_gemma":0.0012685976,"teacher_disagreement_score":0.010304735,"about_ca_system_score_codex":0.0017251676,"about_ca_system_score_gemma":0.0015315309,"threshold_uncertainty_score":0.038491845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38222733,0.004556245,0.5080875,0.01076456,0.00038556996,0.000137982,0.0008131407,0.00032613604,0.092701435],"genre_scores_gemma":[0.90683085,0.0020988,0.07007428,0.0008980184,0.0006171519,0.00020993172,0.000538155,0.00014142446,0.018591348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989422,0.0003616281,0.000046952715,0.00025399058,0.00026584117,0.00012948233],"domain_scores_gemma":[0.99324846,0.0051565547,0.00051466795,0.00041068997,0.00029813097,0.0003714474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012836691,0.0008540835,0.0011637748,0.0020662537,0.0022209964,0.00509172,0.0016310021,0.001401641,0.0069922414],"category_scores_gemma":[0.006926082,0.00083967636,0.0010877029,0.0024036465,0.0052932263,0.010835669,0.0023927176,0.0036118373,0.00049449527],"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.000014680593,0.000008856473,0.00012019885,0.000024577279,0.00000410529,0.0000148306135,0.00009447229,0.001250119,0.00013433227,0.9958662,0.00058962463,0.0018779925],"study_design_scores_gemma":[0.0000039500073,0.0000023258885,0.000040468756,0.0000047973513,0.000003031402,0.000010273494,0.00003428648,0.0025262686,0.00006305371,0.9966815,0.00062742573,0.0000026123923],"about_ca_topic_score_codex":0.0014319371,"about_ca_topic_score_gemma":0.0018872388,"teacher_disagreement_score":0.0069922414,"about_ca_system_score_codex":0.00199703,"about_ca_system_score_gemma":0.0010421243,"threshold_uncertainty_score":0.023391426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002446406,0.00010286463,0.99561584,0.000085379164,0.000089536086,0.00005068462,0.00007600191,0.0009261004,0.0006072658],"genre_scores_gemma":[0.024196478,0.000070656555,0.9729873,0.00012250869,0.00006430586,0.00015566954,0.00043215076,0.00027366437,0.0016972758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998771,0.0003660323,0.000069495145,0.00020406737,0.0004929037,0.00009645069],"domain_scores_gemma":[0.9978067,0.000796723,0.000086723434,0.00030544557,0.0009109185,0.00009346567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011596014,0.0013974,0.00162508,0.0014646518,0.0010075124,0.0011973989,0.0023563437,0.0014822658,0.0066803824],"category_scores_gemma":[0.0042822566,0.00075826055,0.0011211177,0.0022480781,0.00057506183,0.0013053338,0.0016525398,0.0019461911,0.003642429],"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.00041767547,0.0002183435,0.00056996994,0.0002733566,0.00013238478,0.00013674302,0.00015188794,0.23885815,0.018860107,0.014912972,0.021306999,0.70416147],"study_design_scores_gemma":[0.00005099477,0.00005515674,0.00017217253,0.000008438884,0.00002013929,0.00008388034,0.000017319924,0.9870062,0.004079745,0.0054138014,0.0030675498,0.000024566858],"about_ca_topic_score_codex":0.0041980976,"about_ca_topic_score_gemma":0.006472728,"teacher_disagreement_score":0.0066803824,"about_ca_system_score_codex":0.0005814551,"about_ca_system_score_gemma":0.0018345201,"threshold_uncertainty_score":0.022348046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04377506,0.000997311,0.505238,0.0032258593,0.001987182,0.00007601805,0.0003091232,0.0006934832,0.44369808],"genre_scores_gemma":[0.6013859,0.0014637421,0.106174506,0.0014544933,0.0010878869,0.00017659385,0.0004941765,0.0013113739,0.28645125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947864,0.00012620646,0.00002621457,0.000113100534,0.00018691656,0.00006895404],"domain_scores_gemma":[0.99970275,0.00006140421,0.000029245666,0.00008579261,0.000086534375,0.000034322722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004127818,0.00094912713,0.0009016164,0.0016454997,0.0017631425,0.00286725,0.0007836893,0.0011242684,0.026553836],"category_scores_gemma":[0.0016691533,0.00034671853,0.0007564361,0.0012542349,0.0028435776,0.004317803,0.0027446905,0.0027416472,0.006398747],"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.0000056664903,0.0000046468544,0.00001935006,0.000010128584,0.0000024281676,0.000024654026,0.00004221004,0.00052742026,0.0003562894,0.98980576,0.0015742948,0.007627166],"study_design_scores_gemma":[0.0000043822806,0.000010881619,0.000047092395,0.000011361677,0.0000040575374,0.000116812516,0.000040673764,0.0042287474,0.0013049623,0.9741529,0.020068597,0.000009495653],"about_ca_topic_score_codex":0.00039208776,"about_ca_topic_score_gemma":0.00040071973,"teacher_disagreement_score":0.026553836,"about_ca_system_score_codex":0.0011787001,"about_ca_system_score_gemma":0.0006781714,"threshold_uncertainty_score":0.088831425},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065012075,0.0055861883,0.8665271,0.008335351,0.0006292006,0.00016734679,0.00059068645,0.00023335971,0.052918673],"genre_scores_gemma":[0.65333194,0.017296005,0.2721326,0.0032483537,0.005553307,0.00084586657,0.0017093592,0.00067578454,0.04520675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962903,0.0018864445,0.00014923088,0.00070173177,0.00060867245,0.00036351525],"domain_scores_gemma":[0.9751857,0.019694988,0.0015628164,0.0017166868,0.00086305116,0.0009767953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057585347,0.0029679323,0.002783915,0.0027989752,0.0017422016,0.0040212804,0.0039498974,0.003292363,0.007942487],"category_scores_gemma":[0.030558195,0.0014850985,0.0035194329,0.0046550636,0.003798649,0.013147416,0.0046866913,0.008297835,0.0006903984],"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.00007376295,0.00013574655,0.00062418764,0.00025005048,0.00006618845,0.00010935186,0.00022086456,0.13472512,0.0004030266,0.83925307,0.0072748894,0.016863666],"study_design_scores_gemma":[0.000017026381,0.000016289272,0.00015163526,0.000037337293,0.000022342261,0.00003887477,0.000038154983,0.13819559,0.0000852224,0.8585446,0.0028411138,0.000011945238],"about_ca_topic_score_codex":0.0035370085,"about_ca_topic_score_gemma":0.003478171,"teacher_disagreement_score":0.007942487,"about_ca_system_score_codex":0.0039805057,"about_ca_system_score_gemma":0.0015931731,"threshold_uncertainty_score":0.030454457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007664285,0.00013722037,0.98881114,0.00018867478,0.00003169551,0.000038040853,0.00009394071,0.000071341296,0.002963563],"genre_scores_gemma":[0.88296276,0.00058457436,0.106079094,0.00013138112,0.0000687711,0.00025390586,0.00018935505,0.00010201037,0.009628237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858344,0.00054394157,0.00005394767,0.00037429074,0.0002675785,0.00017687782],"domain_scores_gemma":[0.9970182,0.0018592754,0.00046218745,0.00015110748,0.00038649148,0.0001226372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028887664,0.0020791474,0.001897375,0.0009896052,0.0005023817,0.002272945,0.0025451595,0.0023889258,0.0043479726],"category_scores_gemma":[0.008130421,0.0014873155,0.0010872409,0.0012387501,0.0017279274,0.002686885,0.00212053,0.0016292451,0.00051054254],"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.000030893338,0.000008576136,0.000052200794,0.000042373224,0.000016075684,0.000021918902,0.000010948738,0.98799884,0.00027681506,0.0089685945,0.00015634176,0.00241632],"study_design_scores_gemma":[0.0000060281386,0.000018279305,0.000020176154,0.0000045321276,0.0000060069515,0.000006160643,0.0000053811004,0.99293584,0.00017001753,0.0066554653,0.00016715257,0.0000049211453],"about_ca_topic_score_codex":0.0037018217,"about_ca_topic_score_gemma":0.0023625125,"teacher_disagreement_score":0.0043479726,"about_ca_system_score_codex":0.0020518173,"about_ca_system_score_gemma":0.0013879318,"threshold_uncertainty_score":0.015277445},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047527444,0.0024218159,0.91557163,0.0034478125,0.0002560804,0.00015299735,0.001142149,0.00025706922,0.02922296],"genre_scores_gemma":[0.6418968,0.003872988,0.31115726,0.0010101829,0.0006146475,0.0005513202,0.0015416925,0.0003047532,0.039050397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981502,0.0010294386,0.00006640006,0.00030945745,0.00026108781,0.00018345416],"domain_scores_gemma":[0.9954022,0.003466768,0.0002960483,0.00022746983,0.0002626026,0.0003449189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034551208,0.0016007227,0.0026581807,0.00097608205,0.00080076046,0.0038327056,0.0024144573,0.0025128387,0.007903806],"category_scores_gemma":[0.009718196,0.0014144132,0.0012675335,0.0024606616,0.0017922216,0.0044669355,0.0019026336,0.0031876008,0.0007335547],"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.00032437954,0.00033202698,0.00080695224,0.0006608645,0.00018459819,0.00036578707,0.0002161289,0.49604237,0.0009202295,0.40950343,0.017979661,0.07266358],"study_design_scores_gemma":[0.00008921249,0.0001015494,0.00019823469,0.00006474453,0.000041872434,0.00017773829,0.00008124719,0.60347056,0.00035390267,0.3900349,0.0053536943,0.00003227952],"about_ca_topic_score_codex":0.0031215972,"about_ca_topic_score_gemma":0.0027648178,"teacher_disagreement_score":0.007903806,"about_ca_system_score_codex":0.0019843567,"about_ca_system_score_gemma":0.0032024984,"threshold_uncertainty_score":0.026440918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022809673,0.00008636435,0.9941454,0.00003644415,0.000034241595,0.000019188681,0.000024599076,0.00008696024,0.003285755],"genre_scores_gemma":[0.07300686,0.00024942614,0.9217151,0.000052526746,0.000040037638,0.00015919823,0.000106583204,0.00031701903,0.0043533207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914324,0.00032076967,0.000034749333,0.00009005542,0.0003445004,0.000066654145],"domain_scores_gemma":[0.99919695,0.0004070074,0.000053590058,0.00011894181,0.00016369588,0.000059854086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017200068,0.0012279798,0.0016325876,0.0015688714,0.0005615874,0.0026266638,0.0013504789,0.0011504221,0.006913149],"category_scores_gemma":[0.0039405376,0.001068117,0.0012889385,0.0014278126,0.0010082278,0.0016804561,0.0026641137,0.0033591636,0.0014338149],"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.00019107985,0.00018220904,0.00043346596,0.00033705716,0.00008751244,0.00006264075,0.00013857013,0.41242033,0.0053138593,0.3848212,0.005584113,0.19042797],"study_design_scores_gemma":[0.000019173965,0.00003197525,0.000045584373,0.000029604415,0.00001589073,0.000042395895,0.000017848493,0.9188632,0.0015618816,0.07564271,0.0037204302,0.000009439544],"about_ca_topic_score_codex":0.0010966993,"about_ca_topic_score_gemma":0.0011003615,"teacher_disagreement_score":0.006913149,"about_ca_system_score_codex":0.00083210086,"about_ca_system_score_gemma":0.0010124153,"threshold_uncertainty_score":0.023126781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39133668,0.0028516161,0.58269364,0.00093571935,0.00008320631,0.00009922846,0.00067017326,0.00015997709,0.021169744],"genre_scores_gemma":[0.9302982,0.0016282634,0.062882684,0.00019723317,0.00021350328,0.00013541851,0.00046430607,0.00010621054,0.0040741954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998689,0.00031423863,0.00010040902,0.0003481381,0.0004143439,0.00013402745],"domain_scores_gemma":[0.99056995,0.005730989,0.0013036374,0.0009482912,0.0006307301,0.000816417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026135498,0.0007517257,0.0012542749,0.0021844287,0.0007261172,0.003907419,0.0010517937,0.00089901296,0.0021120543],"category_scores_gemma":[0.016287137,0.0009157451,0.00085543306,0.0013795294,0.0036256863,0.0054456713,0.002494939,0.002920638,0.00024241352],"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.00012852122,0.000047120968,0.0032969057,0.00020161364,0.000051969924,0.00021304823,0.00059358735,0.01669814,0.005282878,0.94849443,0.00090054714,0.024091257],"study_design_scores_gemma":[0.0000181624,0.00007617469,0.0032080228,0.00007252465,0.000030519706,0.00036626743,0.00034664673,0.059348777,0.0025212858,0.93080187,0.0031760822,0.000033661352],"about_ca_topic_score_codex":0.00037474593,"about_ca_topic_score_gemma":0.00030743663,"teacher_disagreement_score":0.003907419,"about_ca_system_score_codex":0.00078513264,"about_ca_system_score_gemma":0.00032991424,"threshold_uncertainty_score":0.0138219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006868956,0.0013709741,0.9920249,0.00081961515,0.00017320005,0.00002382549,0.0001216579,0.00016122694,0.004617688],"genre_scores_gemma":[0.08369111,0.005904313,0.88471806,0.00079315505,0.0011946791,0.00063597894,0.0006964881,0.0013701523,0.020996084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985831,0.0007113773,0.000065675544,0.00015458332,0.0004357016,0.000049607796],"domain_scores_gemma":[0.99540234,0.0033479189,0.00022845904,0.00039013068,0.0004860439,0.0001451677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027579842,0.0027143129,0.0022501627,0.0018336471,0.0007311472,0.003460446,0.0022072145,0.0030140108,0.008307155],"category_scores_gemma":[0.014198779,0.0011903101,0.0013760299,0.0025043574,0.002937008,0.0035099403,0.0036984591,0.008664736,0.0029801328],"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.000039180304,0.000066411914,0.0001602454,0.00046598926,0.0000970362,0.00006662831,0.00011260605,0.08547754,0.0011799071,0.8376333,0.01703134,0.05766989],"study_design_scores_gemma":[0.000016492426,0.000011296757,0.0000541193,0.000059036192,0.000016967095,0.000029704888,0.000017869284,0.44577786,0.00041047222,0.54445344,0.009138705,0.000014051347],"about_ca_topic_score_codex":0.0023980162,"about_ca_topic_score_gemma":0.0027193697,"teacher_disagreement_score":0.008307155,"about_ca_system_score_codex":0.001562975,"about_ca_system_score_gemma":0.0014902061,"threshold_uncertainty_score":0.027790189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1770768,0.0048657283,0.65516204,0.014964165,0.0008103679,0.00031634627,0.001170281,0.00035462636,0.14527972],"genre_scores_gemma":[0.6979243,0.006732912,0.24970888,0.0037489028,0.001789363,0.0007959595,0.002107867,0.00089523033,0.0362965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726415,0.0013813985,0.00012225505,0.0003789935,0.00048989453,0.00036336112],"domain_scores_gemma":[0.9805015,0.015598129,0.001098686,0.00096934394,0.00077652966,0.0010557056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005728962,0.0016724373,0.0022357118,0.0018880437,0.0018294088,0.0055092033,0.004051418,0.002793965,0.018057156],"category_scores_gemma":[0.030295914,0.0014452477,0.0018242673,0.0034414402,0.0047444184,0.0144217685,0.0055319555,0.009832906,0.0012660747],"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.00017908264,0.00017371525,0.00046265963,0.0002373865,0.000031224896,0.000055880446,0.00041662029,0.03325034,0.000464872,0.93764937,0.007031484,0.020047413],"study_design_scores_gemma":[0.000052687505,0.000053345746,0.00031110705,0.00006674676,0.000020149002,0.00004296855,0.0001696932,0.0923631,0.00016967233,0.9038903,0.002839249,0.000020926045],"about_ca_topic_score_codex":0.004179925,"about_ca_topic_score_gemma":0.0043195416,"teacher_disagreement_score":0.018057156,"about_ca_system_score_codex":0.003142107,"about_ca_system_score_gemma":0.0022212458,"threshold_uncertainty_score":0.06040722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035405063,0.00034158854,0.99720734,0.00017686178,0.00012692626,0.000027215056,0.00005236762,0.00009645972,0.0016170294],"genre_scores_gemma":[0.027470153,0.0018992446,0.9496026,0.0005458233,0.0004888845,0.00051617663,0.00038062784,0.0007467424,0.018349737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848324,0.00070217694,0.000073275114,0.00016555942,0.00049840857,0.00007737136],"domain_scores_gemma":[0.9973168,0.0015265128,0.00017295124,0.00032340497,0.00049048086,0.00016980174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031377787,0.0028462533,0.0017903475,0.0017703208,0.0007076579,0.0019298466,0.002805631,0.0028464345,0.005861186],"category_scores_gemma":[0.0082468,0.0011694707,0.002636102,0.001812689,0.0020718588,0.0021590055,0.0033970417,0.0064367875,0.0030356827],"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.00014344792,0.00017640089,0.00034655505,0.00076288846,0.00019041006,0.00012596516,0.00019812245,0.2760501,0.0067463596,0.49732828,0.026739992,0.19119148],"study_design_scores_gemma":[0.000014516457,0.000048547703,0.00006107316,0.000046413956,0.000017790107,0.00005858635,0.000015539004,0.9311756,0.0011628021,0.054055694,0.013318009,0.000025516858],"about_ca_topic_score_codex":0.0024614797,"about_ca_topic_score_gemma":0.0040795095,"teacher_disagreement_score":0.005861186,"about_ca_system_score_codex":0.0010554468,"about_ca_system_score_gemma":0.002055346,"threshold_uncertainty_score":0.019607663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34900644,0.00037439566,0.5830076,0.0029057837,0.00008376042,0.0001863513,0.00022860934,0.00014065663,0.06406647],"genre_scores_gemma":[0.95830226,0.00022675405,0.024704337,0.00013177244,0.000031275427,0.00014227034,0.000054956396,0.0000252345,0.016381083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978695,0.0012363322,0.000061117666,0.00020736185,0.0002933155,0.00033233647],"domain_scores_gemma":[0.9967759,0.0023773015,0.00031112504,0.000077044395,0.00019158793,0.0002670921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029947218,0.0007471535,0.0014810953,0.00071137334,0.0010502418,0.004291738,0.0016728155,0.0023728635,0.00594556],"category_scores_gemma":[0.009209919,0.0005372436,0.0005935455,0.0008018249,0.0027392036,0.0044025304,0.0024077662,0.0017625901,0.00046591426],"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.00028655134,0.00012549783,0.0007781643,0.00009296068,0.00004963883,0.0001845295,0.00032569558,0.110813834,0.0009188305,0.8785158,0.0011495551,0.0067589884],"study_design_scores_gemma":[0.000111183865,0.00007295476,0.00028367378,0.000021121446,0.000025560608,0.000067763016,0.00021954978,0.3965234,0.0004842077,0.6009039,0.0012547624,0.000031953776],"about_ca_topic_score_codex":0.0033924745,"about_ca_topic_score_gemma":0.0022604621,"teacher_disagreement_score":0.00594556,"about_ca_system_score_codex":0.0021380526,"about_ca_system_score_gemma":0.0022128494,"threshold_uncertainty_score":0.019889891},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38758975,0.003977837,0.4865496,0.021786176,0.0007299687,0.00029402802,0.0029833692,0.00056088495,0.09552835],"genre_scores_gemma":[0.915717,0.0021486536,0.0591791,0.0010645014,0.0018934119,0.0003642524,0.0018526678,0.00030431207,0.017476087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953447,0.0013609036,0.00023091042,0.0010912394,0.0010323295,0.00093990006],"domain_scores_gemma":[0.97779727,0.016797302,0.001665107,0.0018951991,0.000958706,0.0008863783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030728488,0.0014470132,0.002539945,0.0016824212,0.0025748168,0.00982689,0.0034347188,0.003900534,0.010795969],"category_scores_gemma":[0.02088372,0.0011965083,0.00226542,0.0034561583,0.004321328,0.01609693,0.0040898793,0.009394911,0.00120628],"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.00034519084,0.00041651627,0.0011277198,0.0004289186,0.00007934348,0.00029263407,0.00043727297,0.023607517,0.0008881494,0.94166946,0.014443895,0.016263388],"study_design_scores_gemma":[0.000045649038,0.000011751446,0.00014462476,0.000013867257,0.000017457667,0.00010959619,0.000094101946,0.039507806,0.00031250124,0.9584035,0.001324351,0.000014784809],"about_ca_topic_score_codex":0.0019496963,"about_ca_topic_score_gemma":0.001770475,"teacher_disagreement_score":0.010795969,"about_ca_system_score_codex":0.0029993453,"about_ca_system_score_gemma":0.0025293687,"threshold_uncertainty_score":0.036116183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011178739,0.00062370714,0.9723504,0.00073201326,0.0001470618,0.00005293407,0.000328942,0.0002845918,0.01430154],"genre_scores_gemma":[0.39107922,0.0020628413,0.5655823,0.0010220467,0.00075912365,0.00064938597,0.0023343763,0.001570041,0.03494075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953576,0.0018354021,0.00019501221,0.0008602094,0.0013715453,0.00038015237],"domain_scores_gemma":[0.9861135,0.010151872,0.0007060953,0.0015843712,0.0008570855,0.0005869958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005526525,0.0025031525,0.0030263686,0.0019606387,0.0012292619,0.005285376,0.004572221,0.002573688,0.012569552],"category_scores_gemma":[0.028517006,0.0016854265,0.0023740907,0.00306011,0.0040600915,0.009321424,0.0063947616,0.012017746,0.0019352022],"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.00021344237,0.00009904008,0.00021815984,0.00020972743,0.00004725954,0.00004144981,0.00014293687,0.060579553,0.00070204854,0.90207314,0.005092607,0.030580724],"study_design_scores_gemma":[0.000019157473,0.000024123154,0.000071053175,0.000032447693,0.000013875635,0.000026643136,0.000016008391,0.111690074,0.000385253,0.88601947,0.001691254,0.000010710425],"about_ca_topic_score_codex":0.0018437138,"about_ca_topic_score_gemma":0.0019400562,"teacher_disagreement_score":0.012569552,"about_ca_system_score_codex":0.0028936367,"about_ca_system_score_gemma":0.0016478922,"threshold_uncertainty_score":0.04204935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001480859,0.00019301382,0.9949222,0.00016671632,0.00007443432,0.000032284406,0.000043825297,0.00006297856,0.003023595],"genre_scores_gemma":[0.12027939,0.00070586085,0.86728835,0.00040755278,0.00022293576,0.0004197641,0.00028016488,0.00028180593,0.010114178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971086,0.000101075435,0.000010845563,0.00003718843,0.000114084665,0.000025909101],"domain_scores_gemma":[0.9992119,0.00046973344,0.00003681539,0.00003914761,0.0001881829,0.000054199772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567881,0.0009260689,0.0012668481,0.0006241198,0.00048566944,0.0011394531,0.0013276626,0.0018512091,0.007971744],"category_scores_gemma":[0.0022562118,0.00054189045,0.00074767554,0.0009352468,0.00078445993,0.0010954886,0.0016798915,0.002048513,0.00084464275],"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.00016350271,0.00010544906,0.00023470052,0.00034867105,0.00006301174,0.00013109652,0.000080865335,0.7698966,0.0041638254,0.10092568,0.010638193,0.11324833],"study_design_scores_gemma":[0.000008760125,0.000012608685,0.000014869263,0.000008983983,0.0000040414243,0.000009471646,0.0000045891957,0.99283653,0.00015259093,0.005986508,0.0009578782,0.0000031562413],"about_ca_topic_score_codex":0.0031912054,"about_ca_topic_score_gemma":0.0037964822,"teacher_disagreement_score":0.007971744,"about_ca_system_score_codex":0.000692546,"about_ca_system_score_gemma":0.0016610397,"threshold_uncertainty_score":0.026668131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012959414,0.0006141911,0.9754519,0.0012382172,0.00018265822,0.00013644648,0.00037096548,0.00016952143,0.008876767],"genre_scores_gemma":[0.4677127,0.0024010607,0.50411814,0.0009895246,0.0008938903,0.0013828757,0.0015864185,0.0012029203,0.019712472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730116,0.0012485972,0.0001924417,0.00039393568,0.0005750187,0.00028884926],"domain_scores_gemma":[0.98796785,0.008518056,0.00066619035,0.0005995228,0.0016760415,0.00057235785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005314647,0.0030783375,0.002569642,0.002151468,0.0012012927,0.0029866432,0.0029253366,0.0038728572,0.009228438],"category_scores_gemma":[0.028287888,0.0019810314,0.0019779368,0.0012954033,0.0035205267,0.005572144,0.0044573867,0.007983258,0.0010453421],"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.00020968808,0.00022145236,0.0005723133,0.000613095,0.00006926857,0.00028993512,0.00029100772,0.13947019,0.005481736,0.81981087,0.0072229463,0.025747469],"study_design_scores_gemma":[0.000045459503,0.00006682299,0.0004013322,0.000111105546,0.000030402416,0.00009216218,0.00007843664,0.5579386,0.0019775855,0.43633372,0.0028856567,0.000038741517],"about_ca_topic_score_codex":0.0024394512,"about_ca_topic_score_gemma":0.0030642136,"teacher_disagreement_score":0.009228438,"about_ca_system_score_codex":0.0021030046,"about_ca_system_score_gemma":0.0031535535,"threshold_uncertainty_score":0.030872226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047762776,0.00026801805,0.9930478,0.0001577058,0.000041875322,0.000057965062,0.00006287147,0.000056598008,0.0015309624],"genre_scores_gemma":[0.4824359,0.0009435961,0.50351584,0.00022498,0.00016244264,0.0007930833,0.00046053846,0.00012891082,0.011334617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483114,0.0029689192,0.0003098131,0.0006655462,0.0008283118,0.00039642636],"domain_scores_gemma":[0.98520595,0.012295212,0.00056650036,0.0005085428,0.001098132,0.00032564093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010701368,0.0015749421,0.0032409145,0.00093554985,0.0005852504,0.0032106296,0.0026885786,0.0028138743,0.0051553342],"category_scores_gemma":[0.020788565,0.001666403,0.0023001924,0.0011374294,0.0014673476,0.0033589753,0.0019059915,0.004743412,0.00086459506],"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.0001312627,0.00013419468,0.0005779399,0.00017334608,0.00011594215,0.000108914865,0.000096887336,0.82000446,0.0008592158,0.14747348,0.0011504367,0.029173912],"study_design_scores_gemma":[0.00001707425,0.000032180586,0.00006254125,0.000015874402,0.00001852484,0.000013172282,0.0000040400064,0.9629531,0.0002903244,0.03613892,0.00044068744,0.00001359992],"about_ca_topic_score_codex":0.0033125815,"about_ca_topic_score_gemma":0.0037079395,"teacher_disagreement_score":0.010701368,"about_ca_system_score_codex":0.0017994787,"about_ca_system_score_gemma":0.0019930948,"threshold_uncertainty_score":0.056594968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010891015,0.00030986284,0.98455393,0.00024999728,0.00008688425,0.00007571301,0.000071177776,0.000076201824,0.0036854034],"genre_scores_gemma":[0.5426312,0.00073017704,0.44707078,0.00027196266,0.0001398588,0.0005952409,0.00032238697,0.000109022854,0.00812934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721104,0.0014317493,0.00015902349,0.0002668158,0.00072434393,0.00020705968],"domain_scores_gemma":[0.99318475,0.005175057,0.00050709513,0.00023442264,0.00069896027,0.00019965954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057186717,0.001092215,0.0018833069,0.00092477404,0.0005036065,0.0028187728,0.0018766936,0.0014721202,0.00402793],"category_scores_gemma":[0.015692597,0.0009895707,0.00094124646,0.0010859143,0.0010783749,0.0020606627,0.0015025102,0.0027883349,0.00074824184],"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.00012220371,0.00013926161,0.0005523273,0.00014628477,0.00006692539,0.00006226115,0.0000570268,0.83933663,0.0009576893,0.11131629,0.00150754,0.045735545],"study_design_scores_gemma":[0.000014114384,0.000018226567,0.000044782373,0.00001534377,0.000008014173,0.000007693783,0.0000035905987,0.9685826,0.00022812179,0.030726597,0.00034531014,0.000005613843],"about_ca_topic_score_codex":0.0021976745,"about_ca_topic_score_gemma":0.0023044662,"teacher_disagreement_score":0.0057186717,"about_ca_system_score_codex":0.0010449671,"about_ca_system_score_gemma":0.001170098,"threshold_uncertainty_score":0.030243635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040289972,0.00062142214,0.9483612,0.00077884976,0.00008990204,0.00006541098,0.00023724847,0.00009191708,0.009463897],"genre_scores_gemma":[0.5030691,0.0010363902,0.47377557,0.00037825722,0.00036825694,0.00024920815,0.0006023024,0.00027743983,0.020243533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985297,0.00071529194,0.00005248214,0.00027213243,0.0002770444,0.00015336306],"domain_scores_gemma":[0.99639255,0.0026187866,0.00031353967,0.00029500402,0.000193227,0.0001868806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002415467,0.0010276169,0.0018635057,0.00096798525,0.00062399847,0.0023885418,0.00177333,0.0019151998,0.0034790637],"category_scores_gemma":[0.007521423,0.00085945154,0.0014400828,0.0018639722,0.0016684828,0.004329454,0.0022710855,0.0034572068,0.0005069156],"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.00011327222,0.00018327565,0.0006483916,0.00029977877,0.00008731339,0.00019491829,0.00010195029,0.5633056,0.002382854,0.3992827,0.0038833236,0.029516675],"study_design_scores_gemma":[0.000018799881,0.000035245575,0.00014846119,0.00002313016,0.00001943856,0.000070326205,0.000027631424,0.80375904,0.00067624054,0.19361006,0.0015966371,0.000014961167],"about_ca_topic_score_codex":0.001761894,"about_ca_topic_score_gemma":0.0030292128,"teacher_disagreement_score":0.0034790637,"about_ca_system_score_codex":0.0018041896,"about_ca_system_score_gemma":0.0011207771,"threshold_uncertainty_score":0.013090372},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029826157,0.00086833443,0.96197903,0.00083221257,0.00012386049,0.00019107529,0.0004971563,0.00037063652,0.0053115664],"genre_scores_gemma":[0.27310705,0.0014474326,0.7116827,0.00051090686,0.00040844703,0.000558512,0.001740954,0.0008587392,0.009685235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978249,0.0007184389,0.00010730158,0.0005763635,0.00053457636,0.00023847343],"domain_scores_gemma":[0.99079317,0.0068639293,0.0005166964,0.0008838985,0.000572014,0.0003701991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023126912,0.002160592,0.003034191,0.001559348,0.00092560495,0.0030663393,0.0053331894,0.0030574882,0.008713106],"category_scores_gemma":[0.016860968,0.0015535532,0.0019853096,0.004517989,0.0014122684,0.007029104,0.0035606287,0.0046568424,0.0011783391],"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.00026654598,0.00041641697,0.0008669155,0.0007869119,0.00012954375,0.0001565957,0.00024620787,0.75868815,0.0017557852,0.09075318,0.012650198,0.1332835],"study_design_scores_gemma":[0.00002662738,0.000035190402,0.00011031355,0.000031961175,0.00003018921,0.000052143525,0.000049338938,0.8884052,0.00038962442,0.1094233,0.0014368108,0.000009252308],"about_ca_topic_score_codex":0.0043529295,"about_ca_topic_score_gemma":0.005209546,"teacher_disagreement_score":0.008713106,"about_ca_system_score_codex":0.002225262,"about_ca_system_score_gemma":0.0019650785,"threshold_uncertainty_score":0.029148221},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015473946,0.0030105456,0.89990187,0.002609768,0.00021324909,0.00027604934,0.0005412789,0.0010398686,0.07693349],"genre_scores_gemma":[0.47204235,0.003638488,0.4994244,0.0021079243,0.00091209123,0.0012338993,0.0013487278,0.0012108826,0.018081125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931537,0.0020141206,0.00023228185,0.0011753282,0.0021532185,0.0012713346],"domain_scores_gemma":[0.9818818,0.012935832,0.0008790679,0.0021292118,0.001528832,0.000645376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071098907,0.0025617906,0.0018652634,0.002870106,0.0020575027,0.005261029,0.006205357,0.0029973085,0.016437842],"category_scores_gemma":[0.030320002,0.0010020178,0.0026921378,0.0043528285,0.003278706,0.009907246,0.005199789,0.0071570766,0.0026808812],"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.00021489858,0.000119052806,0.0006009234,0.0003891366,0.0000676033,0.0000989714,0.00019986977,0.11764123,0.001710251,0.8240385,0.01342476,0.041494746],"study_design_scores_gemma":[0.000044057277,0.00008457347,0.00038518303,0.000088757166,0.00006857184,0.00016789058,0.00005476813,0.4895849,0.0014402494,0.4918856,0.016163375,0.00003217292],"about_ca_topic_score_codex":0.004367349,"about_ca_topic_score_gemma":0.0041450406,"teacher_disagreement_score":0.016437842,"about_ca_system_score_codex":0.006711905,"about_ca_system_score_gemma":0.0031151252,"threshold_uncertainty_score":0.054989994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082967795,0.00018752912,0.89258534,0.0007702065,0.00010492989,0.000087666434,0.000065007465,0.0002479474,0.022983555],"genre_scores_gemma":[0.91027725,0.00035012554,0.06445838,0.0003112653,0.00010849911,0.0003974903,0.000102427024,0.00017589408,0.02381871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778265,0.0012776281,0.00006000261,0.00028718397,0.00025519024,0.0003375065],"domain_scores_gemma":[0.99055195,0.0071380115,0.00074135995,0.0004977151,0.00058508554,0.00048586828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033594174,0.0012489966,0.0016048355,0.0009860336,0.001253634,0.0032891035,0.0027072835,0.0019169918,0.007488529],"category_scores_gemma":[0.016734116,0.0009912541,0.00081694743,0.0010777279,0.0027154207,0.0031583644,0.0023449734,0.0025561738,0.001143014],"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.00020610905,0.00011527056,0.00033656214,0.00007732525,0.000036590776,0.000075576594,0.00019683276,0.24755116,0.0022223548,0.7386039,0.0021742845,0.0084040575],"study_design_scores_gemma":[0.00006907112,0.00003494347,0.000042172345,0.0000135616,0.000018599461,0.000014632922,0.00006262113,0.6529042,0.0004977719,0.3452893,0.0010431716,0.000009989679],"about_ca_topic_score_codex":0.0023112856,"about_ca_topic_score_gemma":0.0025084144,"teacher_disagreement_score":0.007488529,"about_ca_system_score_codex":0.002192946,"about_ca_system_score_gemma":0.001987045,"threshold_uncertainty_score":0.025051594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0806046,0.0025250183,0.41501996,0.008898988,0.0016074348,0.00012528633,0.0013537277,0.00053472765,0.48933035],"genre_scores_gemma":[0.77413034,0.004563248,0.07047098,0.006008275,0.0029340596,0.00051519944,0.0020089762,0.0010047606,0.13836424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990785,0.00016275719,0.000039195314,0.00032399414,0.00023683629,0.00015866096],"domain_scores_gemma":[0.9980556,0.0009204155,0.00017935518,0.00039943273,0.00027294699,0.00017230975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053133036,0.00088477193,0.0014691848,0.0013401436,0.0019694187,0.0035925491,0.0010652661,0.0019474224,0.020338576],"category_scores_gemma":[0.004860973,0.00079239975,0.0010722725,0.0019508231,0.002570989,0.0074508227,0.0029888449,0.005510235,0.004162386],"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.000014637221,0.000013726892,0.00009407119,0.000038600298,0.0000080691225,0.000043411397,0.000064570995,0.00053649937,0.00048473073,0.9816782,0.0062483633,0.01077518],"study_design_scores_gemma":[0.0000049900877,0.000008363586,0.00013040956,0.000014984011,0.0000055637297,0.00016198744,0.00003161153,0.002906062,0.00042363556,0.9888205,0.0074854074,0.000006502029],"about_ca_topic_score_codex":0.00065969443,"about_ca_topic_score_gemma":0.0004274888,"teacher_disagreement_score":0.020338576,"about_ca_system_score_codex":0.0006325051,"about_ca_system_score_gemma":0.0006217613,"threshold_uncertainty_score":0.0680393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005208254,0.0001173942,0.99399996,0.000089755275,0.000024695039,0.000013451168,0.000026251706,0.00015412469,0.00036610145],"genre_scores_gemma":[0.37961623,0.00022504998,0.6163678,0.00017644491,0.00012233948,0.00018266361,0.00040849362,0.00021925726,0.0026818423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978435,0.000706561,0.00013395243,0.00044573317,0.0007306657,0.000139502],"domain_scores_gemma":[0.99528897,0.002582968,0.00042816205,0.0006087076,0.00097077515,0.00012035416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022081356,0.0009285538,0.0024422004,0.0009064042,0.00046380612,0.0017424154,0.0023785334,0.001459271,0.0019051752],"category_scores_gemma":[0.009981053,0.00075215026,0.0010039213,0.0014154905,0.0010992446,0.0022464038,0.0025423768,0.0023580033,0.0006843047],"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.00053845404,0.0001621799,0.0013717674,0.00035336427,0.00022585053,0.00011489227,0.00012653176,0.4224332,0.011159555,0.06954772,0.005324883,0.4886416],"study_design_scores_gemma":[0.00000525157,0.000026899927,0.00010533746,0.000004925106,0.0000062158083,0.000025634306,0.000007194596,0.98695755,0.0009885225,0.0114653725,0.0003986942,0.000008395371],"about_ca_topic_score_codex":0.0013712589,"about_ca_topic_score_gemma":0.0013142745,"teacher_disagreement_score":0.0024422004,"about_ca_system_score_codex":0.00070235675,"about_ca_system_score_gemma":0.0012129431,"threshold_uncertainty_score":0.011677861},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20924689,0.0003136601,0.77416897,0.0013206289,0.00010237298,0.00016396845,0.0004975649,0.0008092908,0.013376732],"genre_scores_gemma":[0.81983876,0.00024591794,0.17270622,0.0002595878,0.0000890564,0.00024146683,0.0007053886,0.00041463188,0.005498979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797636,0.00089137594,0.00007562848,0.0004514928,0.0002511981,0.00035395127],"domain_scores_gemma":[0.9865752,0.01131505,0.00060091255,0.00053025817,0.0004136462,0.0005650458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027938583,0.0011148385,0.0022570333,0.0010678158,0.0011238289,0.0040249242,0.0021499863,0.0016371212,0.0081090685],"category_scores_gemma":[0.018199394,0.0009329066,0.0010627091,0.0012070592,0.0022505631,0.005614611,0.002401787,0.002434697,0.00089065987],"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.0006648831,0.00030633522,0.0019926454,0.0002935922,0.00010703733,0.00011594176,0.00033967735,0.502145,0.0024363594,0.44448406,0.0063044587,0.04081008],"study_design_scores_gemma":[0.000051366518,0.000031073057,0.00013040505,0.000015779095,0.000012649257,0.000016565802,0.00007445726,0.6466839,0.000514627,0.35194698,0.00051253074,0.000009674253],"about_ca_topic_score_codex":0.0047237417,"about_ca_topic_score_gemma":0.006587444,"teacher_disagreement_score":0.0081090685,"about_ca_system_score_codex":0.0024539395,"about_ca_system_score_gemma":0.003037929,"threshold_uncertainty_score":0.027127504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14334893,0.0013026977,0.8078124,0.0007866483,0.00011202706,0.000053176143,0.00036141384,0.00012861383,0.04609413],"genre_scores_gemma":[0.8959773,0.0016718564,0.08600134,0.00041516617,0.00025389102,0.00017203916,0.000451497,0.00014313837,0.014913726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988669,0.0002897227,0.000040418487,0.00020736433,0.00046106637,0.00013459203],"domain_scores_gemma":[0.99735236,0.0010877118,0.00035915722,0.00019800848,0.0006004012,0.00040238627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014591917,0.00084601616,0.0006896891,0.0014307759,0.0008382162,0.0024234129,0.0013462616,0.0006181717,0.003205997],"category_scores_gemma":[0.0043077758,0.0003373247,0.0005746495,0.00097392086,0.0025126738,0.0030433768,0.0020251637,0.0019601507,0.00044630386],"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.000014521052,0.000013306435,0.00023265147,0.000030346899,0.0000068613404,0.000057711946,0.000063457665,0.006972439,0.0010584616,0.9868095,0.00064683927,0.0040939455],"study_design_scores_gemma":[0.000008553023,0.000026786696,0.0004074619,0.000030832,0.000005988171,0.00014044785,0.00007665889,0.07176519,0.0010305758,0.9219603,0.004531726,0.000015393545],"about_ca_topic_score_codex":0.00085138466,"about_ca_topic_score_gemma":0.00065066305,"teacher_disagreement_score":0.003205997,"about_ca_system_score_codex":0.00094820827,"about_ca_system_score_gemma":0.0006717767,"threshold_uncertainty_score":0.010725081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058734985,0.00028011392,0.9831267,0.00039685628,0.00004951822,0.00002044599,0.00016584447,0.00010204178,0.009985009],"genre_scores_gemma":[0.5259243,0.0011731408,0.44717506,0.0002718419,0.00016932575,0.00037596526,0.000976788,0.0004392324,0.023494218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990582,0.00038567418,0.000045966022,0.00016986593,0.00024007446,0.000100173114],"domain_scores_gemma":[0.9986671,0.0008176687,0.00010864997,0.00013658518,0.0002177359,0.000052175194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014807753,0.0014610717,0.00135076,0.0006858164,0.00056923117,0.0043860953,0.0011810034,0.0013710343,0.007541753],"category_scores_gemma":[0.006677288,0.0006452645,0.0010366994,0.001645636,0.001088119,0.0033501561,0.0022849545,0.0027817304,0.0011067062],"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.000067576286,0.00008609245,0.0003262229,0.00026787084,0.000054935044,0.00006836086,0.000113025104,0.42915455,0.0008854508,0.5088382,0.003720622,0.05641718],"study_design_scores_gemma":[0.000007776789,0.000013849169,0.000037031914,0.000025620307,0.000008043571,0.00001766302,0.000021592863,0.7586698,0.00039700716,0.23851517,0.0022796553,0.0000068845593],"about_ca_topic_score_codex":0.0017880421,"about_ca_topic_score_gemma":0.0014942944,"teacher_disagreement_score":0.007541753,"about_ca_system_score_codex":0.0010351312,"about_ca_system_score_gemma":0.001327842,"threshold_uncertainty_score":0.025229633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069574295,0.0001384856,0.98888564,0.00023501767,0.00006778172,0.00007744009,0.000045950706,0.0007874888,0.0028047643],"genre_scores_gemma":[0.20343558,0.0002663368,0.7857937,0.00033780545,0.0001396965,0.00069605437,0.00029421586,0.0005729878,0.008463573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976738,0.0009087695,0.00011966626,0.00034655604,0.0005835813,0.00036759514],"domain_scores_gemma":[0.98874134,0.0077976044,0.00045505606,0.0016397954,0.0009908173,0.0003753892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042703343,0.0022502248,0.002758168,0.0017191342,0.0010870949,0.0028022446,0.00310365,0.002738365,0.017049888],"category_scores_gemma":[0.019698437,0.0010511867,0.001828378,0.0022834234,0.0016572997,0.0057528587,0.003008994,0.0057324967,0.0038019703],"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.00046703848,0.0005564832,0.00094824383,0.00026913697,0.0001144657,0.00006389887,0.00029831685,0.54673964,0.0022075353,0.17820857,0.008359377,0.2617672],"study_design_scores_gemma":[0.00006896718,0.000037613565,0.000108074404,0.000017041297,0.000015531437,0.000012793052,0.000021099017,0.92824453,0.0005557345,0.069971845,0.00093640434,0.000010255017],"about_ca_topic_score_codex":0.0061817653,"about_ca_topic_score_gemma":0.008816078,"teacher_disagreement_score":0.017049888,"about_ca_system_score_codex":0.002312149,"about_ca_system_score_gemma":0.004292877,"threshold_uncertainty_score":0.057037532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011033643,0.0006245368,0.9694512,0.0006181317,0.00059683184,0.00005702827,0.00005697994,0.0005524089,0.017009245],"genre_scores_gemma":[0.4579857,0.0010423944,0.51278055,0.0002616364,0.00056747743,0.00024758256,0.00020671339,0.00050837774,0.026399491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993893,0.00020397319,0.00002184446,0.000065063374,0.00024013409,0.000079682504],"domain_scores_gemma":[0.9988104,0.0005226254,0.00009005016,0.00019426622,0.00029724702,0.00008548362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001571924,0.0011646942,0.0009139695,0.0008259034,0.00067588506,0.0018121239,0.0012820532,0.0010868441,0.00969281],"category_scores_gemma":[0.0073959706,0.000494998,0.0005601763,0.0010035723,0.0010896454,0.0018048511,0.0020029263,0.0022362545,0.001973905],"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.00046870162,0.00020996116,0.0012615385,0.00026784948,0.000069431815,0.00010391468,0.00013658962,0.4536676,0.0036742059,0.28448054,0.010267211,0.24539256],"study_design_scores_gemma":[0.00002101686,0.000029304316,0.00014018356,0.00001664698,0.000006144821,0.000027692533,0.000010587612,0.97170615,0.0007678643,0.02420995,0.0030580154,0.0000065018094],"about_ca_topic_score_codex":0.0025345688,"about_ca_topic_score_gemma":0.0028623764,"teacher_disagreement_score":0.00969281,"about_ca_system_score_codex":0.00085646316,"about_ca_system_score_gemma":0.0016920295,"threshold_uncertainty_score":0.0324257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040344615,0.000054904805,0.9939798,0.000049556682,0.000018530947,0.00002412005,0.000024049903,0.00021559109,0.0015989118],"genre_scores_gemma":[0.14707363,0.00009973867,0.8493856,0.0000744658,0.00003078483,0.00014072195,0.00014161643,0.00035127084,0.0027021037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978097,0.0006157415,0.00009288721,0.00027974654,0.0010676085,0.00013433078],"domain_scores_gemma":[0.9955171,0.002582343,0.0002430466,0.0007978628,0.0007179242,0.00014176648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022750932,0.0009022519,0.0020249141,0.0020983366,0.00083933835,0.002501348,0.003257824,0.002313807,0.0062680575],"category_scores_gemma":[0.010771115,0.0011878263,0.0016934832,0.0020332944,0.0016748051,0.0029648014,0.005675567,0.0032460068,0.0014729614],"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.00026768728,0.00016937082,0.0012490391,0.00035680318,0.00014416888,0.00018041763,0.00038652154,0.61196625,0.006709049,0.17412014,0.0039805565,0.20047008],"study_design_scores_gemma":[0.000008857396,0.000015761294,0.000044254175,0.000011234918,0.000007126184,0.000036465102,0.000020182124,0.97837013,0.0013568607,0.018902596,0.0012195279,0.0000069523153],"about_ca_topic_score_codex":0.0025987544,"about_ca_topic_score_gemma":0.0035775327,"teacher_disagreement_score":0.0062680575,"about_ca_system_score_codex":0.0011428011,"about_ca_system_score_gemma":0.0012571561,"threshold_uncertainty_score":0.020968735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024585936,0.00011764044,0.9940712,0.00011607999,0.000047240548,0.00003141247,0.000028665032,0.000069610775,0.0030595462],"genre_scores_gemma":[0.20913182,0.0010023444,0.771729,0.0002355267,0.00019879083,0.0005140937,0.00046559784,0.0010207827,0.015702052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877375,0.0006243937,0.0000508161,0.0001665195,0.0003219585,0.00006258677],"domain_scores_gemma":[0.9965385,0.0019223642,0.000247881,0.00033861998,0.00079050654,0.00016208892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036646156,0.0015039544,0.0016174613,0.0015395492,0.00094850286,0.0031751492,0.0021664712,0.0018216348,0.006702866],"category_scores_gemma":[0.016292969,0.0012017511,0.0013074054,0.0009474169,0.0021500813,0.0031841872,0.0042892545,0.0039080093,0.0021231833],"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.0001706822,0.00013197225,0.0007819242,0.00063011737,0.00006837971,0.00013771791,0.00043005362,0.36082822,0.0047360337,0.49396288,0.008784999,0.12933706],"study_design_scores_gemma":[0.000008517622,0.000022327675,0.00004350104,0.000042804408,0.0000070035185,0.000022159033,0.00003106905,0.9008565,0.0008885043,0.09529483,0.0027721839,0.000010614342],"about_ca_topic_score_codex":0.0013834718,"about_ca_topic_score_gemma":0.0011698507,"teacher_disagreement_score":0.006702866,"about_ca_system_score_codex":0.0008498471,"about_ca_system_score_gemma":0.0019000191,"threshold_uncertainty_score":0.022423327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16292048,0.00048392595,0.8146161,0.0015347195,0.00007809685,0.00036983672,0.0012158288,0.00051248603,0.018268524],"genre_scores_gemma":[0.821325,0.00054199895,0.16906016,0.0003749903,0.0001235919,0.0003592624,0.001692622,0.00021392228,0.006308479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985411,0.00046746095,0.000063144136,0.0003648514,0.00027363712,0.00028987188],"domain_scores_gemma":[0.99656194,0.0021979283,0.0003466497,0.00032012284,0.00026267476,0.00031067996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012553511,0.000893793,0.0013493109,0.00069824763,0.0006502502,0.002482375,0.0016723769,0.0010478592,0.006125216],"category_scores_gemma":[0.0072808773,0.00041662218,0.0009346317,0.0013886496,0.0009206224,0.0041029095,0.0012968243,0.0022824882,0.0006859903],"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.00028147266,0.00025948128,0.0016544344,0.000335331,0.00006602098,0.00028057833,0.0005535645,0.24277483,0.01088404,0.6841157,0.013107523,0.045687117],"study_design_scores_gemma":[0.000025022468,0.00006389339,0.00026152979,0.000021705384,0.000012229229,0.00012279043,0.00009967675,0.6030028,0.0012599217,0.3921919,0.00292573,0.000012890613],"about_ca_topic_score_codex":0.0014372962,"about_ca_topic_score_gemma":0.0017024835,"teacher_disagreement_score":0.006125216,"about_ca_system_score_codex":0.0014974145,"about_ca_system_score_gemma":0.0012034007,"threshold_uncertainty_score":0.020490885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03522851,0.0010255983,0.9129176,0.004349742,0.00062675955,0.00048041783,0.0010178597,0.0032543626,0.041099176],"genre_scores_gemma":[0.17410478,0.0007170699,0.79870224,0.0010599126,0.0005317954,0.00080511306,0.0018094076,0.00080010673,0.021469563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785185,0.000639916,0.000084663465,0.0005630756,0.00048973976,0.00037078786],"domain_scores_gemma":[0.9966864,0.001720317,0.00020599083,0.0008557912,0.00025181353,0.0002797113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023588382,0.0021852166,0.0025644994,0.0014843069,0.001569463,0.0042425278,0.0064730477,0.004182566,0.021286026],"category_scores_gemma":[0.010083369,0.001264605,0.0027454318,0.003543714,0.0016395226,0.008453498,0.005208518,0.0059808576,0.0046455706],"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.0014628938,0.0014048521,0.001631614,0.00057521206,0.00014489742,0.00020658184,0.00030185253,0.16967313,0.0042483895,0.30921897,0.068228744,0.44290292],"study_design_scores_gemma":[0.00021656934,0.00010878269,0.0003217646,0.000088342844,0.0000802075,0.0001951197,0.00009072705,0.7134029,0.0018137412,0.27137396,0.012278672,0.000029208384],"about_ca_topic_score_codex":0.0033733884,"about_ca_topic_score_gemma":0.0039247675,"teacher_disagreement_score":0.021286026,"about_ca_system_score_codex":0.002845521,"about_ca_system_score_gemma":0.004365382,"threshold_uncertainty_score":0.071208894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29919463,0.0024319293,0.64057356,0.0057102977,0.000568196,0.000106025145,0.0002482847,0.0003211278,0.050845966],"genre_scores_gemma":[0.8852125,0.0019849383,0.07611137,0.0012779331,0.00050714007,0.00012733618,0.00033527683,0.000367448,0.034076124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820757,0.00076484756,0.000082026854,0.0002564955,0.00039638014,0.0002927218],"domain_scores_gemma":[0.98550874,0.009247985,0.0011385982,0.00097013026,0.001542383,0.0015920721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068582348,0.0013063716,0.0018244428,0.0029999814,0.002285298,0.0025803654,0.0017044296,0.0037573695,0.004255884],"category_scores_gemma":[0.030705443,0.0010175233,0.0012579305,0.0014482974,0.006688877,0.0066610957,0.0052925083,0.0049039023,0.0007020633],"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.00003896731,0.000020225674,0.00025995815,0.00005228948,0.00001215786,0.00008910439,0.00015661426,0.0070461906,0.0007272325,0.987656,0.00095351366,0.002987618],"study_design_scores_gemma":[0.000010006372,0.000022331695,0.0001992461,0.000021787831,0.0000065556264,0.000089357796,0.00007837178,0.03462027,0.00034710683,0.96348953,0.0010978023,0.000017689072],"about_ca_topic_score_codex":0.0017577867,"about_ca_topic_score_gemma":0.0011202386,"teacher_disagreement_score":0.0068582348,"about_ca_system_score_codex":0.0017563843,"about_ca_system_score_gemma":0.0016354239,"threshold_uncertainty_score":0.0362702},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010240269,0.00015237044,0.9961748,0.0002063242,0.00005313732,0.000026718204,0.0000318205,0.000064477295,0.0022663502],"genre_scores_gemma":[0.1136646,0.0008745695,0.8681259,0.00044977613,0.00034020017,0.00053130026,0.00032955586,0.00053335505,0.015150739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985337,0.00072096824,0.000061027025,0.00019894037,0.00039212382,0.00009324591],"domain_scores_gemma":[0.9952691,0.0033997514,0.00023903602,0.00023213681,0.0006990158,0.0001607986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031922737,0.0017227837,0.0014565164,0.0010032802,0.0005921718,0.0024964546,0.0025092522,0.0020484896,0.005797528],"category_scores_gemma":[0.013516219,0.0010253349,0.0012412623,0.0012951844,0.002586376,0.0023905197,0.0030996143,0.005043057,0.0012310962],"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.0000763504,0.00012935305,0.00025155887,0.00038461515,0.000067286266,0.00010746134,0.00019728641,0.4184717,0.002639299,0.4753771,0.010101274,0.092196666],"study_design_scores_gemma":[0.000007080496,0.000013624761,0.000028081275,0.000018243913,0.000005027791,0.000013158002,0.000013552631,0.943028,0.00037608392,0.055083152,0.0014048474,0.000009225158],"about_ca_topic_score_codex":0.0037015122,"about_ca_topic_score_gemma":0.0037839208,"teacher_disagreement_score":0.005797528,"about_ca_system_score_codex":0.0014301975,"about_ca_system_score_gemma":0.0024454948,"threshold_uncertainty_score":0.019394696},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015998825,0.00015652325,0.9945193,0.00030135532,0.00006457335,0.000016361319,0.00002955366,0.000075587115,0.0032369257],"genre_scores_gemma":[0.097523026,0.0011267676,0.8879059,0.0005173488,0.00038166123,0.00022973202,0.00017090431,0.00039774962,0.011746938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912065,0.00046154385,0.00004557764,0.00010424292,0.00021352126,0.000054428787],"domain_scores_gemma":[0.99731284,0.0019609728,0.0002116916,0.00021324777,0.00023468955,0.000066518136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245115,0.001321712,0.0012346884,0.0008124232,0.0004967788,0.0018591505,0.00077634695,0.0014062693,0.0050751828],"category_scores_gemma":[0.008773982,0.0006753976,0.0011178992,0.0011964821,0.0013173636,0.0019287934,0.0019125084,0.0029816423,0.0011328591],"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.00011594512,0.00012496668,0.00040885806,0.00073282997,0.00013116219,0.00021818212,0.0001507457,0.43562856,0.00911254,0.39375526,0.008954591,0.15066649],"study_design_scores_gemma":[0.000009334867,0.000050807834,0.000069909765,0.000049169746,0.000018826639,0.00010822973,0.000036742,0.87239176,0.0021212646,0.12018178,0.0049502584,0.000011845807],"about_ca_topic_score_codex":0.0009333899,"about_ca_topic_score_gemma":0.0012934025,"teacher_disagreement_score":0.0050751828,"about_ca_system_score_codex":0.00043734172,"about_ca_system_score_gemma":0.0012864169,"threshold_uncertainty_score":0.016978204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06928992,0.007921984,0.86090064,0.007845977,0.00026960945,0.000052427018,0.0003670225,0.0001416048,0.053210925],"genre_scores_gemma":[0.84069455,0.006170548,0.12900412,0.001305625,0.0011609606,0.00024493723,0.00035038823,0.00021957602,0.020849228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712723,0.0016531402,0.00010694204,0.00041810828,0.00047802954,0.00021643264],"domain_scores_gemma":[0.98691934,0.009835035,0.0008965564,0.0007042375,0.0011355368,0.0005092737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064294823,0.001449326,0.0023362525,0.0026458837,0.0016724151,0.0040623997,0.0022062296,0.0016667782,0.0063995505],"category_scores_gemma":[0.017596615,0.0011680279,0.0022312677,0.002449001,0.0072172666,0.010898652,0.004423331,0.006784005,0.0004986131],"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.000012616195,0.000011168475,0.00017710996,0.00005103647,0.000017626011,0.000023193297,0.00007472949,0.0019148381,0.00012986899,0.99419653,0.0005020504,0.002889149],"study_design_scores_gemma":[0.0000025952259,0.0000068045224,0.00016031963,0.000016470156,0.0000070446454,0.000032802047,0.000028254277,0.0091148615,0.000070379276,0.9896535,0.00090175454,0.0000052224],"about_ca_topic_score_codex":0.0014190064,"about_ca_topic_score_gemma":0.0015607888,"teacher_disagreement_score":0.0064294823,"about_ca_system_score_codex":0.002489532,"about_ca_system_score_gemma":0.0012424274,"threshold_uncertainty_score":0.03400272},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04498462,0.0009112023,0.9168776,0.0014535574,0.00039785032,0.00013883016,0.0004816219,0.00017730436,0.034577373],"genre_scores_gemma":[0.5865932,0.0024556788,0.38217908,0.0009182215,0.0011080466,0.00068665575,0.0015744276,0.00075017277,0.0237345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740726,0.0007704318,0.00017739444,0.0005950754,0.0007066247,0.00034315785],"domain_scores_gemma":[0.99411124,0.0037096504,0.00053749233,0.00069872383,0.00050919235,0.00043360074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002763824,0.0013658148,0.0024124691,0.0016715546,0.0017304949,0.0059389663,0.0013857539,0.0016788249,0.008324662],"category_scores_gemma":[0.013368332,0.0012615199,0.0023832256,0.002729057,0.0031523157,0.009510228,0.003190846,0.0072720875,0.00096420257],"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.00008120881,0.00008847829,0.00026170467,0.00012230061,0.00001484143,0.000060086768,0.00019189918,0.01820814,0.00062042894,0.9510723,0.0037222311,0.02555644],"study_design_scores_gemma":[0.000013693402,0.000032020693,0.000096867836,0.000036860867,0.0000080616755,0.00007514935,0.000067875786,0.053198628,0.00041889708,0.9420118,0.0040291967,0.000011036188],"about_ca_topic_score_codex":0.0013000427,"about_ca_topic_score_gemma":0.0010340046,"teacher_disagreement_score":0.008324662,"about_ca_system_score_codex":0.0017166766,"about_ca_system_score_gemma":0.0013253638,"threshold_uncertainty_score":0.02784872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026268031,0.005525891,0.94638765,0.0042386344,0.00051536085,0.00006370314,0.0002155765,0.00007818281,0.016706906],"genre_scores_gemma":[0.75714743,0.009495686,0.19627275,0.0006806006,0.0016329547,0.00031222307,0.00032328756,0.0001858963,0.033949222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993869,0.00031643923,0.000035189332,0.00008806277,0.00012454044,0.000048963764],"domain_scores_gemma":[0.99488044,0.004153851,0.00042771583,0.00006547135,0.00028429614,0.0001883439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019154925,0.0013425403,0.0015335834,0.0009454281,0.0008293956,0.0020455536,0.0012672673,0.0023565374,0.0045897183],"category_scores_gemma":[0.009977012,0.0008090475,0.0010665461,0.0025220634,0.0016297656,0.0019062762,0.0016996994,0.0024246443,0.0002828365],"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.000028102551,0.000045872544,0.00038178888,0.00014252747,0.000034681107,0.00011476391,0.000044399203,0.8915078,0.00031344758,0.09306287,0.001823507,0.012500146],"study_design_scores_gemma":[0.000006676562,0.000011168583,0.00013079512,0.000016353077,0.000008319034,0.000020962236,0.000015572818,0.9502772,0.000094009665,0.048525732,0.000882087,0.000011201843],"about_ca_topic_score_codex":0.008219371,"about_ca_topic_score_gemma":0.007487545,"teacher_disagreement_score":0.008219371,"about_ca_system_score_codex":0.0013271492,"about_ca_system_score_gemma":0.0015252002,"threshold_uncertainty_score":0.016343057},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012626644,0.0003860801,0.9920438,0.00015539861,0.000086106775,0.00003052518,0.00004526927,0.00016549732,0.0058247284],"genre_scores_gemma":[0.101101324,0.0012580181,0.87776273,0.00034473688,0.00024264133,0.00040014443,0.00036903538,0.00070294435,0.01781841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999037,0.00039883767,0.0000344717,0.00011555589,0.00033419929,0.00008004087],"domain_scores_gemma":[0.998026,0.0013280615,0.00011765451,0.00016825512,0.00027721515,0.00008285784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013958314,0.001447118,0.0017250142,0.001114245,0.0010067486,0.0015876958,0.0017499235,0.0015535125,0.007643895],"category_scores_gemma":[0.0064343577,0.0013170958,0.0009802898,0.001875813,0.001552949,0.0020490696,0.002256114,0.0046899263,0.0021557997],"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.0001465685,0.0001411801,0.00031461474,0.0004429972,0.00008563488,0.000041515148,0.0001683842,0.44911453,0.0017490762,0.32642305,0.016695432,0.20467702],"study_design_scores_gemma":[0.000025371985,0.000026644317,0.00009100132,0.000043210886,0.000011935501,0.000018723496,0.000021481115,0.855278,0.0007310634,0.13594674,0.0077916463,0.000014187063],"about_ca_topic_score_codex":0.005333445,"about_ca_topic_score_gemma":0.008941625,"teacher_disagreement_score":0.007643895,"about_ca_system_score_codex":0.0014632862,"about_ca_system_score_gemma":0.0018970193,"threshold_uncertainty_score":0.025571406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009536438,0.0006008072,0.9808719,0.0005093255,0.00009862323,0.00007190555,0.00006612485,0.00012355705,0.008121203],"genre_scores_gemma":[0.4522651,0.0012676587,0.5386569,0.0007530392,0.00036525668,0.00049031206,0.0004424247,0.00030255684,0.005456728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963315,0.0025442564,0.00008319771,0.00020792159,0.00063675054,0.00019640803],"domain_scores_gemma":[0.99245936,0.0058645993,0.00045357842,0.0004274655,0.0005963925,0.00019857712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066435956,0.0014662839,0.0021512625,0.0012080111,0.00070713874,0.002111383,0.0012708119,0.0015542908,0.003546512],"category_scores_gemma":[0.015708162,0.00075420295,0.0012491328,0.0019142857,0.0017697555,0.0020428416,0.0028230303,0.0034795632,0.00063859567],"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.00010723154,0.000092303526,0.00034086304,0.00014342557,0.000042224463,0.00009684043,0.000057920442,0.87105924,0.0004494743,0.10280728,0.0024224473,0.02238079],"study_design_scores_gemma":[0.00001216902,0.00003378965,0.000034487388,0.000028009772,0.000004017121,0.000016672335,0.000009541904,0.9666918,0.00019769145,0.031920362,0.0010474981,0.0000040053615],"about_ca_topic_score_codex":0.0012614549,"about_ca_topic_score_gemma":0.0009777714,"teacher_disagreement_score":0.0066435956,"about_ca_system_score_codex":0.0010765151,"about_ca_system_score_gemma":0.0013395618,"threshold_uncertainty_score":0.03513509},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1949862,0.003040235,0.7613516,0.0015976923,0.00048412054,0.00007608745,0.0002439975,0.00023491072,0.037985288],"genre_scores_gemma":[0.8510844,0.00219904,0.11503092,0.00062906765,0.0009893273,0.00018955687,0.00021651192,0.00031138642,0.029349852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987814,0.00043830936,0.00006734159,0.0002221998,0.00034279694,0.0001479941],"domain_scores_gemma":[0.9967636,0.0015092808,0.0004840714,0.00023269543,0.0005351043,0.00047530635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026873692,0.0012458309,0.0012408887,0.0025883461,0.001098448,0.0026070052,0.0018647575,0.0018730198,0.0054602507],"category_scores_gemma":[0.0093246205,0.0007817757,0.0013852108,0.0013350504,0.0029207603,0.0064465688,0.0026967225,0.0028645382,0.00046988734],"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.00001431745,0.000014429357,0.00009121504,0.00003043134,0.000020042924,0.000052016552,0.000098324395,0.003374547,0.00091522466,0.991872,0.0004420823,0.0030752672],"study_design_scores_gemma":[0.000005666625,0.000016371843,0.00014135872,0.000009212332,0.000007891073,0.000096753145,0.00003178144,0.04462321,0.00029060384,0.9539451,0.0008203522,0.00001162002],"about_ca_topic_score_codex":0.0005555257,"about_ca_topic_score_gemma":0.0005171941,"teacher_disagreement_score":0.0054602507,"about_ca_system_score_codex":0.0011669236,"about_ca_system_score_gemma":0.0008720277,"threshold_uncertainty_score":0.01826638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44703943,0.0013382995,0.51561254,0.0027488605,0.00010611388,0.0003533593,0.001347892,0.0005993128,0.03085427],"genre_scores_gemma":[0.815589,0.0014761316,0.16699104,0.00034011662,0.00014743132,0.00044460705,0.0009062254,0.00024279908,0.013862618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987459,0.00040178577,0.000067990746,0.00029023207,0.0002424018,0.00025164176],"domain_scores_gemma":[0.98985183,0.007875545,0.00094578904,0.0003080676,0.00043128178,0.00058747863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015264722,0.0011200086,0.001537253,0.0024997126,0.001913385,0.0032531284,0.002600484,0.0018638222,0.008134029],"category_scores_gemma":[0.016905425,0.0015287473,0.0009984128,0.0037668217,0.0020598343,0.0070426925,0.0034813958,0.002304452,0.00048536746],"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.0005645648,0.00019374849,0.0021310009,0.0008647959,0.00012279364,0.00030742373,0.0008531234,0.15773317,0.0039181816,0.7860691,0.0065317666,0.040710293],"study_design_scores_gemma":[0.000094691604,0.00007528981,0.00070532394,0.00007396558,0.000081302256,0.00022509991,0.00027621686,0.17519273,0.001754311,0.8182647,0.0032288248,0.000027488742],"about_ca_topic_score_codex":0.002035306,"about_ca_topic_score_gemma":0.0028375997,"teacher_disagreement_score":0.008134029,"about_ca_system_score_codex":0.0020656295,"about_ca_system_score_gemma":0.0012523303,"threshold_uncertainty_score":0.02721107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051245995,0.0008111132,0.9386794,0.0020560245,0.00014190606,0.00023682984,0.00035111574,0.00011401972,0.006363517],"genre_scores_gemma":[0.7474507,0.0012990615,0.224106,0.00076020765,0.000381128,0.00073734426,0.0006841885,0.00022409376,0.024357345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950565,0.0028784948,0.00015616589,0.000710001,0.0006279624,0.0005708199],"domain_scores_gemma":[0.9671474,0.029155277,0.0013446648,0.0004184693,0.00091039255,0.0010238967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010812914,0.0015811048,0.004320799,0.0017264459,0.0012364208,0.0038100807,0.003547112,0.004184352,0.0070842225],"category_scores_gemma":[0.031514097,0.0034219055,0.0024680265,0.002397424,0.0042245467,0.0045182332,0.004077493,0.003569503,0.00031946847],"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.00013252461,0.0001074197,0.0006958524,0.000116396666,0.00005993501,0.00013162202,0.000077263474,0.9114759,0.0003218336,0.08355407,0.0006220768,0.0027051165],"study_design_scores_gemma":[0.000022464212,0.000026759011,0.00012659696,0.0000097704915,0.000011604439,0.000012366369,0.000011496193,0.98500603,0.00006178334,0.014547201,0.00015400407,0.000009800336],"about_ca_topic_score_codex":0.025871368,"about_ca_topic_score_gemma":0.017598543,"teacher_disagreement_score":0.025871368,"about_ca_system_score_codex":0.0051913452,"about_ca_system_score_gemma":0.0043031597,"threshold_uncertainty_score":0.057184815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12373809,0.00081017596,0.8508767,0.0014221704,0.000118261916,0.00015190402,0.0002884682,0.0010477734,0.021546453],"genre_scores_gemma":[0.5521841,0.0009872649,0.43075448,0.00043540128,0.00017749604,0.00031993378,0.00056352053,0.0007500301,0.013827798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988079,0.0003236995,0.000050052982,0.00029035282,0.0003270448,0.00020091371],"domain_scores_gemma":[0.98926276,0.008984467,0.0004379721,0.00067879393,0.00037394633,0.00026207362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018247858,0.0013855249,0.0015046678,0.0015526881,0.0010104631,0.0035260646,0.0033569548,0.0019488148,0.0074893134],"category_scores_gemma":[0.017532155,0.0010079339,0.0014519292,0.0022331425,0.0018457385,0.0066180066,0.0037903697,0.0047394247,0.00094041723],"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.00060359476,0.00039590942,0.0016312336,0.0005536925,0.00010101222,0.00017155611,0.0007862052,0.40887463,0.0032393099,0.4446771,0.009411941,0.12955372],"study_design_scores_gemma":[0.00004418344,0.00003444937,0.00014370355,0.000050158258,0.000044420805,0.000060909162,0.00009134955,0.6111422,0.0010935044,0.38562822,0.0016572119,0.000009745699],"about_ca_topic_score_codex":0.0025579494,"about_ca_topic_score_gemma":0.004591237,"teacher_disagreement_score":0.0074893134,"about_ca_system_score_codex":0.0027161217,"about_ca_system_score_gemma":0.0016935951,"threshold_uncertainty_score":0.025054276},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026563369,0.0011802609,0.96687716,0.0011586795,0.00006192676,0.00004218522,0.00007613309,0.00007723082,0.0039629084],"genre_scores_gemma":[0.65055245,0.0024386968,0.33623147,0.00030505302,0.00034733914,0.0002541517,0.00029217024,0.0002633953,0.009315258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962333,0.0021640146,0.00014266299,0.00042958005,0.00083245896,0.00019794745],"domain_scores_gemma":[0.9900572,0.007558137,0.00077761285,0.0006411762,0.00060877844,0.0003570739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074113547,0.0015117207,0.0020325244,0.0017803175,0.00054799585,0.0036744832,0.0017913491,0.001963608,0.0016536061],"category_scores_gemma":[0.028738592,0.00095069193,0.0011506956,0.0021022053,0.0021801207,0.005386241,0.0038137985,0.0028400386,0.00029746146],"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.00008809644,0.000073701885,0.00081746944,0.00018482818,0.00012313221,0.00007467662,0.00010089871,0.5232471,0.00095125206,0.43752173,0.0018009145,0.035016198],"study_design_scores_gemma":[0.000013609854,0.000054407294,0.0001555195,0.000025447443,0.000019882797,0.00004499284,0.000020202475,0.7031441,0.00040603883,0.29490837,0.0011924907,0.0000148400495],"about_ca_topic_score_codex":0.0013802659,"about_ca_topic_score_gemma":0.00080716045,"teacher_disagreement_score":0.0074113547,"about_ca_system_score_codex":0.0032806527,"about_ca_system_score_gemma":0.0015764777,"threshold_uncertainty_score":0.039195478},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040288996,0.00022855023,0.9932653,0.00023618824,0.00005467375,0.0000234168,0.000027006166,0.00007809174,0.0020579381],"genre_scores_gemma":[0.43608284,0.0008825553,0.5404431,0.00035847782,0.00020851092,0.0004754445,0.00016871002,0.0005693654,0.020811012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987286,0.0006997424,0.000047069,0.00017842061,0.00026265954,0.00008353327],"domain_scores_gemma":[0.9945129,0.0042388574,0.00035541918,0.0002646339,0.00036897545,0.00025925026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048133056,0.0017275384,0.0027412314,0.0011764561,0.00064211455,0.002293592,0.0025059138,0.0027356748,0.0048732874],"category_scores_gemma":[0.013458636,0.0013223705,0.0012335118,0.0011339346,0.002352455,0.004129683,0.003911632,0.0032667331,0.00060522946],"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.00011968746,0.000073356525,0.00014936613,0.00017461504,0.00006484985,0.000073607116,0.000046035104,0.68615675,0.001356831,0.3000727,0.0015398419,0.010172334],"study_design_scores_gemma":[0.000007137368,0.000011455713,0.00001672934,0.000009935616,0.000004792707,0.000006294435,0.000002082257,0.97573346,0.00019403311,0.02373352,0.00027545542,0.000005026724],"about_ca_topic_score_codex":0.0021600514,"about_ca_topic_score_gemma":0.0016741483,"teacher_disagreement_score":0.0048732874,"about_ca_system_score_codex":0.0013341728,"about_ca_system_score_gemma":0.0019680911,"threshold_uncertainty_score":0.025455475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069913687,0.00036461753,0.9872989,0.0005640928,0.00003434677,0.000029863879,0.00007013345,0.0001377652,0.0045089307],"genre_scores_gemma":[0.56157315,0.0011336026,0.42321047,0.0008548919,0.00027098996,0.00032626305,0.0003130405,0.00036576513,0.011951813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810493,0.00095015694,0.00004923751,0.00030783808,0.00042604384,0.00016177032],"domain_scores_gemma":[0.9970381,0.0020532808,0.00019197416,0.00031397812,0.000262326,0.00014034043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004208522,0.0011980092,0.0013615706,0.00080188527,0.00057688693,0.0016688823,0.0016138862,0.0013281475,0.004463794],"category_scores_gemma":[0.009211498,0.00053775054,0.0012287941,0.0011822494,0.0018470285,0.0027288417,0.0023837585,0.0036620814,0.0007479763],"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.00010347319,0.000089175985,0.0004379265,0.00019768941,0.000060692928,0.00011563796,0.000104772305,0.45796198,0.0025316314,0.46898615,0.005895112,0.06351581],"study_design_scores_gemma":[0.000010240256,0.000039148552,0.000081707214,0.000020118996,0.000007423576,0.000027475158,0.000012250362,0.83495665,0.0005932017,0.16183122,0.0024115527,0.000009082934],"about_ca_topic_score_codex":0.0018438929,"about_ca_topic_score_gemma":0.0014209909,"teacher_disagreement_score":0.004463794,"about_ca_system_score_codex":0.002120652,"about_ca_system_score_gemma":0.001350329,"threshold_uncertainty_score":0.02225703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03888217,0.0011365945,0.94660276,0.0041386043,0.0004072796,0.000092089125,0.00009727589,0.000105547784,0.008537749],"genre_scores_gemma":[0.8246499,0.0012923419,0.15172398,0.0006208896,0.0007114439,0.00027725537,0.00009131776,0.00017199456,0.020460928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938537,0.0038616215,0.00018892338,0.0008470221,0.000686701,0.000562055],"domain_scores_gemma":[0.95680106,0.037318863,0.0013920249,0.001007002,0.0019390181,0.0015420262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01993483,0.0013256908,0.002641237,0.0013643152,0.0020838769,0.0041711833,0.0031281775,0.0028548462,0.004579069],"category_scores_gemma":[0.047966592,0.001058145,0.0015018014,0.0022798108,0.0045163333,0.00604698,0.0037918882,0.004662097,0.00027585868],"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.00017037251,0.00008507978,0.0009178624,0.000095693074,0.000045904053,0.00014808899,0.00035196854,0.31367627,0.0003789184,0.67091924,0.0018378809,0.011372654],"study_design_scores_gemma":[0.000023767117,0.00004654414,0.00018259056,0.000021383275,0.000026754113,0.000037697482,0.000079224556,0.82011783,0.0001265289,0.17820224,0.0011146433,0.000020774261],"about_ca_topic_score_codex":0.010439932,"about_ca_topic_score_gemma":0.005751923,"teacher_disagreement_score":0.01993483,"about_ca_system_score_codex":0.0050162496,"about_ca_system_score_gemma":0.0044589234,"threshold_uncertainty_score":0.10542673},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018301688,0.0020109995,0.9549553,0.0017256823,0.00028005443,0.00008813994,0.00029144948,0.000365402,0.021981286],"genre_scores_gemma":[0.3802423,0.0026101237,0.58291614,0.00078732625,0.0009799018,0.0005305651,0.00094427896,0.0011064234,0.029883008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984888,0.00067213376,0.000057807487,0.000182572,0.00046257456,0.00013612142],"domain_scores_gemma":[0.994393,0.0043119877,0.00031460015,0.00045280933,0.00035920893,0.00016844971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003449066,0.0019675368,0.0010946263,0.0012962334,0.0010796008,0.0028114456,0.001672032,0.0018843219,0.009800022],"category_scores_gemma":[0.01264973,0.0009445867,0.0010768407,0.0014929177,0.0018199153,0.0057540233,0.0023252734,0.0051627867,0.0013098808],"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.00026530024,0.00016928524,0.00079913123,0.0005587381,0.000056438188,0.00018066335,0.00020512116,0.13172436,0.0026193324,0.667149,0.023305196,0.17296736],"study_design_scores_gemma":[0.000027232825,0.000046418616,0.00034437355,0.00008386924,0.000019805953,0.00014966745,0.000062376756,0.23210704,0.0014341805,0.75854445,0.0071515203,0.000029072411],"about_ca_topic_score_codex":0.00069023226,"about_ca_topic_score_gemma":0.00076130475,"teacher_disagreement_score":0.009800022,"about_ca_system_score_codex":0.0009203834,"about_ca_system_score_gemma":0.00067449646,"threshold_uncertainty_score":0.032784343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004495451,0.00056014647,0.9885129,0.00051252363,0.00011088875,0.000071195755,0.000071336915,0.000054745957,0.0056108986],"genre_scores_gemma":[0.36157468,0.00263841,0.61269027,0.0007378964,0.0006107598,0.0010494025,0.00083160657,0.0006402377,0.01922678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983412,0.000891837,0.00008090666,0.00021010463,0.00033452915,0.00014132337],"domain_scores_gemma":[0.99485236,0.0039364942,0.00034055737,0.00020378223,0.0004631761,0.00020346764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049896576,0.0022975456,0.0026307942,0.0012786643,0.0007899943,0.0026691966,0.0021244818,0.0024608464,0.004322192],"category_scores_gemma":[0.012978594,0.0014419031,0.002062457,0.0012944783,0.0026991987,0.0021651913,0.004616125,0.0054563526,0.00067977974],"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.00007581172,0.00009128919,0.00020591689,0.00029618063,0.0000683774,0.000087407745,0.0001522862,0.8671027,0.00083629065,0.11027083,0.002571649,0.018241284],"study_design_scores_gemma":[0.000007671697,0.000017070115,0.000030627354,0.000019989042,0.000006037628,0.000010204274,0.000016624843,0.9818932,0.00012280406,0.017094152,0.00077531073,0.000006357811],"about_ca_topic_score_codex":0.0043243514,"about_ca_topic_score_gemma":0.003619004,"teacher_disagreement_score":0.0049896576,"about_ca_system_score_codex":0.0015640551,"about_ca_system_score_gemma":0.0019991295,"threshold_uncertainty_score":0.026388109},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006040489,0.00011387375,0.99769235,0.00013497744,0.00005751309,0.000017039649,0.000017861996,0.000060758615,0.0013016622],"genre_scores_gemma":[0.042222474,0.0004712879,0.948484,0.000250568,0.00018951602,0.0002402766,0.00011505432,0.00035585804,0.0076708845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941254,0.00026336935,0.000021829663,0.00007253447,0.00019747512,0.000032217653],"domain_scores_gemma":[0.99915457,0.0005141713,0.00003869369,0.000055234246,0.0001839206,0.00005341054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013024241,0.0012082055,0.0011636944,0.0009110204,0.00043400368,0.0009192331,0.0012507954,0.0015466742,0.0042192647],"category_scores_gemma":[0.004476146,0.00077719416,0.00092951115,0.00084622495,0.0014156138,0.001496005,0.0020033114,0.002805858,0.0014336387],"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.00013324416,0.00014742064,0.00023817671,0.00046976478,0.00008537146,0.00014042499,0.00014111126,0.3315929,0.009477506,0.4758441,0.016507404,0.16522256],"study_design_scores_gemma":[0.000015561303,0.00003496869,0.00004595557,0.000021314961,0.000009687921,0.000041084295,0.000008949478,0.9466053,0.0006844667,0.04783397,0.004686657,0.000012119896],"about_ca_topic_score_codex":0.0018228656,"about_ca_topic_score_gemma":0.002393708,"teacher_disagreement_score":0.0042192647,"about_ca_system_score_codex":0.00062384986,"about_ca_system_score_gemma":0.0016274815,"threshold_uncertainty_score":0.014114857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18468593,0.00042383862,0.8055442,0.0004879141,0.000032479107,0.00012662922,0.000027967357,0.00010227411,0.008568788],"genre_scores_gemma":[0.90952855,0.00014166349,0.08855607,0.000091077745,0.000020597912,0.00009711332,0.000024223242,0.000051632058,0.0014891234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810827,0.0012044943,0.000055209355,0.00017775613,0.00023502574,0.00021932415],"domain_scores_gemma":[0.99258024,0.0061087846,0.00040085637,0.00021603575,0.00036181218,0.00033223003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035903428,0.0010489094,0.0011286427,0.00088142016,0.0006107114,0.0012605841,0.0013665649,0.0011330983,0.001793348],"category_scores_gemma":[0.0155488,0.00079820264,0.00068672164,0.00048326203,0.0011574086,0.0021825442,0.0017306472,0.0014286294,0.0001692088],"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.00028273504,0.0001822613,0.0021900537,0.00012393916,0.00010833429,0.00007637214,0.0002759309,0.88363063,0.0024435485,0.06850517,0.00068794144,0.041493166],"study_design_scores_gemma":[0.000039819162,0.00014415778,0.00019815647,0.000019687399,0.000025162275,0.000021496218,0.000055662487,0.94806,0.00054094783,0.050483774,0.00040340467,0.000007768208],"about_ca_topic_score_codex":0.0011949838,"about_ca_topic_score_gemma":0.0021420002,"teacher_disagreement_score":0.0035903428,"about_ca_system_score_codex":0.0012368219,"about_ca_system_score_gemma":0.00127655,"threshold_uncertainty_score":0.018987775},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018683713,0.001586378,0.97032285,0.0046651685,0.00008864545,0.000080466816,0.00028079303,0.000054809167,0.0042371647],"genre_scores_gemma":[0.66996235,0.0040515577,0.3143771,0.0011845627,0.00067597866,0.00068600394,0.0005000971,0.00021395508,0.008348449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958097,0.002249829,0.00022578127,0.00082478154,0.0006078342,0.00028219027],"domain_scores_gemma":[0.9652152,0.030255256,0.002029013,0.00080671004,0.0012283849,0.0004654597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010408933,0.0012418092,0.0025325888,0.0015558426,0.0008218584,0.0054099243,0.0025517715,0.0040759617,0.003850532],"category_scores_gemma":[0.047441494,0.0017963919,0.0016049593,0.0023484745,0.0047340565,0.009842051,0.0031801928,0.005435709,0.00037553112],"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.00007812386,0.000100492376,0.0005084015,0.00030603466,0.00007671012,0.000053570177,0.0001533722,0.24740641,0.00029904302,0.7337079,0.0017085177,0.015601445],"study_design_scores_gemma":[0.000016821981,0.000019503312,0.000109790446,0.00005346413,0.000014560378,0.00001906817,0.000026592304,0.48961678,0.00019749977,0.5093669,0.0005460564,0.000012904641],"about_ca_topic_score_codex":0.0026481082,"about_ca_topic_score_gemma":0.0019880107,"teacher_disagreement_score":0.010408933,"about_ca_system_score_codex":0.0038560668,"about_ca_system_score_gemma":0.0024179157,"threshold_uncertainty_score":0.055048406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02958025,0.0028150415,0.95682806,0.0020159583,0.00018370384,0.000029864565,0.00008677787,0.0001500968,0.008310199],"genre_scores_gemma":[0.66183364,0.006040482,0.29854837,0.00075408915,0.0007022113,0.00022571965,0.0003202569,0.00053817284,0.031037042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972421,0.0015704469,0.00010986684,0.00032442916,0.0005572686,0.000195862],"domain_scores_gemma":[0.99253815,0.005488495,0.00038820464,0.0005286263,0.00062742777,0.00042908217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005283243,0.001208837,0.0021584404,0.002279877,0.0010492796,0.0040634302,0.001915374,0.0024716365,0.0029368266],"category_scores_gemma":[0.017792651,0.001356425,0.0012499195,0.0017908274,0.003766013,0.0077169496,0.004459846,0.005144036,0.00045251683],"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.00004553246,0.000041358024,0.000283346,0.00011099619,0.000040101095,0.000031125208,0.00015687193,0.038411878,0.00057554006,0.9401772,0.0017091951,0.018416839],"study_design_scores_gemma":[0.0000087664275,0.00002967237,0.00014768595,0.00002748017,0.000015313188,0.00004046942,0.000050594692,0.1807508,0.00032018422,0.81709343,0.0015048229,0.000010787231],"about_ca_topic_score_codex":0.0017142621,"about_ca_topic_score_gemma":0.0012095834,"teacher_disagreement_score":0.005283243,"about_ca_system_score_codex":0.002165832,"about_ca_system_score_gemma":0.0013648708,"threshold_uncertainty_score":0.02794075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136378,0.0004095593,0.978933,0.00046068308,0.00017781074,0.000031226624,0.000058930236,0.00023183682,0.006059198],"genre_scores_gemma":[0.5069003,0.0004880117,0.48173746,0.00039438086,0.00018378951,0.00030268263,0.00028009724,0.0005963123,0.009116972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985405,0.00042962682,0.000048327165,0.00022619886,0.0005584244,0.00019699015],"domain_scores_gemma":[0.99181926,0.0062547824,0.00030728593,0.00045798707,0.0009115546,0.00024912012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035272276,0.0014318383,0.0016212194,0.001314374,0.00094054855,0.0024013286,0.0016552615,0.0025632423,0.008079605],"category_scores_gemma":[0.019767052,0.000854252,0.00084490277,0.001123998,0.0017781749,0.0028712798,0.0038900375,0.0032015808,0.0009971068],"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.00025523108,0.00012287278,0.0004964474,0.00033441334,0.000066454835,0.000100070974,0.00018247016,0.73959696,0.004668849,0.18938635,0.0045676315,0.060222227],"study_design_scores_gemma":[0.000010098158,0.00001787595,0.00006357102,0.000024146884,0.0000053234007,0.000014527861,0.000019252584,0.96737915,0.0007875111,0.031086076,0.00058292033,0.000009481937],"about_ca_topic_score_codex":0.0038644462,"about_ca_topic_score_gemma":0.0043867016,"teacher_disagreement_score":0.008079605,"about_ca_system_score_codex":0.0020112502,"about_ca_system_score_gemma":0.0026160544,"threshold_uncertainty_score":0.027029037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05950314,0.00018971972,0.9218468,0.00047088257,0.00009925933,0.00010197569,0.00010699117,0.00028818217,0.017392892],"genre_scores_gemma":[0.60255355,0.00025821372,0.38319483,0.00042976235,0.00008199611,0.0002595917,0.0003680265,0.00028421148,0.012569741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933213,0.00025514356,0.000017993163,0.00009017387,0.0002268755,0.000077677076],"domain_scores_gemma":[0.9992519,0.00038100296,0.00008242124,0.0001050129,0.000116041316,0.00006365565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013364436,0.0007551415,0.00055908976,0.00044782803,0.0003277277,0.0006703508,0.00079905347,0.00056970696,0.004007658],"category_scores_gemma":[0.0027493264,0.00024838824,0.0008247147,0.00029713495,0.001126066,0.0008103657,0.0012830897,0.0017179822,0.00044137935],"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.00022963692,0.00024511604,0.0006811478,0.00017436592,0.000038336697,0.00027844255,0.0001435168,0.62397575,0.009687563,0.24527812,0.006904272,0.112363726],"study_design_scores_gemma":[0.000026534246,0.00005807901,0.00008774077,0.00001225616,0.0000062424265,0.00004166317,0.000021788084,0.9365602,0.0020769192,0.059446774,0.0016544192,0.0000072305347],"about_ca_topic_score_codex":0.0013149562,"about_ca_topic_score_gemma":0.0015172788,"teacher_disagreement_score":0.004007658,"about_ca_system_score_codex":0.0007306552,"about_ca_system_score_gemma":0.0008889947,"threshold_uncertainty_score":0.013406992},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012586252,0.0004844172,0.98980474,0.00090005016,0.00016443894,0.000038992355,0.000077052835,0.00012969332,0.00714199],"genre_scores_gemma":[0.2604559,0.004543494,0.6961448,0.0031809458,0.003248433,0.0012224375,0.00059684494,0.0017100025,0.02889706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99133825,0.0030861131,0.00032114453,0.0010312229,0.0034968008,0.00072649645],"domain_scores_gemma":[0.9743561,0.018406862,0.0009671833,0.0031377412,0.0025195654,0.0006125324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009717066,0.0038426188,0.002513623,0.003285435,0.0016997627,0.005291441,0.0052581085,0.0027485788,0.0104993805],"category_scores_gemma":[0.04820067,0.0015918904,0.002755778,0.0030101284,0.005676197,0.010680351,0.007551739,0.014527877,0.0023133326],"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.000087531465,0.00011652249,0.0002872094,0.00027681046,0.000078261,0.00009484277,0.00018398976,0.08050092,0.0023023158,0.88101053,0.008336813,0.026724337],"study_design_scores_gemma":[0.000010494983,0.000058148067,0.00019385778,0.00007645322,0.000031114538,0.0000665431,0.000030282552,0.4141352,0.0013084246,0.5788991,0.005162858,0.000027533004],"about_ca_topic_score_codex":0.0015893937,"about_ca_topic_score_gemma":0.0018260715,"teacher_disagreement_score":0.0104993805,"about_ca_system_score_codex":0.0033197794,"about_ca_system_score_gemma":0.0029095418,"threshold_uncertainty_score":0.051389337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004408226,0.00074238505,0.955849,0.002167442,0.00044957254,0.0001092103,0.00049377396,0.00009949724,0.03568093],"genre_scores_gemma":[0.3851128,0.003787068,0.52307993,0.0021494995,0.0017759696,0.00081816193,0.0015661403,0.00051531533,0.08119511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921083,0.00027526752,0.000028034876,0.0001761702,0.00021932492,0.000090458765],"domain_scores_gemma":[0.9993667,0.00028752632,0.00005723706,0.00006776137,0.00017624153,0.00004460059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014623933,0.0012661495,0.00124685,0.00076287816,0.00067033264,0.0023031214,0.0025983083,0.0021515735,0.013614597],"category_scores_gemma":[0.0036053823,0.00047532097,0.0014092207,0.00139468,0.0010678555,0.0039848806,0.0016290272,0.0027814726,0.002014765],"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.000046021058,0.000099221455,0.00015449968,0.00024836787,0.000029907515,0.00014935329,0.00006536746,0.1699051,0.0009700701,0.7756407,0.026023585,0.026667811],"study_design_scores_gemma":[0.00003565738,0.000050576124,0.00013597726,0.00006245914,0.000023957276,0.00015597601,0.000049540882,0.6866498,0.0004273301,0.29332837,0.01905906,0.000021231082],"about_ca_topic_score_codex":0.003277391,"about_ca_topic_score_gemma":0.0036347723,"teacher_disagreement_score":0.013614597,"about_ca_system_score_codex":0.0017915597,"about_ca_system_score_gemma":0.0021682046,"threshold_uncertainty_score":0.04554534},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64270276,0.00080674764,0.23872857,0.0026469778,0.00024817014,0.00012411382,0.00032845952,0.00088803965,0.11352614],"genre_scores_gemma":[0.9357971,0.00052496727,0.033077706,0.0006278292,0.00023107452,0.00016520341,0.0003199212,0.00025354186,0.02900256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992453,0.00020771667,0.000026609952,0.0001509634,0.00022019324,0.00014924676],"domain_scores_gemma":[0.99569654,0.0025304828,0.00056455703,0.0002756383,0.00021448235,0.0007183043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065981515,0.0009983225,0.0011570018,0.0018291126,0.0020885644,0.0037621004,0.0016091228,0.0016586811,0.013708445],"category_scores_gemma":[0.005724566,0.001249841,0.0008016221,0.0017090295,0.0027937866,0.004471474,0.0026455703,0.0044111684,0.0015460706],"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.00013624593,0.00006983879,0.00046793337,0.000086478234,0.000013757976,0.00013245367,0.00023188221,0.007554774,0.0016881385,0.9802018,0.002701918,0.006714679],"study_design_scores_gemma":[0.00003899332,0.00003419583,0.0002655025,0.000017660297,0.000013506108,0.00012007466,0.00011057156,0.020701945,0.00084337656,0.9758699,0.0019727591,0.000011442978],"about_ca_topic_score_codex":0.0007458484,"about_ca_topic_score_gemma":0.0012887224,"teacher_disagreement_score":0.013708445,"about_ca_system_score_codex":0.0012592467,"about_ca_system_score_gemma":0.0006264124,"threshold_uncertainty_score":0.045859337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3045814,0.0003101778,0.638983,0.00092177815,0.00019281117,0.00028870197,0.0010218974,0.0034986073,0.05020161],"genre_scores_gemma":[0.78011036,0.00032925373,0.18891898,0.0004193737,0.00011734733,0.00013598811,0.0033891466,0.0006974218,0.02588214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994429,0.00007954502,0.000035190635,0.0001840572,0.00013571228,0.00012270817],"domain_scores_gemma":[0.9989742,0.00035126947,0.00014656196,0.0002543172,0.00018385633,0.00008974246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002648904,0.0008563542,0.00084659434,0.001187704,0.00088213093,0.0029355686,0.0013561617,0.0013283911,0.013526778],"category_scores_gemma":[0.00253447,0.00078607263,0.0008610193,0.0014462294,0.0007625893,0.0044144094,0.0021002295,0.0019919977,0.002846233],"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.00047330133,0.00038097877,0.007044745,0.00069115846,0.000086136235,0.0013328592,0.0009898287,0.10986453,0.040255338,0.48537248,0.028330198,0.3251785],"study_design_scores_gemma":[0.000044596254,0.00015141998,0.0019144795,0.00008191562,0.00005349647,0.0007299543,0.0007984269,0.45853698,0.024990559,0.48751673,0.025133913,0.0000475955],"about_ca_topic_score_codex":0.001680529,"about_ca_topic_score_gemma":0.0030184644,"teacher_disagreement_score":0.013526778,"about_ca_system_score_codex":0.00065973215,"about_ca_system_score_gemma":0.00044526215,"threshold_uncertainty_score":0.04525155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029838065,0.0008614264,0.95638883,0.0017184675,0.00012557939,0.00012122292,0.00041569708,0.0006352675,0.009895428],"genre_scores_gemma":[0.5271165,0.0017237292,0.45693663,0.0007109176,0.00048732889,0.00052322604,0.0016287033,0.00068084983,0.010192186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787354,0.0006237122,0.000089973066,0.0005227156,0.0005798659,0.0003101927],"domain_scores_gemma":[0.9856523,0.0104769245,0.000798951,0.0020102013,0.0005706693,0.0004909216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025300991,0.0016885671,0.002379201,0.0023872594,0.0014133172,0.0042050024,0.0056985645,0.0027049053,0.010120317],"category_scores_gemma":[0.025513627,0.0013434573,0.002037754,0.005257165,0.002528783,0.011771661,0.0043068635,0.006062068,0.0011389999],"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.0002541336,0.0002537881,0.0012157777,0.0003300654,0.000094123054,0.00011152177,0.00036508893,0.38055173,0.0008808668,0.5114534,0.014941789,0.089547694],"study_design_scores_gemma":[0.000041950676,0.000022528751,0.00013513668,0.000027703887,0.000027344386,0.00005343095,0.00006071971,0.57212734,0.00027733773,0.42536297,0.0018529084,0.000010625664],"about_ca_topic_score_codex":0.0035239274,"about_ca_topic_score_gemma":0.0045998027,"teacher_disagreement_score":0.010120317,"about_ca_system_score_codex":0.003475751,"about_ca_system_score_gemma":0.0018309025,"threshold_uncertainty_score":0.033855796},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48901013,0.00053073815,0.48403624,0.0010998,0.00012207768,0.00014734975,0.0014328755,0.0015061233,0.0221146],"genre_scores_gemma":[0.8202389,0.00036874347,0.16397657,0.00031244842,0.00010009516,0.00008268328,0.004024607,0.00037109051,0.01052488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949276,0.000069655754,0.00004092266,0.00017832807,0.00010720617,0.000111178655],"domain_scores_gemma":[0.99839574,0.0005719528,0.00023039861,0.00032817147,0.0003181988,0.00015544804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003210179,0.0006375569,0.0006969662,0.00092580024,0.00068914774,0.0027587975,0.0013065534,0.0009659385,0.0051042624],"category_scores_gemma":[0.0028049015,0.0005204954,0.00072818465,0.0011630987,0.0005992451,0.005145195,0.0015140502,0.00164434,0.001339012],"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.0005584446,0.00049184944,0.017907256,0.00063108903,0.00010783335,0.0010395348,0.0015619142,0.07580491,0.043282375,0.50768447,0.023811368,0.3271188],"study_design_scores_gemma":[0.000030723153,0.00007084871,0.0023707133,0.000059987226,0.000048334583,0.00057975645,0.00077201996,0.27007896,0.015199836,0.6944838,0.016270787,0.000034124096],"about_ca_topic_score_codex":0.0021975175,"about_ca_topic_score_gemma":0.0038798202,"teacher_disagreement_score":0.0051042624,"about_ca_system_score_codex":0.0006260844,"about_ca_system_score_gemma":0.0006314869,"threshold_uncertainty_score":0.017075479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024679808,0.0006776609,0.9356374,0.0012230832,0.0003760947,0.000059999562,0.00019236773,0.0003793214,0.036774248],"genre_scores_gemma":[0.5752297,0.0028028355,0.37307724,0.0013922788,0.000755092,0.00038049102,0.00042038228,0.0008118779,0.045130014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938154,0.00021638577,0.000025261666,0.000098334705,0.00019290255,0.00008556512],"domain_scores_gemma":[0.9972421,0.0016470836,0.0001886362,0.00028393502,0.00042739007,0.00021090724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018382549,0.0010002418,0.0009434147,0.001516563,0.0008759888,0.0024212557,0.0012265414,0.0010223555,0.009744936],"category_scores_gemma":[0.008582969,0.00056478643,0.0010549442,0.002286241,0.0023420646,0.004303164,0.002750672,0.00382158,0.0016525696],"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.000047150275,0.000040409268,0.00017623282,0.00005410736,0.000011677213,0.000054875734,0.000074233554,0.009517716,0.0015124456,0.9660393,0.003920966,0.01855078],"study_design_scores_gemma":[0.000020974763,0.00003350869,0.0001205083,0.000021441654,0.000015028679,0.00004750325,0.000029967869,0.116960615,0.0009698406,0.87687904,0.0048833177,0.000018273868],"about_ca_topic_score_codex":0.0021373243,"about_ca_topic_score_gemma":0.0024712582,"teacher_disagreement_score":0.009744936,"about_ca_system_score_codex":0.0012824856,"about_ca_system_score_gemma":0.0013843898,"threshold_uncertainty_score":0.032600105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23819385,0.0011065204,0.5609727,0.0041310857,0.00045077776,0.000099207675,0.0009863278,0.00027894377,0.1937807],"genre_scores_gemma":[0.8647683,0.0010678014,0.0699181,0.00077081757,0.0004823409,0.0003075463,0.00089818775,0.00037694944,0.06141003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988194,0.00040078282,0.000050335122,0.00033955887,0.00021161605,0.00017825143],"domain_scores_gemma":[0.9961902,0.0017571938,0.000432482,0.00038565198,0.0007026255,0.0005317547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015635227,0.00079243263,0.0011350883,0.0029347367,0.002676984,0.00455747,0.0014626378,0.001280437,0.015673885],"category_scores_gemma":[0.0046351533,0.00086075754,0.0011864507,0.002746513,0.0033372894,0.0072866767,0.0031780484,0.0041015283,0.0012042307],"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.0000040975215,0.0000044069584,0.000031199346,0.0000071979257,0.0000015614631,0.000007359652,0.000052257197,0.00010543276,0.000054725602,0.99864405,0.00027423253,0.00081340334],"study_design_scores_gemma":[0.00000535564,0.0000031389332,0.000036484893,0.000005227398,0.0000041356384,0.000033266762,0.00005637584,0.0011160736,0.00008192403,0.99722433,0.001430289,0.0000033534884],"about_ca_topic_score_codex":0.00088241504,"about_ca_topic_score_gemma":0.0009243679,"teacher_disagreement_score":0.015673885,"about_ca_system_score_codex":0.0015986505,"about_ca_system_score_gemma":0.000669059,"threshold_uncertainty_score":0.052434325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002851975,0.00020315932,0.9911712,0.00025892403,0.00010617671,0.000036734687,0.000091113136,0.0007324083,0.004548301],"genre_scores_gemma":[0.13527295,0.0004230175,0.84652346,0.00033991126,0.00027836647,0.00032574736,0.00053965196,0.0009264783,0.015370469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881506,0.00030684995,0.00004008749,0.00015383205,0.00060726516,0.00007685543],"domain_scores_gemma":[0.99776506,0.000822366,0.00013607039,0.00062243384,0.0005256781,0.0001283402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013211507,0.00091327174,0.0010672758,0.0007106463,0.00058291864,0.0010968361,0.0020302692,0.001351209,0.008301167],"category_scores_gemma":[0.0058545377,0.0005984765,0.00074436085,0.0011482118,0.0008311159,0.0014542997,0.0026887998,0.0026618354,0.0023705165],"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.00032337257,0.00017208411,0.0006509628,0.00036031098,0.00016137825,0.00012850297,0.00010115077,0.39655483,0.013068932,0.15806364,0.041227866,0.38918695],"study_design_scores_gemma":[0.000016275291,0.000010324693,0.000058619247,0.000007322749,0.0000062195927,0.000020751182,0.000005122195,0.97916234,0.00090505334,0.016967703,0.0028336956,0.0000066070156],"about_ca_topic_score_codex":0.0042969105,"about_ca_topic_score_gemma":0.008530563,"teacher_disagreement_score":0.008301167,"about_ca_system_score_codex":0.00070880895,"about_ca_system_score_gemma":0.002065596,"threshold_uncertainty_score":0.027770162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40363374,0.0030351465,0.49484205,0.018693196,0.00033550366,0.00018312778,0.0012457606,0.00018379264,0.07784775],"genre_scores_gemma":[0.97033274,0.0012224072,0.02135025,0.00030591438,0.0004032138,0.00013094163,0.00029118737,0.000076422744,0.0058868774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971771,0.0012604012,0.000102532416,0.0002893399,0.0008504432,0.00032016227],"domain_scores_gemma":[0.9708228,0.024753433,0.0015850209,0.0009400248,0.0010528044,0.0008459263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039765774,0.00057801243,0.0020534552,0.0013853175,0.0012168157,0.005205969,0.0017813906,0.0021002616,0.006923098],"category_scores_gemma":[0.027166786,0.0008017626,0.0014289089,0.0016897774,0.0022095502,0.0089864265,0.0021011012,0.0036948519,0.00037654382],"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.00011394602,0.00008613253,0.0013230727,0.00013490078,0.000038848273,0.00018007288,0.00016330421,0.13338657,0.0003893287,0.8518731,0.003458397,0.008852326],"study_design_scores_gemma":[0.000019757137,0.000010894301,0.000376212,0.000020435411,0.000012245626,0.00006601446,0.000049088714,0.2418802,0.00008447042,0.7567997,0.0006681874,0.000012688271],"about_ca_topic_score_codex":0.002509529,"about_ca_topic_score_gemma":0.0017488227,"teacher_disagreement_score":0.006923098,"about_ca_system_score_codex":0.002975856,"about_ca_system_score_gemma":0.0023025572,"threshold_uncertainty_score":0.0231601},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15969254,0.0010131199,0.6655883,0.0455707,0.0023421678,0.00042346132,0.0015040651,0.0021486208,0.121717036],"genre_scores_gemma":[0.89310277,0.00043690953,0.07466273,0.005901331,0.00078293757,0.00042162024,0.0005617083,0.00066082634,0.023469156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99421483,0.0022626428,0.0003006784,0.0011323572,0.0012236276,0.0008658443],"domain_scores_gemma":[0.9691571,0.023541488,0.0009265491,0.004193999,0.0014312861,0.0007495034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006524959,0.0010651904,0.002211604,0.0022516083,0.0038101461,0.004868436,0.003828433,0.006316725,0.016710673],"category_scores_gemma":[0.054425385,0.0011247558,0.0035764212,0.0019298263,0.007081144,0.012314008,0.007557878,0.0061545433,0.0015732925],"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.00019200827,0.0000648696,0.00068518275,0.000106739746,0.000050334336,0.00040643365,0.00041061203,0.0024952535,0.0006503223,0.9831903,0.007803879,0.0039440487],"study_design_scores_gemma":[0.00011616082,0.0000425387,0.00039335678,0.000051140043,0.000059189897,0.00038093538,0.00016962338,0.043751296,0.0015813195,0.94787836,0.0055178814,0.00005828191],"about_ca_topic_score_codex":0.0016054644,"about_ca_topic_score_gemma":0.0010979159,"teacher_disagreement_score":0.016710673,"about_ca_system_score_codex":0.0015117913,"about_ca_system_score_gemma":0.0021808667,"threshold_uncertainty_score":0.05590278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026928378,0.0005256947,0.951554,0.0007917801,0.00009206483,0.0000414621,0.0003056954,0.00018848153,0.019572394],"genre_scores_gemma":[0.905399,0.0006156283,0.07262911,0.0001439147,0.000085909836,0.00012445138,0.00033833686,0.00007105832,0.020592531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996941,0.000107007625,0.000008904303,0.00006765757,0.00007753821,0.000044742734],"domain_scores_gemma":[0.99935144,0.0004287453,0.000071505056,0.000028451645,0.00008254627,0.00003730832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423411,0.00065451104,0.00091713166,0.0004102079,0.00028507458,0.0014407913,0.0014254004,0.0015969443,0.0051451386],"category_scores_gemma":[0.0018155013,0.00044672188,0.0005962765,0.00083000626,0.0007242682,0.0009944859,0.00060286815,0.0018441358,0.00050574116],"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.000016908112,0.000017788734,0.0000833604,0.000020756814,0.000005977569,0.000030314044,0.000015452053,0.97664297,0.00026454442,0.019711059,0.00054883165,0.0026420015],"study_design_scores_gemma":[0.000003540942,0.000005423366,0.000020293768,0.0000019591096,0.0000014818925,0.0000046224186,0.00000252565,0.99704534,0.00002430707,0.002620175,0.00026876328,0.0000015915771],"about_ca_topic_score_codex":0.01179655,"about_ca_topic_score_gemma":0.007407399,"teacher_disagreement_score":0.01179655,"about_ca_system_score_codex":0.0011289513,"about_ca_system_score_gemma":0.0011876763,"threshold_uncertainty_score":0.023455799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072052157,0.00094241765,0.96384555,0.0020714877,0.00014868256,0.000034503875,0.00017726273,0.00011154283,0.025463315],"genre_scores_gemma":[0.46313727,0.0035825307,0.4716497,0.0015322024,0.0012640073,0.0004532807,0.00043224698,0.00058294326,0.05736584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990766,0.00038998201,0.00004019397,0.00019815813,0.00018403887,0.00011105058],"domain_scores_gemma":[0.9988715,0.00041843063,0.00010963323,0.00019507327,0.0002196508,0.00018560169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026573173,0.0015070537,0.0016798836,0.0021780801,0.0019288035,0.0036211656,0.0027925528,0.0025139123,0.0117856935],"category_scores_gemma":[0.004295171,0.0010296337,0.0024685278,0.0020381177,0.003687189,0.006842388,0.0042340294,0.004584188,0.0011836011],"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.0000023146001,0.000004956038,0.00002486482,0.000012674674,0.0000035280311,0.000011038138,0.000018429831,0.0036784466,0.00008010701,0.99476,0.0004956525,0.00090789807],"study_design_scores_gemma":[0.000003283549,0.000006400736,0.00004166288,0.000010592373,0.000005032833,0.000021761389,0.000015724536,0.038382944,0.000044940993,0.95797545,0.003485678,0.000006360484],"about_ca_topic_score_codex":0.0030953458,"about_ca_topic_score_gemma":0.0038553379,"teacher_disagreement_score":0.0117856935,"about_ca_system_score_codex":0.0031703687,"about_ca_system_score_gemma":0.001950342,"threshold_uncertainty_score":0.039427042},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085180126,0.0011934971,0.89000845,0.0016292252,0.0003374032,0.0002958227,0.001708674,0.0051034526,0.014543287],"genre_scores_gemma":[0.3925232,0.0010025426,0.5876303,0.00055044744,0.00017627787,0.0004089281,0.0038051608,0.0018170648,0.012086043],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974915,0.00055791356,0.00014419651,0.0003334208,0.0011463767,0.00032656893],"domain_scores_gemma":[0.9877588,0.007921702,0.00041627756,0.002754333,0.0009038938,0.00024509357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017274924,0.00091314997,0.001625224,0.0024529018,0.00094955094,0.0021394528,0.0018012689,0.0011707218,0.011749139],"category_scores_gemma":[0.018554633,0.00086122804,0.001369414,0.003622451,0.001366382,0.005925966,0.0027847637,0.003100907,0.0023618923],"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.000827483,0.00031755774,0.0017162065,0.00066893845,0.000092279566,0.00025692096,0.0005541623,0.23764503,0.008721586,0.22359978,0.017496975,0.50810313],"study_design_scores_gemma":[0.00008938624,0.00009908526,0.00029622004,0.000110271525,0.000066307344,0.00007240306,0.00012081599,0.52794504,0.0067460886,0.4522524,0.01217832,0.00002372218],"about_ca_topic_score_codex":0.00398706,"about_ca_topic_score_gemma":0.0073602353,"teacher_disagreement_score":0.011749139,"about_ca_system_score_codex":0.0015520348,"about_ca_system_score_gemma":0.0028698894,"threshold_uncertainty_score":0.039304793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010063586,0.0008593524,0.9852446,0.0011238595,0.00008668993,0.00006672628,0.00010834319,0.00019062139,0.0022562332],"genre_scores_gemma":[0.6064378,0.0030342988,0.37333,0.0011971182,0.0012771457,0.0014433227,0.0011464234,0.0009277832,0.011206119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915172,0.004098729,0.00038309503,0.0008924134,0.002583162,0.00052541716],"domain_scores_gemma":[0.8751484,0.11268695,0.0031183637,0.0038197937,0.0038309265,0.0013955631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0142687755,0.0026734956,0.0032366046,0.0028318914,0.0010184995,0.0041443203,0.0041504414,0.003362385,0.005964658],"category_scores_gemma":[0.0935134,0.0016491055,0.0021850013,0.0026501669,0.0043607503,0.009517741,0.0050436,0.008550966,0.0006785082],"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.00039990156,0.00023694515,0.002077112,0.0004658273,0.00021112307,0.00013757352,0.00017493572,0.5233129,0.0014981665,0.43379724,0.0036643913,0.034023996],"study_design_scores_gemma":[0.000017711973,0.00003387019,0.00021112419,0.000020421323,0.000015435271,0.000019134211,0.000010144732,0.8861894,0.00024969465,0.1129735,0.00024676585,0.000012709355],"about_ca_topic_score_codex":0.002983883,"about_ca_topic_score_gemma":0.0026475566,"teacher_disagreement_score":0.0142687755,"about_ca_system_score_codex":0.0038132619,"about_ca_system_score_gemma":0.0033635644,"threshold_uncertainty_score":0.07546139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33138287,0.0009782254,0.54544395,0.0023348676,0.00011399531,0.00013324352,0.0013794992,0.0004093951,0.11782387],"genre_scores_gemma":[0.93218637,0.00043189235,0.04015844,0.00041530124,0.0002554652,0.00011639777,0.0011850864,0.00021749306,0.025033686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897814,0.00017658663,0.000050902607,0.00029949954,0.00031015958,0.00018490736],"domain_scores_gemma":[0.9958883,0.0021272243,0.00043254453,0.0002830913,0.000554503,0.00071435363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015547681,0.0008759838,0.0011407395,0.0028584674,0.0020084316,0.00351374,0.0022991411,0.0008397028,0.0102682635],"category_scores_gemma":[0.006050868,0.0008017971,0.001001721,0.0018969607,0.0032831675,0.004793895,0.00399489,0.0030334163,0.0007707921],"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.00004276597,0.000024701218,0.00033656685,0.000051485542,0.000009704071,0.00003851234,0.00018543642,0.0017161405,0.0012117648,0.9909696,0.0010595203,0.0043538623],"study_design_scores_gemma":[0.000014641322,0.000026202437,0.0005877492,0.000020224803,0.000012994349,0.00009878536,0.00010165379,0.017254697,0.0012538949,0.97737896,0.003235796,0.000014427505],"about_ca_topic_score_codex":0.0015196233,"about_ca_topic_score_gemma":0.001376642,"teacher_disagreement_score":0.0102682635,"about_ca_system_score_codex":0.002444289,"about_ca_system_score_gemma":0.0008429061,"threshold_uncertainty_score":0.034350812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33869386,0.0008758178,0.5623104,0.0021858006,0.00038074222,0.00014419902,0.0010306014,0.0006295994,0.09374897],"genre_scores_gemma":[0.915765,0.0006522876,0.051621687,0.00040135664,0.00029439095,0.0002600703,0.0010636261,0.00048244483,0.029459162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988335,0.00021988725,0.000049851133,0.00017235888,0.0004920074,0.00023242956],"domain_scores_gemma":[0.9978613,0.0009936917,0.00022920959,0.00016951347,0.00026680832,0.0004794765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011304801,0.0010800636,0.0014350599,0.0029780522,0.0023234324,0.0054258704,0.0013503773,0.0016270183,0.019187387],"category_scores_gemma":[0.0044275015,0.0007979373,0.0013825203,0.0012795689,0.0027201585,0.0037038657,0.0034339728,0.0037001108,0.0020389783],"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.000036053294,0.000032481537,0.00014265855,0.000040928837,0.000009914939,0.0000528738,0.00006937614,0.004703245,0.0007724053,0.9898177,0.0014208632,0.002901538],"study_design_scores_gemma":[0.0000231053,0.000020020509,0.00015452447,0.000015141543,0.000005331468,0.00005128531,0.00006184679,0.03927748,0.00047987493,0.95857096,0.001321033,0.000019433766],"about_ca_topic_score_codex":0.0012374653,"about_ca_topic_score_gemma":0.0014254738,"teacher_disagreement_score":0.019187387,"about_ca_system_score_codex":0.0013931302,"about_ca_system_score_gemma":0.001185404,"threshold_uncertainty_score":0.06418824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039624567,0.0009511942,0.9878983,0.00051925937,0.00012361935,0.000054650853,0.00007269494,0.00054596626,0.0058718827],"genre_scores_gemma":[0.34213498,0.0015905092,0.6474007,0.0006242528,0.00045804016,0.00062219275,0.0005471859,0.00041348685,0.006208766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976676,0.0011930709,0.000094524024,0.00024459793,0.0005976256,0.0002024679],"domain_scores_gemma":[0.991663,0.006512837,0.0005458965,0.00037021592,0.00075697893,0.00015110253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045882524,0.0017634546,0.002242981,0.0012650422,0.0006747115,0.0029481244,0.0016407665,0.0015049415,0.0067432714],"category_scores_gemma":[0.012800988,0.0007227475,0.00091570977,0.0019302407,0.0014831185,0.0018875307,0.0019677202,0.003954258,0.0017372626],"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.00008518792,0.00007659952,0.0003540028,0.00016401136,0.00004355033,0.000036463603,0.000030817704,0.8793586,0.00029034485,0.054174103,0.0034246582,0.061961677],"study_design_scores_gemma":[0.000005138494,0.000010843504,0.000017087312,0.000016220629,0.0000026106738,0.0000041209532,0.000002055279,0.9841769,0.00009805117,0.01502062,0.00064427743,0.0000021872072],"about_ca_topic_score_codex":0.0028897102,"about_ca_topic_score_gemma":0.0025483866,"teacher_disagreement_score":0.0067432714,"about_ca_system_score_codex":0.0015397691,"about_ca_system_score_gemma":0.0021860267,"threshold_uncertainty_score":0.02426523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045277253,0.00021946042,0.9883598,0.00021445434,0.00012649994,0.00010402665,0.0001288877,0.00090001686,0.0054190294],"genre_scores_gemma":[0.058247596,0.0002586674,0.9358064,0.00016505591,0.000090095644,0.0003673209,0.00052408286,0.00041302544,0.0041278074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.00022826537,0.00004767526,0.00021011772,0.00029963168,0.00016223638],"domain_scores_gemma":[0.99817014,0.001148034,0.00009210563,0.00016163223,0.00033072804,0.00009738476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012025567,0.001934355,0.0021406494,0.0016806282,0.001343426,0.003163106,0.0027065058,0.0025833666,0.013986702],"category_scores_gemma":[0.0044015483,0.0013851837,0.0014975793,0.003342799,0.00081985124,0.0029328982,0.0026664308,0.0032186878,0.0032961597],"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.00022508118,0.00033481073,0.00036690672,0.00024524424,0.00008073527,0.00011933196,0.0000835412,0.6590691,0.0019185324,0.037148595,0.011762624,0.2886455],"study_design_scores_gemma":[0.0000987977,0.000045777684,0.000071923,0.000020194333,0.000012974288,0.00004284258,0.00002643947,0.9788472,0.00042197222,0.017678367,0.002718492,0.000015088579],"about_ca_topic_score_codex":0.008465788,"about_ca_topic_score_gemma":0.008328427,"teacher_disagreement_score":0.013986702,"about_ca_system_score_codex":0.0014316454,"about_ca_system_score_gemma":0.0032535533,"threshold_uncertainty_score":0.046790183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09399809,0.0017232014,0.82820547,0.0032764906,0.00020189703,0.00011034709,0.0006776952,0.00067179545,0.071135096],"genre_scores_gemma":[0.6975514,0.0015345954,0.27198172,0.0007844976,0.00037820626,0.00035374446,0.0008381911,0.00026590397,0.026311714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775153,0.0007477578,0.00011674666,0.00056634867,0.0005505009,0.000267142],"domain_scores_gemma":[0.99589145,0.0024400896,0.00037715008,0.0004168572,0.0006166148,0.00025783165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017302823,0.0006224835,0.0009361753,0.00095461257,0.0009880018,0.0026541285,0.0011953891,0.0006718417,0.011780095],"category_scores_gemma":[0.006925036,0.0004348663,0.000780713,0.0024314448,0.002699652,0.004347219,0.003037259,0.0029330072,0.001405721],"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.0000952394,0.000050190458,0.00028520296,0.000121703546,0.000012231119,0.00007137742,0.0002050928,0.016721413,0.00065100077,0.95709056,0.003463652,0.021232238],"study_design_scores_gemma":[0.000031114385,0.000042553806,0.00015870252,0.000046255198,0.000012246382,0.000112217036,0.00014932187,0.08663759,0.0006782149,0.8980884,0.0140268905,0.000016569607],"about_ca_topic_score_codex":0.0024255267,"about_ca_topic_score_gemma":0.0025272353,"teacher_disagreement_score":0.011780095,"about_ca_system_score_codex":0.0023086888,"about_ca_system_score_gemma":0.0011308149,"threshold_uncertainty_score":0.039408326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21282329,0.0007594311,0.7320397,0.0026016855,0.00017038976,0.00014857309,0.00035975492,0.0003525743,0.05074455],"genre_scores_gemma":[0.9593309,0.0003979183,0.018897496,0.0001828675,0.00010186966,0.000211706,0.00016698969,0.00008697997,0.020623267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998678,0.0007003679,0.000041794265,0.0002121565,0.00013985,0.00022779788],"domain_scores_gemma":[0.9944788,0.0036548018,0.0006191709,0.00028354547,0.00048728942,0.00047643148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018458071,0.00095339137,0.0017635705,0.001005019,0.000896188,0.0030575667,0.002335176,0.0016087429,0.00862704],"category_scores_gemma":[0.011067687,0.00073086924,0.0008428981,0.0011513842,0.002254704,0.0025079348,0.0019937702,0.0019521464,0.00063865556],"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.00015149597,0.000099008335,0.00033566263,0.000103139886,0.000039692135,0.00005652855,0.00014109576,0.26126146,0.0012298988,0.7262725,0.0028783628,0.007431137],"study_design_scores_gemma":[0.000029761182,0.000024528179,0.000084584906,0.000014645217,0.000008883137,0.000008675216,0.000043740933,0.53333867,0.0002312545,0.4655566,0.0006496139,0.00000905252],"about_ca_topic_score_codex":0.0032545403,"about_ca_topic_score_gemma":0.0023533672,"teacher_disagreement_score":0.00862704,"about_ca_system_score_codex":0.0029381393,"about_ca_system_score_gemma":0.0019420082,"threshold_uncertainty_score":0.028860271},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4350491,0.0024036162,0.335354,0.008786525,0.00041568367,0.00016340645,0.0010912609,0.0006463923,0.21609005],"genre_scores_gemma":[0.9264651,0.0012611854,0.04923093,0.0009880416,0.0005847645,0.00015534718,0.00091062527,0.00024671026,0.020157212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899703,0.00029078856,0.000047460875,0.00016545581,0.00029766795,0.00020147944],"domain_scores_gemma":[0.9975388,0.0013371164,0.00023296903,0.00024972513,0.00023561632,0.00040581342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012239366,0.0008062641,0.0014402693,0.0026081868,0.0026888843,0.004126968,0.0016243119,0.0015984076,0.009755718],"category_scores_gemma":[0.0051670936,0.00057920115,0.0014248373,0.0025608074,0.0037963793,0.008119005,0.0029833706,0.0047289636,0.0008663508],"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.000008805719,0.000013934257,0.000071165596,0.000021773338,0.0000031183943,0.000018163682,0.00008867088,0.0007933169,0.00014146195,0.9964281,0.0007682451,0.0016432267],"study_design_scores_gemma":[0.000004836836,0.000002850861,0.00006543269,0.000004555432,0.000002293958,0.000013096538,0.000025188852,0.004158615,0.000037693484,0.99507457,0.0006065193,0.0000044008743],"about_ca_topic_score_codex":0.0030967128,"about_ca_topic_score_gemma":0.0032847172,"teacher_disagreement_score":0.009755718,"about_ca_system_score_codex":0.002787,"about_ca_system_score_gemma":0.0013344581,"threshold_uncertainty_score":0.032636166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29311877,0.0018590088,0.659976,0.00256186,0.00036527662,0.00010237672,0.00035262617,0.00046867834,0.041195385],"genre_scores_gemma":[0.9385894,0.001026971,0.03515485,0.0007002843,0.00042883502,0.00012635195,0.000311256,0.00038496137,0.02327706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996222,0.00010666321,0.000018702443,0.00011321974,0.00006679041,0.00007247017],"domain_scores_gemma":[0.9978746,0.00079840265,0.00039324982,0.0002353906,0.00027851196,0.00041982083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006890312,0.0007481499,0.0011105457,0.0018602604,0.001011074,0.002094836,0.0013033735,0.0015286228,0.005464766],"category_scores_gemma":[0.004530414,0.0005982997,0.0010734985,0.0006621049,0.0032071036,0.003794225,0.0027382765,0.0019285273,0.0005040908],"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.000028937713,0.00003925925,0.0005753412,0.00006933374,0.000022530845,0.00007986507,0.00019328833,0.031628232,0.0016486278,0.9597494,0.0019759578,0.0039893105],"study_design_scores_gemma":[0.000013883964,0.000027448623,0.0006024688,0.000018592445,0.000008876792,0.00008817096,0.0000885061,0.34366983,0.00046122255,0.653576,0.001422868,0.000022220858],"about_ca_topic_score_codex":0.002698458,"about_ca_topic_score_gemma":0.0021340856,"teacher_disagreement_score":0.005464766,"about_ca_system_score_codex":0.0012294954,"about_ca_system_score_gemma":0.000693897,"threshold_uncertainty_score":0.01828146},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13314958,0.0012125896,0.81688815,0.009429887,0.00029444112,0.0003737768,0.0019656066,0.00097360037,0.035712346],"genre_scores_gemma":[0.8638823,0.00099528,0.07752977,0.0010794405,0.0004248107,0.0006047848,0.0010612163,0.0004515347,0.053970788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964019,0.0018364519,0.00008893965,0.00070457935,0.00036585776,0.00060226716],"domain_scores_gemma":[0.9806331,0.014859938,0.0012813275,0.0016099366,0.00064404187,0.0009716602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045829546,0.0012779576,0.004399503,0.0013805986,0.0016933009,0.0043036295,0.006303525,0.006171576,0.021299258],"category_scores_gemma":[0.02469608,0.0016910987,0.0012864597,0.0034730565,0.0030530032,0.010065397,0.003426626,0.0052631935,0.002442757],"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.0007388883,0.00047947982,0.00083969865,0.00030913792,0.00010106753,0.00038093215,0.00021065929,0.29119533,0.000682818,0.66427326,0.017921006,0.022867732],"study_design_scores_gemma":[0.00010992069,0.000046259425,0.0001337109,0.000019723355,0.00002282329,0.00006878129,0.00005852398,0.6518521,0.00019341457,0.34610933,0.0013628482,0.000022644079],"about_ca_topic_score_codex":0.0050349617,"about_ca_topic_score_gemma":0.005120325,"teacher_disagreement_score":0.021299258,"about_ca_system_score_codex":0.003041329,"about_ca_system_score_gemma":0.002933112,"threshold_uncertainty_score":0.07125318},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012583911,0.0068624658,0.9756495,0.0017645427,0.00013649745,0.000023996805,0.000120716286,0.000118555414,0.002739919],"genre_scores_gemma":[0.5998802,0.024574619,0.35810897,0.0011058898,0.0037101607,0.00049967534,0.0007058194,0.0007191463,0.010695453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945715,0.003336355,0.00022735437,0.00079454656,0.00086054136,0.0002096435],"domain_scores_gemma":[0.929364,0.06312292,0.002152595,0.0025307857,0.00227901,0.00055060594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011075529,0.0017460819,0.0037535534,0.003512555,0.0012376227,0.0053391345,0.002864623,0.003165538,0.0017930032],"category_scores_gemma":[0.05840168,0.0019042423,0.002037149,0.0043466953,0.0077701323,0.014731769,0.003958572,0.0062407325,0.0005604225],"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.00004980116,0.000030076579,0.0006322213,0.00016761503,0.000048785783,0.000040701292,0.00015331457,0.08191165,0.0003744028,0.89865255,0.0013266543,0.016612135],"study_design_scores_gemma":[0.000006330133,0.000016719803,0.00022420312,0.000056497985,0.00001599833,0.00004180443,0.000016882608,0.22082753,0.00026975878,0.77759695,0.00089262385,0.00003471117],"about_ca_topic_score_codex":0.0023688877,"about_ca_topic_score_gemma":0.0015604419,"teacher_disagreement_score":0.011075529,"about_ca_system_score_codex":0.002465274,"about_ca_system_score_gemma":0.0023502458,"threshold_uncertainty_score":0.058573663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1857145,0.0006903211,0.7563536,0.0016846556,0.00013471364,0.00014554393,0.0017759246,0.00029552315,0.053205203],"genre_scores_gemma":[0.79734313,0.0012238793,0.16524483,0.0005440449,0.00014815727,0.00037603287,0.0017444569,0.00025877234,0.033116687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993376,0.0002101435,0.00003181749,0.00012035609,0.00015880507,0.0001412378],"domain_scores_gemma":[0.9970276,0.0015688256,0.00032823224,0.00019272717,0.000385205,0.0004974418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014103693,0.0010775359,0.001270974,0.0019083784,0.0012974142,0.0029830672,0.0015506468,0.0013684793,0.015075616],"category_scores_gemma":[0.0059775864,0.0007790539,0.00091331574,0.0017920015,0.0011186672,0.0046653464,0.0027669023,0.0027884354,0.0012943551],"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.00022372059,0.00008870013,0.0005012846,0.00024261768,0.000029506895,0.00020824495,0.00015458089,0.04675356,0.0022464262,0.929029,0.0042950073,0.016227316],"study_design_scores_gemma":[0.000041116535,0.00006990337,0.00031661705,0.000065317996,0.000020336736,0.00022305298,0.00013202742,0.109402776,0.0011543515,0.88312495,0.005428879,0.000020581365],"about_ca_topic_score_codex":0.0009617011,"about_ca_topic_score_gemma":0.0015117999,"teacher_disagreement_score":0.015075616,"about_ca_system_score_codex":0.0014032004,"about_ca_system_score_gemma":0.0008851328,"threshold_uncertainty_score":0.05043298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03785624,0.001023617,0.9034601,0.002619895,0.00076614355,0.00048310857,0.0010986617,0.0050455052,0.04764672],"genre_scores_gemma":[0.13705279,0.00044690704,0.84083635,0.0007779642,0.00019704337,0.00058064796,0.0025744694,0.0009793709,0.016554566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998367,0.00028312983,0.0000899014,0.00041226076,0.0004843912,0.00036333338],"domain_scores_gemma":[0.99783945,0.0010181915,0.00013067356,0.00046772894,0.00034144052,0.00020253175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015089127,0.0022325942,0.0022494488,0.002052454,0.0016198439,0.0034873146,0.005440091,0.0033493713,0.027401846],"category_scores_gemma":[0.0067400015,0.0011138651,0.0023659663,0.003912234,0.001049643,0.0045213676,0.0037827129,0.004908167,0.0047920938],"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.0010807206,0.0012618977,0.00128555,0.000545908,0.00021670685,0.0001877204,0.0002568659,0.24834117,0.005369659,0.072203934,0.075386934,0.59386295],"study_design_scores_gemma":[0.0002302912,0.00013241965,0.000357102,0.00006182371,0.00007995083,0.0001447808,0.000091878406,0.9433017,0.0018972264,0.045105863,0.008568961,0.000027994942],"about_ca_topic_score_codex":0.009200777,"about_ca_topic_score_gemma":0.014518738,"teacher_disagreement_score":0.027401846,"about_ca_system_score_codex":0.003845016,"about_ca_system_score_gemma":0.0049294266,"threshold_uncertainty_score":0.09166825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015714929,0.0006596229,0.9736439,0.0010172286,0.00010712011,0.0000565595,0.00004764741,0.000073072086,0.008679896],"genre_scores_gemma":[0.6684043,0.0011134276,0.30730146,0.000509045,0.00059748517,0.00051497674,0.00029022028,0.0006589301,0.020610202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976888,0.0012417944,0.00006888888,0.00029355986,0.0005707536,0.00013624957],"domain_scores_gemma":[0.98815954,0.009051077,0.0008666437,0.0005586762,0.0010210045,0.00034312057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005818754,0.0016412055,0.0018407835,0.0014772668,0.00096093776,0.003145894,0.0021202324,0.0025444769,0.004951993],"category_scores_gemma":[0.027341176,0.0011339065,0.0012314176,0.0015137079,0.0028698333,0.004810577,0.003770646,0.003933234,0.00048765834],"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.00013381283,0.00014343034,0.0006934784,0.00023336282,0.0000731446,0.0001256504,0.00013730499,0.4545157,0.0018596598,0.5088379,0.0042575323,0.028989105],"study_design_scores_gemma":[0.000004679222,0.000015487809,0.00010601656,0.000011279039,0.000005847065,0.00002190694,0.00001255827,0.9274459,0.0002867871,0.07158682,0.0004950776,0.000007662541],"about_ca_topic_score_codex":0.0015174927,"about_ca_topic_score_gemma":0.0014856219,"teacher_disagreement_score":0.005818754,"about_ca_system_score_codex":0.0020167478,"about_ca_system_score_gemma":0.0016313298,"threshold_uncertainty_score":0.030772865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22678798,0.00083690445,0.6065669,0.009876755,0.0007185591,0.00024646797,0.0013982444,0.00053446874,0.15303372],"genre_scores_gemma":[0.79979694,0.0007973016,0.11163971,0.0012017845,0.0004802897,0.00030445406,0.0007196709,0.000376291,0.08468353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999551,0.00013342495,0.000015666963,0.00012738787,0.00007084646,0.00010160082],"domain_scores_gemma":[0.99881005,0.0007201633,0.00011891968,0.00006800673,0.00014289087,0.00013994054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598032,0.00072059315,0.0013183865,0.0006280991,0.0011719291,0.002970613,0.0011447961,0.0020897742,0.009946134],"category_scores_gemma":[0.002991294,0.00040883254,0.0006286831,0.0011048496,0.0013275956,0.002058589,0.0010324292,0.0020201614,0.0008502825],"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.00014180852,0.00013623046,0.0004125244,0.0002446911,0.000053427786,0.00024040542,0.00013911279,0.06442653,0.0022631811,0.8802423,0.024550147,0.02714963],"study_design_scores_gemma":[0.000051450384,0.00005208199,0.00022030505,0.000029617264,0.000015446438,0.00011118827,0.0000665441,0.3331503,0.0010495732,0.65830094,0.006932246,0.000020331494],"about_ca_topic_score_codex":0.0025491053,"about_ca_topic_score_gemma":0.0024411434,"teacher_disagreement_score":0.009946134,"about_ca_system_score_codex":0.0014816774,"about_ca_system_score_gemma":0.0017978204,"threshold_uncertainty_score":0.03327316},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011884451,0.0003984098,0.9725882,0.0004785874,0.0002117511,0.000104238825,0.00009214919,0.0001811376,0.014060982],"genre_scores_gemma":[0.22992346,0.00055723323,0.75325423,0.00045062217,0.0002982384,0.00033945296,0.00035406323,0.0003083071,0.014514358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990387,0.00039487914,0.000028511613,0.00016760577,0.00024985409,0.000120529454],"domain_scores_gemma":[0.99890685,0.00061161804,0.00006706042,0.00012332405,0.00018749642,0.00010358022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019257858,0.0011095178,0.0014463947,0.0014095167,0.0008028307,0.0020330022,0.0024340705,0.0021352232,0.008582596],"category_scores_gemma":[0.0054125804,0.0006573435,0.0011371451,0.0016807169,0.0011295704,0.0021723486,0.0022256952,0.0029776902,0.0011026048],"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.0003340051,0.00044404157,0.0006014839,0.00032540868,0.00010944187,0.0001473259,0.00015583796,0.39975852,0.003534362,0.36888015,0.014694982,0.21101438],"study_design_scores_gemma":[0.000034769924,0.0000447636,0.000083395906,0.00003767353,0.000015829844,0.00006332578,0.000016269503,0.91253954,0.0005426365,0.083011545,0.0035994097,0.00001093765],"about_ca_topic_score_codex":0.0018064479,"about_ca_topic_score_gemma":0.0020862224,"teacher_disagreement_score":0.008582596,"about_ca_system_score_codex":0.0014809248,"about_ca_system_score_gemma":0.0018122394,"threshold_uncertainty_score":0.028711617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028479872,0.0004113283,0.9493161,0.00073552225,0.000073560186,0.00006731786,0.00013962146,0.0006455957,0.02013103],"genre_scores_gemma":[0.5148077,0.0008329463,0.46888214,0.000605693,0.0002311134,0.00027290557,0.00041873584,0.00091359013,0.013035124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973029,0.00075933075,0.00016775938,0.00025562645,0.0012047626,0.00030956094],"domain_scores_gemma":[0.9950517,0.0026279557,0.00022029555,0.0008966496,0.0008992461,0.00030418998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002898405,0.0010105338,0.0013605348,0.0013125839,0.0011225438,0.0027936262,0.0017780691,0.0010067688,0.009057036],"category_scores_gemma":[0.011374957,0.0006147218,0.0011531442,0.0010776673,0.0028100302,0.0038803993,0.003363491,0.003752024,0.0024565076],"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.0000970349,0.000059126647,0.00037448536,0.00017243362,0.000021392576,0.00007627223,0.00024926363,0.1011424,0.0048395363,0.8572167,0.003550845,0.032200493],"study_design_scores_gemma":[0.000014163328,0.000032939955,0.00009674706,0.000024477777,0.0000051423326,0.000024124729,0.00003169083,0.6770958,0.0016282881,0.31834334,0.0026891555,0.000014130138],"about_ca_topic_score_codex":0.00279965,"about_ca_topic_score_gemma":0.003882901,"teacher_disagreement_score":0.009057036,"about_ca_system_score_codex":0.0020012504,"about_ca_system_score_gemma":0.0017232447,"threshold_uncertainty_score":0.03029883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014067024,0.00060253375,0.96181256,0.0011204301,0.00021858215,0.0001372038,0.00038546423,0.0030299453,0.01862624],"genre_scores_gemma":[0.21396188,0.00062158937,0.7682284,0.00044126218,0.00024196196,0.00040796347,0.001052286,0.0012321128,0.0138126295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809223,0.0005283165,0.0001069017,0.0003501819,0.000658607,0.0002638047],"domain_scores_gemma":[0.9942783,0.0033412566,0.00023017255,0.0013736952,0.00061764906,0.0001588873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018620179,0.0012465446,0.0014566206,0.0021083471,0.0020079154,0.0046636704,0.002787709,0.0016063467,0.024905825],"category_scores_gemma":[0.011879617,0.0008527337,0.002020951,0.0034791846,0.0021351662,0.008217105,0.003707635,0.0044327676,0.0045346827],"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.0004302959,0.00021880264,0.00056016416,0.00044074716,0.00007175751,0.00005386077,0.00017640372,0.055603903,0.003575025,0.6552279,0.02290296,0.26073822],"study_design_scores_gemma":[0.00010439421,0.000044884146,0.00016645325,0.000043507604,0.000034141496,0.00007143515,0.0000743931,0.2301549,0.0024977252,0.75445324,0.012328887,0.000026083819],"about_ca_topic_score_codex":0.0027879372,"about_ca_topic_score_gemma":0.005563793,"teacher_disagreement_score":0.024905825,"about_ca_system_score_codex":0.002967193,"about_ca_system_score_gemma":0.003092519,"threshold_uncertainty_score":0.08331829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11525419,0.0010721042,0.8353333,0.0015045671,0.00010780487,0.00007164545,0.0004236267,0.00010933017,0.046123452],"genre_scores_gemma":[0.86685663,0.0015010748,0.10024134,0.00038694512,0.00027972303,0.00020006944,0.0004968341,0.00016738761,0.029869929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990276,0.00038583935,0.000040088908,0.00018033791,0.00022006634,0.00014597122],"domain_scores_gemma":[0.9929162,0.0051161367,0.0008131338,0.00041378013,0.00040366026,0.00033710964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019197499,0.00081103394,0.0014045968,0.0014684862,0.0009768719,0.002511959,0.002653496,0.0016266251,0.008519621],"category_scores_gemma":[0.01101849,0.000812492,0.0012787428,0.0024194263,0.0021075055,0.005720225,0.0024041415,0.003863191,0.00050592655],"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.00003935237,0.000051997966,0.00040698136,0.00008902113,0.000034794317,0.00006035788,0.00013147353,0.12695454,0.0003310124,0.8597555,0.0020504133,0.010094489],"study_design_scores_gemma":[0.0000062338777,0.000018304014,0.00012824341,0.000021201624,0.000011062967,0.000047308953,0.0000513893,0.21200138,0.00018816488,0.78636545,0.001153443,0.0000078024605],"about_ca_topic_score_codex":0.0016857698,"about_ca_topic_score_gemma":0.0023391752,"teacher_disagreement_score":0.008519621,"about_ca_system_score_codex":0.001594057,"about_ca_system_score_gemma":0.0007834037,"threshold_uncertainty_score":0.028500974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03814917,0.0017350101,0.9189827,0.004088923,0.00057656755,0.0002248114,0.0005839551,0.00079807447,0.03486089],"genre_scores_gemma":[0.3931987,0.001733073,0.57814413,0.0009421206,0.0008552061,0.0007554884,0.00083446334,0.0011500866,0.022386784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960389,0.0019549227,0.00014692055,0.0003741243,0.0012067338,0.0002784188],"domain_scores_gemma":[0.9738709,0.021754382,0.00057649624,0.0019624562,0.0013295147,0.00050628145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055796895,0.0014010646,0.0021130322,0.0011266693,0.0014121413,0.0043698484,0.0025095793,0.0017065826,0.018635897],"category_scores_gemma":[0.028487416,0.00087427645,0.0011690641,0.0020833148,0.0024691501,0.0066518993,0.004856044,0.0056871637,0.0027767639],"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.0014814803,0.0004342736,0.0018231628,0.0007742746,0.00015560606,0.00034464113,0.00039890406,0.22048487,0.00459337,0.55427,0.028880991,0.1863584],"study_design_scores_gemma":[0.00012407631,0.00006637015,0.00034673806,0.000048201484,0.00003225797,0.00007106963,0.000064708096,0.7072408,0.0009331158,0.28787762,0.0031695827,0.000025401172],"about_ca_topic_score_codex":0.003736627,"about_ca_topic_score_gemma":0.0043086815,"teacher_disagreement_score":0.018635897,"about_ca_system_score_codex":0.0019516848,"about_ca_system_score_gemma":0.0029808201,"threshold_uncertainty_score":0.0623433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012853095,0.00037430346,0.9750166,0.0012070709,0.00016486883,0.00013637105,0.0003837106,0.001386479,0.008477563],"genre_scores_gemma":[0.31242606,0.00082965515,0.6673468,0.00090677605,0.00070690876,0.0007960198,0.00213972,0.0013066493,0.013541455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975182,0.00080406433,0.00010955634,0.0006298351,0.0006548334,0.00028361115],"domain_scores_gemma":[0.98307693,0.011366355,0.0008219905,0.0032238474,0.00092880183,0.000582108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024271428,0.0019296152,0.0022930128,0.0016479212,0.0011967415,0.0039063296,0.004582339,0.0026518132,0.019940047],"category_scores_gemma":[0.021784768,0.0013319547,0.0016504799,0.0028776296,0.002190487,0.009443031,0.0053671133,0.0075340625,0.0039779223],"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.00071545277,0.0009685186,0.0013344543,0.00063124276,0.00014589063,0.00016688951,0.0003640903,0.2962017,0.003597075,0.34458184,0.040042106,0.31125066],"study_design_scores_gemma":[0.000079637575,0.00003562336,0.00011952029,0.000033423843,0.000019515563,0.000056650093,0.00006683159,0.67020977,0.0009497023,0.32628465,0.002129468,0.000015216646],"about_ca_topic_score_codex":0.0021786636,"about_ca_topic_score_gemma":0.004295087,"teacher_disagreement_score":0.019940047,"about_ca_system_score_codex":0.0020796212,"about_ca_system_score_gemma":0.0029093674,"threshold_uncertainty_score":0.06670612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016614703,0.00013445382,0.9774779,0.00021805723,0.000050039645,0.000058953523,0.000026777192,0.00015706148,0.005261957],"genre_scores_gemma":[0.41085824,0.00024204596,0.5809348,0.0002621745,0.000045853496,0.00043012263,0.00015866818,0.00031605735,0.0067519685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989729,0.0005179793,0.00003456001,0.00015305936,0.00021773214,0.00010388802],"domain_scores_gemma":[0.9942378,0.004511186,0.00030030764,0.00024776006,0.0005481708,0.00015477439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037613646,0.0011801162,0.0009393624,0.00073672936,0.00097324885,0.0011902767,0.0014854947,0.0018972623,0.004030326],"category_scores_gemma":[0.013005871,0.0008436293,0.00081000477,0.00066989835,0.0021977539,0.001843776,0.0024637557,0.0027177085,0.0005118979],"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.00041796453,0.00008622003,0.0005244225,0.00016857269,0.000046132525,0.0000645911,0.00016707831,0.8936955,0.0021962943,0.053805854,0.0019810495,0.046846457],"study_design_scores_gemma":[0.000018453191,0.000045041215,0.000058250713,0.0000123999625,0.000004864414,0.000013328488,0.000009550674,0.99053335,0.00039549766,0.008621041,0.00028266737,0.000005542439],"about_ca_topic_score_codex":0.0036396526,"about_ca_topic_score_gemma":0.002956442,"teacher_disagreement_score":0.004030326,"about_ca_system_score_codex":0.0009812906,"about_ca_system_score_gemma":0.0022958345,"threshold_uncertainty_score":0.019892216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12299199,0.004066622,0.706286,0.013891503,0.00093495555,0.0006360636,0.0033535669,0.008758215,0.13908106],"genre_scores_gemma":[0.64396137,0.0012683057,0.31316915,0.0033315637,0.0010806029,0.0007864485,0.005207826,0.0025732217,0.02862143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921051,0.0022242514,0.00028016305,0.0013940192,0.002591962,0.0014045112],"domain_scores_gemma":[0.97699773,0.016080156,0.00091103406,0.0031435785,0.0014566991,0.0014108394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965587,0.0026181529,0.0024178366,0.002650638,0.002532337,0.004812056,0.0048496188,0.0039483253,0.025481187],"category_scores_gemma":[0.028195176,0.0010184883,0.00211786,0.0027447662,0.00311313,0.009709008,0.0041881623,0.0076994463,0.0053132507],"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.0037775112,0.000770738,0.003712384,0.001282201,0.00024759187,0.00035500163,0.00063441327,0.4388163,0.010731776,0.30704933,0.073041484,0.15958124],"study_design_scores_gemma":[0.00014199264,0.0001906188,0.0005029431,0.000087501,0.00005610033,0.00013591857,0.000062686944,0.82357866,0.003270681,0.1658739,0.006068994,0.00003006605],"about_ca_topic_score_codex":0.0025328828,"about_ca_topic_score_gemma":0.004277325,"teacher_disagreement_score":0.025481187,"about_ca_system_score_codex":0.005634434,"about_ca_system_score_gemma":0.0044722273,"threshold_uncertainty_score":0.085243106},"labels":[],"label_agreement":null}]}