{"meta":{"query_hash":"f1dc5daf9e80","filters":{"venue":"Numerical Algebra Control and Optimization"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/f1dc5daf9e80","api":"https://metacan.xera.ac/api/v1/cohort?venue=Numerical+Algebra+Control+and+Optimization"},"results":[{"id":"W1992132942","doi":"10.3934/naco.2011.1.301","title":"Multiplicative perturbation analysis for QR factorizations","year":2011,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; McGill University","funders":"","keywords":"Multiplicative function; Mathematics; Perturbation (astronomy); Computation; QR decomposition; Factorization; Norm (philosophy); Pure mathematics; Applied mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Algorithm; Physics","score_opus":0.015206131277076007,"score_gpt":0.22194270535340693,"score_spread":0.20673657407633092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992132942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017631559,0.00005567494,0.9985715,0.00030456227,0.00006937525,0.00030185422,0.00001483446,0.00011519597,0.0003906485],"genre_scores_gemma":[0.69659144,0.0000127092035,0.3028853,0.00023718926,0.000037231803,0.00007771406,0.000030203377,0.0000055466603,0.00012267809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991833,0.00006669342,0.00019422895,0.00030923504,0.000094840674,0.00015167879],"domain_scores_gemma":[0.9992678,0.00017685146,0.0001108335,0.00019521207,0.00015936849,0.00008990087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012521658,0.000112015565,0.00018974303,0.00012546834,0.00018923767,0.000070308844,0.0001949597,0.00005904316,0.00004597505],"category_scores_gemma":[0.000102943275,0.00009411356,0.00009068406,0.000635071,0.000029847193,0.00041792085,0.000028913424,0.000045289165,0.0000032202558],"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.00011118641,0.0002851595,0.003950775,0.000015100978,0.0005125125,9.38932e-7,0.002929675,0.14982703,0.00011739366,0.80827135,0.00003465522,0.033944197],"study_design_scores_gemma":[0.00057042367,0.0000790306,0.0028228406,0.0000013555272,0.00011636928,6.3458975e-7,0.000016930908,0.9847857,0.000085482156,0.011270115,0.00012319715,0.00012796966],"about_ca_topic_score_codex":0.0000080844275,"about_ca_topic_score_gemma":5.4369417e-7,"teacher_disagreement_score":0.8349586,"about_ca_system_score_codex":0.000013322989,"about_ca_system_score_gemma":0.000014288992,"threshold_uncertainty_score":0.38378394},"labels":[],"label_agreement":null},{"id":"W2320627379","doi":"10.3934/naco.2014.4.39","title":"Some useful inequalities via trace function method in Euclidean Jordan algebras","year":2013,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"TRACE (psycholinguistics); Convexity; Mathematical proof; Function (biology); Mathematics; Key (lock); Euclidean geometry; Cone (formal languages); Algebra over a field; Pure mathematics; Computer science; Algorithm; Geometry","score_opus":0.023505110162694798,"score_gpt":0.3033407763515031,"score_spread":0.2798356661888083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320627379","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.0040906817,0.00038100878,0.9926919,0.0014253878,0.00011504536,0.00094486756,0.0000070788424,0.00018153283,0.00016255022],"genre_scores_gemma":[0.3007824,0.00018414046,0.69652426,0.0009572683,0.00022709565,0.00038243426,0.000045532044,0.00010263368,0.00079421647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729234,0.00050722546,0.0007244291,0.0005100693,0.00045721466,0.00050870795],"domain_scores_gemma":[0.9979951,0.00098283,0.00022329482,0.0002864756,0.00028409113,0.00022825804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056021404,0.00030966374,0.00053888786,0.00030709282,0.00016299049,0.00015847388,0.00016349155,0.00019435359,0.0006605741],"category_scores_gemma":[0.00082032726,0.00028072184,0.000079753,0.0005881535,0.00008567274,0.0012190435,0.00006279641,0.00034865795,0.000043155116],"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.0004038877,0.0006999187,0.00205376,0.00019276426,0.00017407954,0.000012146689,0.0010356122,0.7414843,0.00043962136,0.1369585,0.0006840015,0.11586145],"study_design_scores_gemma":[0.0020499371,0.00014698689,0.0014869183,0.000019414816,0.000030883733,0.000007937827,0.00023173903,0.8205683,0.000040962546,0.17501804,0.00010649579,0.0002923776],"about_ca_topic_score_codex":0.00013222228,"about_ca_topic_score_gemma":0.000012126742,"teacher_disagreement_score":0.29669172,"about_ca_system_score_codex":0.00009965441,"about_ca_system_score_gemma":0.00004058304,"threshold_uncertainty_score":0.9999645},"labels":[],"label_agreement":null},{"id":"W2789849740","doi":"10.3934/naco.2018007","title":"<inline-formula><tex-math id=\"M1\">\\begin{document} $\\mathcal{L}_{∞}$ \\end{document}</tex-math></inline-formula>-norm computation for large-scale descriptor systems using structured iterative eigensolvers","year":2018,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","topic":"Matrix Theory and Algorithms","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":"McGill University","funders":"","keywords":"Computation; Eigenvalues and eigenvectors; Norm (philosophy); Pencil (optics); Matrix norm; Mathematics; Iterative method; Iterative refinement; Matrix pencil; Upper and lower bounds; Algorithm; Applied mathematics; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Physics","score_opus":0.00909950472901929,"score_gpt":0.24067775353300944,"score_spread":0.23157824880399014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789849740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036077235,0.000978177,0.9569842,0.00046136198,0.0020841158,0.0024488484,0.00027133434,0.0005193692,0.00017532849],"genre_scores_gemma":[0.7342254,0.000103294566,0.2623774,0.0008430808,0.0012450967,0.00019376558,0.0005129864,0.000120653705,0.0003783012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99362355,0.00046802667,0.0016676339,0.0016333204,0.0011394146,0.001468041],"domain_scores_gemma":[0.9958665,0.00045866135,0.0010797976,0.00081138476,0.0011360866,0.00064757135],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012122681,0.0010778053,0.0013830285,0.00043522014,0.0014581648,0.0015224019,0.0009669285,0.0005106748,0.00007582435],"category_scores_gemma":[0.00020620643,0.00093801867,0.00039594912,0.0011057849,0.00027179817,0.0029468765,0.00034069663,0.00038244235,0.00004348805],"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.0013080202,0.0008418088,0.00018456399,0.0005798244,0.0009531733,0.0000550027,0.005456984,0.42245087,0.007899594,0.52572805,0.0010368841,0.033505265],"study_design_scores_gemma":[0.0057190713,0.00082661404,0.00008650006,0.00015791874,0.00023476855,0.00008423992,0.00012746167,0.9793629,0.0004195278,0.0055114594,0.006407289,0.0010622151],"about_ca_topic_score_codex":0.000027301025,"about_ca_topic_score_gemma":0.000015216791,"teacher_disagreement_score":0.6981482,"about_ca_system_score_codex":0.00040018983,"about_ca_system_score_gemma":0.00025727059,"threshold_uncertainty_score":0.9998418},"labels":[],"label_agreement":null},{"id":"W4328023177","doi":"10.3934/naco.2023011","title":"Optimality conditions and constraint qualifications for cardinality constrained optimization problems","year":2023,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear subspace; Cardinality (data modeling); Mathematics; Constraint (computer-aided design); Subspace topology; Bounded function; Feasible region; Mathematical optimization; Metric (unit); Set (abstract data type); Computer science; Pure mathematics","score_opus":0.017974784800389075,"score_gpt":0.2632299106870835,"score_spread":0.24525512588669443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328023177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017449856,0.00006140746,0.98803973,0.009952437,0.00009283482,0.000742778,0.00018963222,0.00041231303,0.00033435988],"genre_scores_gemma":[0.65342605,0.00018276105,0.3443646,0.0008461869,0.000066823144,0.00023230982,0.00076031056,0.000018861881,0.00010208301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981322,0.00018237624,0.0005281435,0.00060100795,0.00025173614,0.00030451294],"domain_scores_gemma":[0.99832255,0.00051224325,0.00022918629,0.000269013,0.00044754145,0.00021946777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060886383,0.00021852525,0.00035866862,0.00023005351,0.00056846306,0.00033727367,0.00019459026,0.00012465098,0.000057736295],"category_scores_gemma":[0.00029050652,0.0002106224,0.00010669854,0.0010121342,0.0001809933,0.0006094166,0.00006597816,0.00009323748,0.000005848096],"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.000011071158,0.000048671776,0.0003676475,0.000022086266,0.00007617801,4.782991e-7,0.00012518004,0.8640553,0.00002992838,0.1339877,0.00016107941,0.0011147178],"study_design_scores_gemma":[0.0014616188,0.00006789535,0.0013006801,0.000010117206,0.00008641396,0.000009060723,0.00006838741,0.9926484,0.0000050543404,0.003834442,0.0002550021,0.00025288368],"about_ca_topic_score_codex":0.000026195503,"about_ca_topic_score_gemma":0.0000013868589,"teacher_disagreement_score":0.6532515,"about_ca_system_score_codex":0.000034746772,"about_ca_system_score_gemma":0.00009280741,"threshold_uncertainty_score":0.8588932},"labels":[],"label_agreement":null}]}