{"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":"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.0027387093,0.0003692085,0.99265623,0.00017201355,0.00009159884,0.000021905995,0.000033455734,0.00011848041,0.0037983637],"genre_scores_gemma":[0.46835864,0.0033650636,0.505036,0.0007799682,0.00085975765,0.0004204196,0.0004803566,0.0009788093,0.019720968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704903,0.0012318892,0.00010654765,0.00035311776,0.0010857718,0.00017367178],"domain_scores_gemma":[0.99463624,0.0031417876,0.0004223816,0.0006444501,0.0009967512,0.0001584073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033373877,0.001630056,0.00086890446,0.0012816992,0.0006431619,0.0015932278,0.0009746389,0.00095112727,0.0064426884],"category_scores_gemma":[0.013988202,0.0005007865,0.000980345,0.0010404066,0.0024397725,0.0024009394,0.0022154818,0.0024124542,0.0016412047],"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.00011212598,0.000030282981,0.00034761342,0.00024423603,0.0000601951,0.00017083771,0.00019720147,0.25407353,0.006280608,0.6989431,0.0032509074,0.03628943],"study_design_scores_gemma":[0.0000059489917,0.00003453949,0.00012043366,0.00002507334,0.000010399843,0.0000391511,0.000022814647,0.81362313,0.0024421415,0.17982699,0.0038304725,0.000018946323],"about_ca_topic_score_codex":0.0015696684,"about_ca_topic_score_gemma":0.0009652891,"teacher_disagreement_score":0.0064426884,"about_ca_system_score_codex":0.0010411419,"about_ca_system_score_gemma":0.00068188267,"threshold_uncertainty_score":0.02155298},"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":"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.031459708,0.0017690395,0.9031034,0.0016548117,0.00026401188,0.000087379885,0.00039287235,0.00011339849,0.061155353],"genre_scores_gemma":[0.72157854,0.004083761,0.24414483,0.0013879511,0.0007243574,0.00035939613,0.0006183968,0.00043101824,0.02667176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901545,0.00042125644,0.000058241927,0.00009286456,0.00028778182,0.00012448132],"domain_scores_gemma":[0.9985983,0.0006496509,0.00013550607,0.000104088016,0.000384546,0.00012799383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002465146,0.0012223677,0.0005411864,0.002067181,0.0010734177,0.0016771468,0.0010768449,0.00077595835,0.005521323],"category_scores_gemma":[0.004170345,0.000303701,0.0010743606,0.0012446933,0.002416005,0.003866995,0.0016700744,0.0033665984,0.0006682083],"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.000009000758,0.000012439789,0.00009841129,0.000043115597,0.000007277499,0.00005008953,0.00007484545,0.0059841764,0.000932254,0.9863992,0.001186816,0.0052023786],"study_design_scores_gemma":[0.000009030972,0.000031140768,0.00024641058,0.000041505325,0.000011519558,0.00006962258,0.00007852065,0.12824737,0.0014439631,0.8647782,0.005021455,0.000021276135],"about_ca_topic_score_codex":0.0027284266,"about_ca_topic_score_gemma":0.0029528039,"teacher_disagreement_score":0.005521323,"about_ca_system_score_codex":0.0018644806,"about_ca_system_score_gemma":0.0012176359,"threshold_uncertainty_score":0.018470705},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00955754,0.00044195424,0.7302815,0.0017994121,0.0013484437,0.0004482154,0.015140619,0.055999238,0.18498313],"genre_scores_gemma":[0.12498245,0.0009463995,0.5848312,0.0013659688,0.0003403583,0.0011259463,0.020904386,0.11156745,0.15393585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939644,0.00008404916,0.000029494577,0.00008014262,0.00033553407,0.000074265496],"domain_scores_gemma":[0.99878126,0.00045532794,0.00008512237,0.00025888873,0.000339136,0.0000803017],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006812032,0.0017299041,0.0010960794,0.0011108732,0.0007939587,0.002848276,0.002268168,0.0016760023,0.43656605],"category_scores_gemma":[0.0033329576,0.00065889274,0.0009402152,0.0013840352,0.0011332835,0.0024892478,0.0021413248,0.002332358,0.1923487],"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.00023850567,0.00022347725,0.0012883907,0.0016184333,0.00009227523,0.00079712726,0.0005206741,0.03833722,0.023720507,0.11712346,0.5782897,0.23775026],"study_design_scores_gemma":[0.00024788952,0.000084710315,0.0007013388,0.00025628673,0.000022652224,0.0004507288,0.00036242144,0.32490844,0.043225728,0.06607658,0.56357664,0.00008674],"about_ca_topic_score_codex":0.0027162356,"about_ca_topic_score_gemma":0.0067736832,"teacher_disagreement_score":0.56343395,"about_ca_system_score_codex":0.0014357946,"about_ca_system_score_gemma":0.0015851295,"threshold_uncertainty_score":0.80367017},"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":"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.01219226,0.00037920935,0.9712359,0.00080762594,0.00006869408,0.000085568645,0.00052986544,0.00006588138,0.014635015],"genre_scores_gemma":[0.5502586,0.002511018,0.42787147,0.00087146234,0.0004951901,0.0009127888,0.002931386,0.000313127,0.013835007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968657,0.001296152,0.00021967139,0.0005149577,0.00077922764,0.00032426306],"domain_scores_gemma":[0.9947173,0.0033376634,0.00053521304,0.00030256735,0.00087562535,0.00023159692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041547045,0.0012888979,0.0009281774,0.0009790726,0.00070789934,0.001897562,0.0010092297,0.0014692344,0.0064140293],"category_scores_gemma":[0.012460579,0.000637546,0.0010432956,0.0013023447,0.0023383854,0.0031808987,0.002151639,0.0040372033,0.0008326878],"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.00004905369,0.000040479736,0.00060770847,0.00021809363,0.000030305377,0.0001612903,0.00013282683,0.19476822,0.002323184,0.78403735,0.0032847696,0.014346722],"study_design_scores_gemma":[0.00002830933,0.000061040366,0.0004661708,0.000092070695,0.000014792747,0.000082035614,0.00008774219,0.65654045,0.0017720665,0.33406198,0.0067639933,0.000029414765],"about_ca_topic_score_codex":0.003361249,"about_ca_topic_score_gemma":0.0025317722,"teacher_disagreement_score":0.0064140293,"about_ca_system_score_codex":0.0014688317,"about_ca_system_score_gemma":0.0019206034,"threshold_uncertainty_score":0.021972418},"labels":[],"label_agreement":null}]}