{"meta":{"query_hash":"29504458dac8","filters":{"venue":"Nonconvex optimization and its applications"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/29504458dac8","api":"https://metacan.xera.ac/api/v1/cohort?venue=Nonconvex+optimization+and+its+applications"},"results":[{"id":"W1538503321","doi":"10.1007/978-1-4757-3145-3_25","title":"Continuous-based Heuristics for Graph and Tree Isomorphisms, with Application to Computer Vision","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Graph Theory and Algorithms","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":"McGill University","funders":"","keywords":"Heuristics; Clique; Quadratic programming; Computer science; Quadratic equation; Theoretical computer science; Clique problem; Graph; Mathematics; Mathematical optimization; Combinatorics; Line graph; Pathwidth","score_opus":0.0065908144910859345,"score_gpt":0.2189472659255289,"score_spread":0.21235645143444298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538503321","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003720334,0.00024626675,0.98751616,0.0009716154,0.000039214847,0.0024134142,0.00012931148,0.00018104157,0.008499267],"genre_scores_gemma":[0.004475737,0.0010183434,0.97161925,0.0035794612,0.00035112054,0.0018347978,0.00096088846,0.00014523492,0.016015183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840295,0.000017460567,0.0003615058,0.00081668806,0.00019697547,0.00020443574],"domain_scores_gemma":[0.9985197,0.00017360212,0.00023125093,0.00053128076,0.000314882,0.00022924758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012044636,0.00035259384,0.0003545952,0.0002898613,0.00035767144,0.00020843768,0.0003594116,0.00022564379,0.000026911552],"category_scores_gemma":[0.0000031903708,0.00033168742,0.000060636743,0.00017980038,0.00010645252,0.00017526654,0.00006933584,0.0001466295,0.000020002115],"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.000049977058,0.0000746636,0.0000022034876,0.00006835811,0.000036374884,9.575942e-7,0.000087767876,0.029665679,0.000020406438,0.8157183,0.0006569796,0.1536183],"study_design_scores_gemma":[0.0009676127,0.00053215947,0.000013102847,0.000089996785,0.000078837686,0.000015495023,0.0000033456456,0.7919625,0.00004887458,0.02374096,0.18196192,0.00058520236],"about_ca_topic_score_codex":0.0000011614508,"about_ca_topic_score_gemma":0.0000034363816,"teacher_disagreement_score":0.79197735,"about_ca_system_score_codex":0.000020331487,"about_ca_system_score_gemma":0.000061092185,"threshold_uncertainty_score":0.9999135},"labels":[],"label_agreement":null},{"id":"W2072075444","doi":"10.1007/978-1-4757-3145-3_23","title":"A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Packing Problems","field":"Engineering","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":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Subgradient method; Cutting-plane method; Lagrangian relaxation; Mathematical optimization; Mathematics; Heuristics; Relaxation (psychology); Linear programming relaxation; Integer programming; Plane (geometry); Algorithm; Geometry","score_opus":0.013227652469904759,"score_gpt":0.20594573672711045,"score_spread":0.19271808425720569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072075444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007930937,0.00067467,0.9059638,0.00018364284,0.00011385869,0.0030277516,0.00034711554,0.0006697571,0.08894013],"genre_scores_gemma":[0.0425356,0.006085805,0.87983775,0.0005416883,0.0004102199,0.001036604,0.0046396703,0.0009616168,0.06395105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985579,0.00002777967,0.00060877233,0.00038133733,0.00021643097,0.00020774287],"domain_scores_gemma":[0.9988113,0.00005908593,0.0003688271,0.00037899695,0.0002604252,0.00012135241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013322562,0.00038080107,0.00035044094,0.0001999863,0.00022678028,0.00009107052,0.0002113547,0.00032199136,0.00030034178],"category_scores_gemma":[0.0000074531226,0.00031855147,0.000067696965,0.00020149985,0.00009621224,0.00025245317,0.00002888105,0.00035728558,0.0000144495625],"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.000024027595,0.000060341543,0.000018027446,0.00037799243,0.0001948926,9.074837e-7,0.002444747,0.96230227,0.00033400484,0.007261127,0.00008755701,0.026894098],"study_design_scores_gemma":[0.00082037726,0.00007907242,0.000014270798,0.0004988898,0.00013155275,0.000022576245,0.000108619446,0.98623747,0.0003585221,0.0001602291,0.011075676,0.0004927333],"about_ca_topic_score_codex":0.0000126058885,"about_ca_topic_score_gemma":0.00003588271,"teacher_disagreement_score":0.042456288,"about_ca_system_score_codex":0.00006945918,"about_ca_system_score_gemma":0.000058572903,"threshold_uncertainty_score":0.9999266},"labels":[],"label_agreement":null},{"id":"W24073905","doi":"10.1007/978-1-4757-3141-5_9","title":"Conditions (S)+ and (S) + 1 : Applications to Complementarity Theory","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Variational Analysis","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":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Mathematical economics; Compact space; Mathematics; Mixed complementarity problem; Complementarity theory; Pure mathematics; Mathematical optimization; Physics; Quantum mechanics","score_opus":0.01832681258036193,"score_gpt":0.2653044174696567,"score_spread":0.2469776048892948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24073905","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.6242366e-7,0.00031701144,0.79932374,0.002228815,0.000023076504,0.0013820408,0.00032886045,0.00018918444,0.19620691],"genre_scores_gemma":[0.0059098057,0.012693947,0.41090068,0.019904125,0.001035062,0.006594256,0.007401279,0.0002768382,0.535284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980231,0.00004110595,0.000554452,0.0008622087,0.0003016347,0.00021747974],"domain_scores_gemma":[0.99820584,0.0002076113,0.00024654364,0.00061703613,0.0003598419,0.00036310998],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021010062,0.0003616682,0.00036260282,0.0004429907,0.00072408805,0.00030366628,0.00048211575,0.0002209987,0.002839924],"category_scores_gemma":[0.0000104338,0.00039565135,0.00008696976,0.00032552076,0.000088480585,0.0003548007,0.00024026392,0.00021901651,0.000310549],"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.0000026674193,0.000040388506,0.0000024284193,0.000016595954,0.00007103618,2.3643855e-7,0.0000903167,0.01627267,0.000002960714,0.97215,0.0007617166,0.010588952],"study_design_scores_gemma":[0.0003884148,0.000040543513,0.000038571812,0.000028996588,0.00017664659,0.000013942261,0.000020667818,0.14353941,0.0000102701815,0.109829664,0.7452609,0.000652004],"about_ca_topic_score_codex":0.0000056044614,"about_ca_topic_score_gemma":0.0000114574605,"teacher_disagreement_score":0.86232036,"about_ca_system_score_codex":0.0000681451,"about_ca_system_score_gemma":0.00012121415,"threshold_uncertainty_score":0.99984956},"labels":[],"label_agreement":null},{"id":"W310879469","doi":"10.1007/978-1-4613-0279-7_24","title":"An Analytic Center Self-Concordant Cut Method for the Convex Feasibility Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","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":"McGill University; Concordia University","funders":"","keywords":"Mathematics; Center (category theory); Regular polygon; Set (abstract data type); Convex analysis; Combinatorics; Convex set; Convex optimization; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.07041449983146163,"score_gpt":0.3974612581906012,"score_spread":0.32704675835913954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W310879469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.6698963e-7,0.00029518138,0.9369568,0.0009479135,0.00005539333,0.0073082973,0.00038209272,0.00031356022,0.053740293],"genre_scores_gemma":[0.00006690541,0.0034430656,0.88569796,0.0004976367,0.00037175787,0.0022269518,0.00075961667,0.00025560317,0.106680505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970157,0.00009439892,0.00092666724,0.0010324642,0.0004994108,0.00043133218],"domain_scores_gemma":[0.99507624,0.0013823444,0.0006549542,0.001173178,0.0013989285,0.00031438065],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000855309,0.00055347424,0.0006706346,0.00024270448,0.0006945633,0.00019887323,0.00058501604,0.00044681013,0.0010400554],"category_scores_gemma":[0.00013468691,0.00045064656,0.00020014527,0.00023480943,0.00015335431,0.00030955402,0.00012690506,0.0005112094,0.00003377331],"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.000097421624,0.0006905766,0.000020832655,0.0007055875,0.00058345875,0.0000022559266,0.0006436109,0.08438703,0.00001678089,0.89309525,0.003304717,0.016452497],"study_design_scores_gemma":[0.0010907043,0.00010210516,0.0000010624515,0.000043229607,0.000302959,0.000025108151,0.00008877175,0.7962425,0.000025527223,0.045992352,0.15560316,0.00048255103],"about_ca_topic_score_codex":0.000003704554,"about_ca_topic_score_gemma":0.000022249373,"teacher_disagreement_score":0.8471029,"about_ca_system_score_codex":0.00025309267,"about_ca_system_score_gemma":0.00027044961,"threshold_uncertainty_score":0.9998731},"labels":[],"label_agreement":null},{"id":"W4252034049","doi":"10.1007/978-1-4757-3623-6_1","title":"Introduction","year":2002,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Variational Analysis","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":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Differentiable function; Mathematics; Pure mathematics; Stationary point; Degree (music); Point (geometry); Mathematical analysis; Applied mathematics; Mathematical economics; Physics; Geometry","score_opus":0.013706725164442667,"score_gpt":0.2146830561545367,"score_spread":0.20097633099009404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252034049","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0042128e-8,0.00038719186,0.72843206,0.006407944,0.00009098106,0.00034452532,0.000017003686,0.00019238373,0.26412788],"genre_scores_gemma":[0.00012220786,0.0056723906,0.11486156,0.0009747959,0.0010024467,0.00015874588,0.00046455668,0.000051437393,0.8766919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840885,0.00001702026,0.0004307738,0.0006941352,0.000299894,0.00014930737],"domain_scores_gemma":[0.9984688,0.00005281258,0.00033090485,0.00053612486,0.0004621993,0.00014913885],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001116554,0.00027767738,0.00027175772,0.0003298522,0.00029874253,0.00022603977,0.0003786885,0.0002707851,0.0039714384],"category_scores_gemma":[0.000017974702,0.00029248575,0.000095931144,0.00023210599,0.00003828157,0.00045480623,0.00013025272,0.00020557777,0.00061457633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2916075e-7,0.000023339284,3.62561e-7,0.000013649164,0.000045440203,2.798596e-7,0.000037902424,0.045247138,0.0000018236775,0.9423102,0.0073773437,0.0049418765],"study_design_scores_gemma":[0.000116265684,0.000011694776,0.0000012387749,0.000005726388,0.000042230018,0.0000070779024,0.0000012225956,0.5208973,0.000006812087,0.0030603537,0.47562823,0.00022179855],"about_ca_topic_score_codex":8.52364e-7,"about_ca_topic_score_gemma":5.8662175e-7,"teacher_disagreement_score":0.9392499,"about_ca_system_score_codex":0.00006446712,"about_ca_system_score_gemma":0.000052347554,"threshold_uncertainty_score":0.99995273},"labels":[],"label_agreement":null},{"id":"W579949368","doi":"10.1007/978-1-4613-0279-7_25","title":"Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","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","funders":"","keywords":"Semidefinite programming; Maximum cut; Semidefinite embedding; Mathematics; Relaxation (psychology); Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematical optimization; Computer science; Quadratically constrained quadratic program; Artificial intelligence; Quadratic programming","score_opus":0.030757240695933663,"score_gpt":0.25227113805011137,"score_spread":0.2215138973541777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W579949368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0545285e-7,0.0010085749,0.9068833,0.0026234528,0.000092526876,0.002421708,0.00008147977,0.00026017558,0.0866287],"genre_scores_gemma":[0.00024521936,0.007822995,0.78460383,0.0009269472,0.00045322973,0.0042674625,0.00062680076,0.00011435075,0.20093916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983873,0.000015397613,0.00047193287,0.000624187,0.00024372104,0.00025747807],"domain_scores_gemma":[0.9978314,0.000523621,0.0004104901,0.000708385,0.00041036174,0.00011572744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020897461,0.0003131581,0.0002517302,0.00018204021,0.0010003106,0.00036532053,0.00075116695,0.00024136389,0.00010223811],"category_scores_gemma":[0.000025364,0.00026653,0.00014259815,0.00025458477,0.00011956673,0.00026908788,0.00020380413,0.00028718394,0.000026541758],"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.0000017642296,0.000028874778,7.094851e-7,0.000031673448,0.00004851861,2.3429381e-7,0.00013484174,0.006705541,7.797309e-7,0.87861496,0.0005205103,0.113911584],"study_design_scores_gemma":[0.00023387073,0.00003380793,7.8995316e-7,0.000039986546,0.00005932959,0.000011438165,0.000013873092,0.35748616,0.0000048745383,0.037557893,0.6043054,0.00025256656],"about_ca_topic_score_codex":0.0000041458447,"about_ca_topic_score_gemma":0.000012739549,"teacher_disagreement_score":0.84105706,"about_ca_system_score_codex":0.000042613137,"about_ca_system_score_gemma":0.00012258832,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W76416230","doi":"10.1007/978-1-4613-0251-3_7","title":"Exact parallel algorithms for the location depth and the maximum feasible subsystem problems","year":2004,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hyperplane; Parallelizable manifold; Mathematics; Enumeration; Generalization; Dimension (graph theory); Point location; Algorithm; Point (geometry); Parametric statistics; Set (abstract data type); Space (punctuation); Combinatorics; Mathematical optimization; Computer science; Geometry; Mathematical analysis; Statistics","score_opus":0.03167241883879291,"score_gpt":0.25444933486981247,"score_spread":0.22277691603101957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76416230","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.2533267e-7,0.006629331,0.9760784,0.0044490215,0.00015061276,0.0036199072,0.000020438007,0.00008760888,0.0089641865],"genre_scores_gemma":[0.07681076,0.037054405,0.558872,0.0050912895,0.0040310356,0.01800731,0.0027340895,0.00035357472,0.29704556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985764,0.00003157941,0.00041849632,0.00054139853,0.00026602315,0.00016610207],"domain_scores_gemma":[0.99818283,0.00040046446,0.00035428535,0.00045190958,0.00052632473,0.00008417525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831628,0.00026499736,0.00024249108,0.000120797304,0.00078667863,0.000374571,0.0004127358,0.00018054266,0.000020960035],"category_scores_gemma":[0.0000257577,0.000178478,0.00007405181,0.00020904223,0.00012514254,0.00027835008,0.00011191962,0.00016785153,0.000014731167],"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.000005411457,0.000011913459,4.374725e-7,0.0000603206,0.00003747535,6.258842e-8,0.00016540084,0.2621792,0.0000015616947,0.7199528,0.00020828853,0.01737709],"study_design_scores_gemma":[0.0012211928,0.000035928482,0.000012378274,0.00004638617,0.00007920079,0.000020465512,0.000016692698,0.90317833,0.000008254416,0.03359735,0.061549395,0.00023441715],"about_ca_topic_score_codex":0.00001011451,"about_ca_topic_score_gemma":0.00001791028,"teacher_disagreement_score":0.6863555,"about_ca_system_score_codex":0.00006246447,"about_ca_system_score_gemma":0.00021601473,"threshold_uncertainty_score":0.7278122},"labels":[],"label_agreement":null}]}