{"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":"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.0045660296,0.0005097428,0.99180436,0.00010242422,0.000053687058,0.00006893857,0.0000910966,0.0011069018,0.0016969015],"genre_scores_gemma":[0.048993915,0.00038883768,0.94728655,0.00008309728,0.00007117665,0.00015108257,0.000355886,0.00051558204,0.0021538301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910873,0.0002469789,0.000045475193,0.00024590152,0.00025218682,0.00010073135],"domain_scores_gemma":[0.99589044,0.0026431018,0.00024093225,0.0004711843,0.00056925014,0.00018518265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017286818,0.0017036031,0.0031503595,0.0029134138,0.0011266216,0.002404177,0.0035106323,0.0024571198,0.00731588],"category_scores_gemma":[0.007312993,0.0013426936,0.0012753468,0.0059959036,0.0018946562,0.0034669952,0.0020159686,0.0031163606,0.0013865153],"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.00018488633,0.00024822354,0.0003915724,0.00026872676,0.0000792077,0.000086174194,0.0001292141,0.49524492,0.0026408534,0.05562636,0.015237548,0.42986238],"study_design_scores_gemma":[0.000036077596,0.000031145824,0.00010410636,0.000013911287,0.0000115924295,0.000028233952,0.000029604282,0.9689651,0.000715315,0.028533094,0.0015190893,0.000012758315],"about_ca_topic_score_codex":0.016126303,"about_ca_topic_score_gemma":0.020072581,"teacher_disagreement_score":0.016126303,"about_ca_system_score_codex":0.0022351642,"about_ca_system_score_gemma":0.0027985133,"threshold_uncertainty_score":0.032064855},"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":"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.007059705,0.00019314577,0.97778714,0.0001771871,0.00007043594,0.00006516795,0.000107404354,0.00021030798,0.014329495],"genre_scores_gemma":[0.1224993,0.00034523633,0.8671155,0.00010502738,0.00006232293,0.00023457193,0.00035692044,0.00023989269,0.009041195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958307,0.00014073275,0.000013281421,0.000056446548,0.00015865664,0.00004789926],"domain_scores_gemma":[0.9995468,0.000284269,0.000032863365,0.0000393992,0.00007612429,0.000020420493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088653143,0.0009000131,0.0013521409,0.0006254361,0.0004584007,0.0011943147,0.0015284554,0.0013965846,0.007133671],"category_scores_gemma":[0.001730092,0.0008884963,0.0009776391,0.0013918921,0.0006288299,0.001200516,0.0008846438,0.002120966,0.0011108266],"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.00007690126,0.00011555085,0.00010530601,0.00013286219,0.00002242783,0.00005711308,0.000061703744,0.89206535,0.0016276644,0.034808487,0.0060206535,0.06490595],"study_design_scores_gemma":[0.000017966493,0.000020479807,0.0000432823,0.000009833707,0.000004327526,0.000014563231,0.000007947334,0.99317414,0.000262493,0.0052963165,0.0011442264,0.0000043253026],"about_ca_topic_score_codex":0.003747163,"about_ca_topic_score_gemma":0.0035405937,"teacher_disagreement_score":0.007133671,"about_ca_system_score_codex":0.00083551527,"about_ca_system_score_gemma":0.0016812963,"threshold_uncertainty_score":0.023864508},"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":"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.021228272,0.0077186693,0.57993275,0.0069926153,0.0022200348,0.00030354553,0.00096968707,0.00045015317,0.3801842],"genre_scores_gemma":[0.40618792,0.010863463,0.4239168,0.0026347884,0.0023050425,0.0007466764,0.0011507925,0.00050440617,0.15169019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960953,0.000099276716,0.000023998287,0.000076041266,0.00015043427,0.000040799692],"domain_scores_gemma":[0.99923754,0.0003658947,0.000057971618,0.000051612635,0.00024277427,0.000044250824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086315087,0.00050201005,0.0005788446,0.0008170059,0.0009629746,0.0013809614,0.0006177197,0.0011171423,0.017395467],"category_scores_gemma":[0.002735741,0.0003612164,0.00035569147,0.0010324749,0.0021540031,0.0023197278,0.00095286925,0.0018240928,0.0035256727],"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.000036753685,0.000018242,0.00007772568,0.00021608059,0.000004830248,0.00007141262,0.000116998184,0.00239054,0.002078895,0.91408914,0.024440149,0.056459323],"study_design_scores_gemma":[0.00001897838,0.000026789241,0.00037823644,0.00010506462,0.000008832479,0.00015679565,0.00013029459,0.009701635,0.0031931573,0.9000464,0.08620758,0.000026259568],"about_ca_topic_score_codex":0.0028303245,"about_ca_topic_score_gemma":0.003157866,"teacher_disagreement_score":0.017395467,"about_ca_system_score_codex":0.000950279,"about_ca_system_score_gemma":0.0016572926,"threshold_uncertainty_score":0.058193624},"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":"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.0013173246,0.00020000077,0.99317956,0.00008436491,0.00006763277,0.000029274255,0.00002734397,0.000085551466,0.005008863],"genre_scores_gemma":[0.04380968,0.00045881924,0.9431854,0.00017990304,0.00013023852,0.0001984259,0.00015465956,0.00024769883,0.01163502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964976,0.00009037603,0.00000973487,0.00004471937,0.000187874,0.000017492463],"domain_scores_gemma":[0.9993906,0.0003360365,0.00003242569,0.000049170678,0.00016217191,0.00002957919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008683636,0.00075652014,0.00086700683,0.001040723,0.0004582513,0.0012107971,0.0014891727,0.0011926327,0.005303223],"category_scores_gemma":[0.0023242459,0.00051578286,0.0006652035,0.0008026926,0.00089848967,0.0010862299,0.0012432537,0.0022814819,0.001104717],"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.00016531856,0.00012992471,0.00024001626,0.0003839478,0.00006150023,0.00013948849,0.00017390857,0.18208617,0.01526574,0.4834664,0.021548046,0.29633963],"study_design_scores_gemma":[0.000021136826,0.000032244505,0.00009360417,0.000032419644,0.000013201934,0.00010529118,0.000014422753,0.91748035,0.0026862018,0.06784217,0.0116627,0.000016238253],"about_ca_topic_score_codex":0.0007287421,"about_ca_topic_score_gemma":0.0009902677,"teacher_disagreement_score":0.005303223,"about_ca_system_score_codex":0.00070758973,"about_ca_system_score_gemma":0.00089451513,"threshold_uncertainty_score":0.017741084},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005164898,0.0026739554,0.010937631,0.0031795036,0.005005626,0.000115856055,0.0018652821,0.00091057125,0.974795],"genre_scores_gemma":[0.002185789,0.001819581,0.0027323232,0.0011811475,0.0008745891,0.00007872855,0.0015164042,0.00029195636,0.9893194],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945277,0.000055944143,0.000018846617,0.00012337485,0.00028654753,0.00006260012],"domain_scores_gemma":[0.99923325,0.00011040762,0.000029614725,0.00012459612,0.0003611251,0.00014088408],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005864685,0.00093535683,0.0005196084,0.0014652447,0.0011849852,0.003357322,0.0014947334,0.0015019709,0.47306702],"category_scores_gemma":[0.002207517,0.00029104523,0.00048216167,0.0013232273,0.00060943246,0.002676751,0.0021015753,0.0016559339,0.3703451],"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.000028817416,0.000034134435,0.000102306236,0.00016145516,0.0000030296671,0.00005129271,0.00011643284,0.00020572923,0.00056664745,0.07646705,0.72674936,0.19551378],"study_design_scores_gemma":[0.0000016278691,0.0000058022406,0.00006097627,0.000047326193,0.000001026787,0.00003713039,0.000026280797,0.000041569197,0.00012381,0.007652486,0.9919993,0.0000026733778],"about_ca_topic_score_codex":0.0014600055,"about_ca_topic_score_gemma":0.0022230453,"teacher_disagreement_score":0.47306702,"about_ca_system_score_codex":0.0011041036,"about_ca_system_score_gemma":0.0015344949,"threshold_uncertainty_score":0.7516059},"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":"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.0070993756,0.0013711139,0.9494917,0.0012976711,0.00036608655,0.000095494375,0.0004092576,0.00027223228,0.03959707],"genre_scores_gemma":[0.2079222,0.0039352668,0.73425317,0.0011401442,0.0011161017,0.00081187754,0.0017674449,0.00081650994,0.048237387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856204,0.0006138438,0.000061924824,0.00018778846,0.00047801415,0.000096427015],"domain_scores_gemma":[0.99686843,0.0019342919,0.00022478745,0.000402995,0.00044975436,0.00011963902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002823092,0.0017626818,0.0012366517,0.0009285711,0.0005963254,0.0022033502,0.0022163158,0.0012610741,0.011400257],"category_scores_gemma":[0.0074122204,0.0008383644,0.0010909915,0.0017639424,0.0013334989,0.003817086,0.0018567983,0.0077116815,0.0025119162],"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.00023851104,0.00024975403,0.0001440912,0.0006650362,0.000054205964,0.00014022263,0.00018287101,0.20121598,0.0038698586,0.60934377,0.045105703,0.13879007],"study_design_scores_gemma":[0.00006199072,0.00008156099,0.00017968823,0.00012334947,0.000024606243,0.00015683181,0.00005278201,0.5393908,0.0018765791,0.43595508,0.022064041,0.000032684264],"about_ca_topic_score_codex":0.0008733041,"about_ca_topic_score_gemma":0.0012234709,"teacher_disagreement_score":0.011400257,"about_ca_system_score_codex":0.0013242454,"about_ca_system_score_gemma":0.0012306167,"threshold_uncertainty_score":0.038137615},"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":"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.0046039796,0.00040826105,0.98646206,0.00015512948,0.000053418913,0.000030532712,0.00008791128,0.0003749556,0.007823709],"genre_scores_gemma":[0.1407054,0.0006128264,0.8459929,0.00011317342,0.00010548972,0.00029804627,0.0003004558,0.00048548786,0.0113862315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958616,0.00010454233,0.000018604605,0.00007117443,0.00015523125,0.000064269894],"domain_scores_gemma":[0.9991704,0.0004998115,0.0000512052,0.00012471368,0.00012096649,0.000032838405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008417214,0.001640444,0.0015754813,0.000824005,0.00089326047,0.0011941162,0.0018190952,0.0011304719,0.009151787],"category_scores_gemma":[0.0032909082,0.001043065,0.0009171968,0.001860271,0.001113174,0.0022936785,0.0019312322,0.0021127136,0.0015061457],"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.00012677304,0.00007402479,0.00021169006,0.00017460575,0.00003207049,0.000036169095,0.00010112068,0.7332165,0.0011837994,0.11164047,0.0075156894,0.14568694],"study_design_scores_gemma":[0.00003750935,0.000013884206,0.00006063123,0.000009696881,0.000007362772,0.000015023406,0.00001889677,0.9053038,0.00048517733,0.09177711,0.0022650568,0.0000058921332],"about_ca_topic_score_codex":0.0059352373,"about_ca_topic_score_gemma":0.012553695,"teacher_disagreement_score":0.009151787,"about_ca_system_score_codex":0.0015800009,"about_ca_system_score_gemma":0.0016049608,"threshold_uncertainty_score":0.030615747},"labels":[],"label_agreement":null}]}