{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000595147,0.00007979843,0.98990107,0.008062913,0.00005083511,0.00070793024,0.000022036345,0.000013782757,0.0005664748],"genre_scores_gemma":[0.0074805273,0.00008476381,0.9899385,0.0001939449,0.0006122024,0.00009776282,0.00001594552,0.000048883816,0.0015274831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939941,0.0025165416,0.00093668024,0.00028212523,0.0017307857,0.00053976773],"domain_scores_gemma":[0.9812701,0.011529037,0.00042494445,0.00033156126,0.0061416547,0.00030271002],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.011731734,0.00018193759,0.00039756956,0.00041182802,0.0010713683,0.00040574698,0.0006350083,0.000054121127,0.00022829094],"category_scores_gemma":[0.008429453,0.00012335033,0.00013833963,0.00095289067,0.0005399699,0.0008699591,0.000070145885,0.0006646405,0.0000066673874],"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.0005018048,0.00024097225,0.0000130336275,0.000012258637,0.00016615754,0.0000055124515,0.0016890509,0.6973241,0.0007868817,0.08441121,0.002238131,0.21261089],"study_design_scores_gemma":[0.0009118325,0.0014463407,0.000009093112,0.000028310105,0.000018634519,0.00013520953,0.0042381557,0.97162944,0.001483539,0.0137078725,0.0062259245,0.00016566543],"about_ca_topic_score_codex":0.0000111707495,"about_ca_topic_score_gemma":0.0000375033,"teacher_disagreement_score":0.2743053,"about_ca_system_score_codex":0.00035616924,"about_ca_system_score_gemma":0.0012098235,"threshold_uncertainty_score":0.999923},"labels":[],"label_agreement":null}]}