{"meta":{"query_hash":"8c10bb942370","filters":{"venue":"American Journal of Operational Research"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/8c10bb942370","api":"https://metacan.xera.ac/api/v1/cohort?venue=American+Journal+of+Operational+Research"},"results":[{"id":"W1601244479","doi":"","title":"The Eigenstep Method: An Iterative Method for Unconstrained Quadratic Optimization","year":2005,"lang":"en","type":"article","venue":"American Journal of Operational Research","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":"University of Windsor","funders":"","keywords":"Line search; Mathematical optimization; Hessian matrix; Gradient descent; Mathematics; Broyden–Fletcher–Goldfarb–Shanno algorithm; Gradient method; Method of steepest descent; Convergence (economics); Quadratic programming; Convex optimization; Iterative method; Descent (aeronautics); Applied mathematics; Regular polygon; Computer science; Artificial neural network; Artificial intelligence","score_opus":0.13024549217559736,"score_gpt":0.5364030428115195,"score_spread":0.4061575506359222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601244479","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.0005861174,0.00010993915,0.99781847,0.0000429275,0.000040742907,0.000025439862,0.00001962375,0.00023347013,0.0011232749],"genre_scores_gemma":[0.032161124,0.00040889022,0.96064484,0.00010917238,0.00007877323,0.00017714582,0.00009491097,0.00025223618,0.0060729636],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943274,0.00017161749,0.000023643304,0.000061363564,0.0002760251,0.000034617555],"domain_scores_gemma":[0.9994968,0.00024627426,0.000039944283,0.00006692989,0.00011827034,0.000031770043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007640546,0.00075497845,0.00076149125,0.0005934358,0.00031811386,0.000734266,0.0011719608,0.00088003837,0.0046467306],"category_scores_gemma":[0.0017589068,0.0003590935,0.0006597058,0.000630497,0.00063968083,0.0009259785,0.001210502,0.0011815656,0.0020021163],"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.00014328423,0.00018275439,0.0007829715,0.0005983155,0.00017495632,0.0003359948,0.00020262392,0.2782274,0.028219383,0.09801431,0.022492738,0.57062525],"study_design_scores_gemma":[0.000039684208,0.00007697513,0.00022547223,0.000031650296,0.00001588317,0.00017831831,0.000017677672,0.9448152,0.0071959016,0.016467044,0.0309014,0.00003484007],"about_ca_topic_score_codex":0.0013349386,"about_ca_topic_score_gemma":0.0021839007,"teacher_disagreement_score":0.0046467306,"about_ca_system_score_codex":0.00025233682,"about_ca_system_score_gemma":0.0011517347,"threshold_uncertainty_score":0.015544832},"labels":[],"label_agreement":null}]}