{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Xiao-Wen Chang","is_ca":true},{"name":"Ren‐Cang Li","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003337388,0.001630056,0.0008689045,0.001281699,0.0006431619,0.001593228,0.0009746389,0.0009511273,0.006442688],"category_scores_gemma":[0.0139882,0.0005007865,0.000980345,0.001040407,0.002439772,0.002400939,0.002215482,0.002412454,0.001641205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001041142,"about_ca_system_score_gemma":0.0006818827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001569668,"about_ca_topic_score_gemma":0.0009652891,"domain_scores_codex":[0.997049,0.001231889,0.0001065477,0.0003531178,0.001085772,0.0001736718],"domain_scores_gemma":[0.9946362,0.003141788,0.0004223816,0.0006444501,0.0009967512,0.0001584073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000112126,0.00003028298,0.0003476134,0.000244236,0.0000601951,0.0001708377,0.0001972015,0.2540735,0.006280608,0.6989431,0.003250907,0.03628943],"study_design_scores_gemma":[0.000005948992,0.00003453949,0.0001204337,0.00002507334,0.00001039984,0.0000391511,0.00002281465,0.8136231,0.002442142,0.179827,0.003830472,0.00001894632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002738709,0.0003692085,0.9926562,0.0001720135,0.00009159884,0.00002190599,0.00003345573,0.0001184804,0.003798364],"genre_scores_gemma":[0.4683586,0.003365064,0.505036,0.0007799682,0.0008597577,0.0004204196,0.0004803566,0.0009788093,0.01972097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006442688,"threshold_uncertainty_score":0.02155298,"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","authors":[{"name":"Peter Benner","is_ca":false},{"name":"Ryan Lowe","is_ca":true},{"name":"Matthias Voigt","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006812032,0.001729904,0.001096079,0.001110873,0.0007939587,0.002848276,0.002268168,0.001676002,0.4365661],"category_scores_gemma":[0.003332958,0.0006588927,0.0009402152,0.001384035,0.001133283,0.002489248,0.002141325,0.002332358,0.1923487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001435795,"about_ca_system_score_gemma":0.00158513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002716236,"about_ca_topic_score_gemma":0.006773683,"domain_scores_codex":[0.9993964,0.00008404916,0.00002949458,0.00008014262,0.0003355341,0.0000742655],"domain_scores_gemma":[0.9987813,0.0004553279,0.00008512237,0.0002588887,0.000339136,0.0000803017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002385057,0.0002234773,0.001288391,0.001618433,0.00009227523,0.0007971273,0.0005206741,0.03833722,0.02372051,0.1171235,0.5782897,0.2377503],"study_design_scores_gemma":[0.0002478895,0.00008471031,0.0007013388,0.0002562867,0.00002265222,0.0004507288,0.0003624214,0.3249084,0.04322573,0.06607658,0.5635766,0.00008674],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00955754,0.0004419542,0.7302815,0.001799412,0.001348444,0.0004482154,0.01514062,0.05599924,0.1849831],"genre_scores_gemma":[0.1249824,0.0009463995,0.5848312,0.001365969,0.0003403583,0.001125946,0.02090439,0.1115675,0.1539358],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5634339,"threshold_uncertainty_score":0.8036702,"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","authors":[{"name":"Zhuoyu Xiao","is_ca":false},{"name":"Jane J. Ye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004154705,0.001288898,0.0009281774,0.0009790726,0.0007078993,0.001897562,0.00100923,0.001469234,0.006414029],"category_scores_gemma":[0.01246058,0.000637546,0.001043296,0.001302345,0.002338385,0.003180899,0.002151639,0.004037203,0.0008326878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001468832,"about_ca_system_score_gemma":0.001920603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003361249,"about_ca_topic_score_gemma":0.002531772,"domain_scores_codex":[0.9968657,0.001296152,0.0002196714,0.0005149577,0.0007792276,0.0003242631],"domain_scores_gemma":[0.9947173,0.003337663,0.000535213,0.0003025674,0.0008756254,0.0002315969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004905369,0.00004047974,0.0006077085,0.0002180936,0.00003030538,0.0001612903,0.0001328268,0.1947682,0.002323184,0.7840374,0.00328477,0.01434672],"study_design_scores_gemma":[0.00002830933,0.00006104037,0.0004661708,0.0000920707,0.00001479275,0.00008203561,0.00008774219,0.6565405,0.001772066,0.334062,0.006763993,0.00002941476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01219226,0.0003792093,0.9712359,0.0008076259,0.00006869408,0.00008556864,0.0005298654,0.00006588138,0.01463502],"genre_scores_gemma":[0.5502586,0.002511018,0.4278715,0.0008714623,0.0004951901,0.0009127888,0.002931386,0.000313127,0.01383501],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006414029,"threshold_uncertainty_score":0.02197242,"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","authors":[{"name":"Yu-Lin Chang","is_ca":true},{"name":"Chin‐Yu Yang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002465146,0.001222368,0.0005411864,0.002067181,0.001073418,0.001677147,0.001076845,0.0007759584,0.005521323],"category_scores_gemma":[0.004170345,0.000303701,0.001074361,0.001244693,0.002416005,0.003866995,0.001670074,0.003366598,0.0006682083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001864481,"about_ca_system_score_gemma":0.001217636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002728427,"about_ca_topic_score_gemma":0.002952804,"domain_scores_codex":[0.9990155,0.0004212564,0.00005824193,0.00009286456,0.0002877818,0.0001244813],"domain_scores_gemma":[0.9985983,0.0006496509,0.0001355061,0.000104088,0.000384546,0.0001279938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009000758,0.00001243979,0.00009841129,0.0000431156,0.000007277499,0.00005008953,0.00007484545,0.005984176,0.000932254,0.9863992,0.001186816,0.005202379],"study_design_scores_gemma":[0.000009030972,0.00003114077,0.0002464106,0.00004150533,0.00001151956,0.00006962258,0.00007852065,0.1282474,0.001443963,0.8647782,0.005021455,0.00002127614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03145971,0.00176904,0.9031034,0.001654812,0.0002640119,0.00008737989,0.0003928723,0.0001133985,0.06115535],"genre_scores_gemma":[0.7215785,0.004083761,0.2441448,0.001387951,0.0007243574,0.0003593961,0.0006183968,0.0004310182,0.02667176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005521323,"threshold_uncertainty_score":0.0184707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}