{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"f1dc5daf9e80","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01520613127707601,"gpt":0.2219427053534069,"spread":0.2067365740763309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001252166,0.0001120156,0.000189743,0.0001254683,0.0001892377,0.00007030884,0.0001949597,0.00005904316,0.00004597505],"category_scores_gemma":[0.0001029433,0.00009411356,0.00009068406,0.000635071,0.00002984719,0.0004179208,0.00002891342,0.00004528917,0.000003220256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001332299,"about_ca_system_score_gemma":0.00001428899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008084427,"about_ca_topic_score_gemma":5.436942e-7,"domain_scores_codex":[0.9991833,0.00006669342,0.000194229,0.000309235,0.00009484067,0.0001516788],"domain_scores_gemma":[0.9992678,0.0001768515,0.0001108335,0.0001952121,0.0001593685,0.00008990087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001111864,0.0002851595,0.003950775,0.00001510098,0.0005125125,9.38932e-7,0.002929675,0.149827,0.0001173937,0.8082713,0.00003465522,0.0339442],"study_design_scores_gemma":[0.0005704237,0.0000790306,0.002822841,0.000001355527,0.0001163693,6.345898e-7,0.00001693091,0.9847857,0.00008548216,0.01127012,0.0001231972,0.0001279697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001763156,0.00005567494,0.9985715,0.0003045623,0.00006937525,0.0003018542,0.00001483446,0.000115196,0.0003906485],"genre_scores_gemma":[0.6965914,0.0000127092,0.3028853,0.0002371893,0.0000372318,0.00007771406,0.00003020338,0.00000554666,0.0001226781],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8349586,"threshold_uncertainty_score":0.3837839,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00909950472901929,"gpt":0.2406777535330094,"spread":0.2315782488039901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001212268,0.001077805,0.001383028,0.0004352201,0.001458165,0.001522402,0.0009669285,0.0005106748,0.00007582435],"category_scores_gemma":[0.0002062064,0.0009380187,0.0003959491,0.001105785,0.0002717982,0.002946876,0.0003406966,0.0003824423,0.00004348805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004001898,"about_ca_system_score_gemma":0.0002572706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002730102,"about_ca_topic_score_gemma":0.00001521679,"domain_scores_codex":[0.9936236,0.0004680267,0.001667634,0.00163332,0.001139415,0.001468041],"domain_scores_gemma":[0.9958665,0.0004586614,0.001079798,0.0008113848,0.001136087,0.0006475713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00130802,0.0008418088,0.000184564,0.0005798244,0.0009531733,0.0000550027,0.005456984,0.4224509,0.007899594,0.525728,0.001036884,0.03350526],"study_design_scores_gemma":[0.005719071,0.000826614,0.00008650006,0.0001579187,0.0002347686,0.00008423992,0.0001274617,0.9793629,0.0004195278,0.005511459,0.006407289,0.001062215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03607723,0.0009781769,0.9569842,0.000461362,0.002084116,0.002448848,0.0002713343,0.0005193692,0.0001753285],"genre_scores_gemma":[0.7342254,0.0001032946,0.2623774,0.0008430808,0.001245097,0.0001937656,0.0005129864,0.0001206537,0.0003783012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6981482,"threshold_uncertainty_score":0.9998418,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01797478480038908,"gpt":0.2632299106870835,"spread":0.2452551258866944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088638,0.0002185253,0.0003586686,0.0002300535,0.0005684631,0.0003372737,0.0001945903,0.000124651,0.0000577363],"category_scores_gemma":[0.0002905065,0.0002106224,0.0001066985,0.001012134,0.0001809933,0.0006094166,0.00006597816,0.00009323748,0.000005848096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003474677,"about_ca_system_score_gemma":0.00009280741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000261955,"about_ca_topic_score_gemma":0.000001386859,"domain_scores_codex":[0.9981322,0.0001823762,0.0005281435,0.000601008,0.0002517361,0.0003045129],"domain_scores_gemma":[0.9983225,0.0005122432,0.0002291863,0.000269013,0.0004475414,0.0002194678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001107116,0.00004867178,0.0003676475,0.00002208627,0.00007617801,4.782991e-7,0.00012518,0.8640553,0.00002992838,0.1339877,0.0001610794,0.001114718],"study_design_scores_gemma":[0.001461619,0.00006789535,0.00130068,0.00001011721,0.00008641396,0.000009060723,0.00006838741,0.9926484,0.00000505434,0.003834442,0.0002550021,0.0002528837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001744986,0.00006140746,0.9880397,0.009952437,0.00009283482,0.000742778,0.0001896322,0.000412313,0.0003343599],"genre_scores_gemma":[0.6534261,0.0001827611,0.3443646,0.0008461869,0.00006682314,0.0002323098,0.0007603106,0.00001886188,0.000102083],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6532515,"threshold_uncertainty_score":0.8588932,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0235051101626948,"gpt":0.3033407763515031,"spread":0.2798356661888083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000560214,0.0003096637,0.0005388879,0.0003070928,0.0001629905,0.0001584739,0.0001634916,0.0001943536,0.0006605741],"category_scores_gemma":[0.0008203273,0.0002807218,0.000079753,0.0005881535,0.00008567274,0.001219044,0.00006279641,0.000348658,0.00004315512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009965441,"about_ca_system_score_gemma":0.00004058304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001322223,"about_ca_topic_score_gemma":0.00001212674,"domain_scores_codex":[0.9972923,0.0005072255,0.0007244291,0.0005100693,0.0004572147,0.0005087079],"domain_scores_gemma":[0.9979951,0.00098283,0.0002232948,0.0002864756,0.0002840911,0.000228258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004038877,0.0006999187,0.00205376,0.0001927643,0.0001740795,0.00001214669,0.001035612,0.7414843,0.0004396214,0.1369585,0.0006840015,0.1158615],"study_design_scores_gemma":[0.002049937,0.0001469869,0.001486918,0.00001941482,0.00003088373,0.000007937827,0.000231739,0.8205683,0.00004096255,0.175018,0.0001064958,0.0002923776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004090682,0.0003810088,0.9926919,0.001425388,0.0001150454,0.0009448676,0.000007078842,0.0001815328,0.0001625502],"genre_scores_gemma":[0.3007824,0.0001841405,0.6965243,0.0009572683,0.0002270956,0.0003824343,0.00004553204,0.0001026337,0.0007942165],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2966917,"threshold_uncertainty_score":0.9999645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}