{"id":"W4226080534","doi":"10.21203/rs.3.rs-1499946/v1","title":"Mehar approach to solve neutrosophic linear programming problems using possibilistic mean","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decision maker; Linear programming; Mathematical optimization; Computer science; Mathematics; Operations research","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","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002206277,0.0004757694,0.0006034066,0.0007472683,0.000477587,0.000507761,0.0008652516,0.0003354921,0.0002303964],"category_scores_gemma":[0.00040775,0.0004903927,0.0002430959,0.001240091,0.0001180886,0.000114401,0.001886821,0.002905347,0.00006282444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007447159,"about_ca_system_score_gemma":0.0002159544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007635338,"about_ca_topic_score_gemma":0.000008924611,"domain_scores_codex":[0.9953334,0.000218423,0.0006744789,0.0009026135,0.001573817,0.001297319],"domain_scores_gemma":[0.9976984,0.0001947662,0.00006885734,0.001057496,0.0004166668,0.0005637878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001073434,0.0002918276,0.0000196398,0.007935251,0.00008685443,0.00001709011,0.002816219,0.9824598,0.0002334261,0.002820841,0.0001655154,0.003142788],"study_design_scores_gemma":[0.0002557459,0.0001332336,0.00001114106,0.0006727805,0.00004150211,0.00001013696,0.001284446,0.9884028,0.00007624787,0.002251115,0.006201786,0.0006590845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04476253,0.002994629,0.8951719,0.0003492916,0.00147132,0.02046868,0.0002587322,0.004522761,0.03000009],"genre_scores_gemma":[0.4644081,0.0001079266,0.5300353,0.00003537546,0.0007099553,0.003146331,0.0005482238,0.0005532363,0.0004555264],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4196456,"threshold_uncertainty_score":0.9997548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1408224592845325,"score_gpt":0.3880737058554663,"score_spread":0.2472512465709338,"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."}}