{"id":"W2904097672","doi":"10.22111/ieco.2018.26308.1072","title":"OSA: Orientation Search Algorithm","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematical optimization; Algorithm; Particle swarm optimization; Set (abstract data type); Computer science; Series (stratigraphy); Orientation (vector space); Position (finance); Meta-optimization; Optimization problem; Optimization algorithm; Genetic algorithm; Metaheuristic; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003199608,0.0003063804,0.0006680475,0.001412033,0.0002659235,0.003646805,0.007618324,0.0001181082,0.01511347],"category_scores_gemma":[0.0004052013,0.0002853347,0.0001630012,0.003198301,0.0001161021,0.005546172,0.002978322,0.000584576,0.0004859203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001631059,"about_ca_system_score_gemma":0.0004619975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003955851,"about_ca_topic_score_gemma":0.000003612731,"domain_scores_codex":[0.99467,0.0006585268,0.0009442325,0.0008305621,0.00225529,0.0006413697],"domain_scores_gemma":[0.9959899,0.0005921986,0.0005384246,0.001243349,0.001186636,0.0004494829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001125693,0.0008771861,0.1664068,0.0002321095,0.0004180678,0.0001678145,0.001002579,0.008214739,0.02680386,0.006333712,0.04921547,0.7402151],"study_design_scores_gemma":[0.002786615,0.00008297569,0.3711938,0.0003930147,0.0000541201,0.0000865559,0.0001793657,0.5354462,0.05422241,0.0132844,0.02080375,0.00146681],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04429477,0.002964965,0.9366652,0.0005252323,0.002035393,0.001328395,0.00003416301,0.0001258867,0.01202594],"genre_scores_gemma":[0.4636426,0.0139114,0.5038061,0.001304137,0.0008493126,0.0001999379,0.00009620167,0.0002417664,0.01594852],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7387483,"threshold_uncertainty_score":0.9999599,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2430116987600386,"score_gpt":0.5708841893507449,"score_spread":0.3278724905907063,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}