{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"2e3221996a4b","filters":{"venue":"Foundations of Computing and Decision Sciences"}},"results":[{"id":"W2079396854","doi":"10.2478/v10209-011-0002-0","title":"Integrating imperfection of information into the promethee multicriteria decision aid methods: a general framework","year":2012,"lang":"en","type":"article","venue":"Foundations of Computing and Decision Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Fuzzy logic; Perfect information; Limit (mathematics); Complete information; Multiple-criteria decision analysis; Possibility theory; Decision theory; Decision analysis; Operations research; Fuzzy set; Management science; Artificial intelligence; Mathematics; Mathematical economics","authors":[{"name":"Sarah Ben Amor","is_ca":true},{"name":"Bertrand Mareschal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1173616830770792,"gpt":0.5092099071067949,"spread":0.3918482240297157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.02981259,0.0002560554,0.0005718917,0.001396101,0.001349915,0.001046089,0.001459923,0.0001542956,0.0001248677],"category_scores_gemma":[0.04974796,0.000147142,0.0001988533,0.003650721,0.0007273872,0.002736933,0.0008141712,0.0002808776,0.00003742566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004409104,"about_ca_system_score_gemma":0.0001339055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001352113,"about_ca_topic_score_gemma":0.000007403885,"domain_scores_codex":[0.9935288,0.0007280039,0.002391877,0.0004926497,0.002448696,0.0004099141],"domain_scores_gemma":[0.9683188,0.02778263,0.001515258,0.0008851823,0.001330932,0.0001672466],"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.00005389613,0.00006534027,0.006870553,0.000007665918,0.000009251034,5.015022e-8,0.01194298,0.001968499,0.002365323,0.01452358,0.0001813312,0.9620115],"study_design_scores_gemma":[0.0007794723,0.0002842549,0.04998964,0.0004804563,0.00003794526,0.00005177279,0.0145038,0.5873103,0.002922751,0.3352074,0.008021215,0.0004109279],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.47853,0.0001988615,0.5197256,0.00005786444,0.0009793915,0.0001904988,0.000002464819,0.00001974028,0.0002955035],"genre_scores_gemma":[0.495275,0.00001222593,0.504561,0.00005651686,0.00008170102,0.000004288423,0.000001195467,0.000004611937,0.000003476032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9616006,"threshold_uncertainty_score":0.9999909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390063511","doi":"10.2478/fcds-2023-0021","title":"A DNA Algorithm for Calculating the Maximum Flow of a Network","year":2023,"lang":"en","type":"article","venue":"Foundations of Computing and Decision Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Institute of Genetics","keywords":"DNA computing; Computer science; Maximum flow problem; Algorithm; Flow (mathematics); Flow network; Encoding (memory); Field (mathematics); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Computation","authors":[{"name":"Andrea Sackmann","is_ca":false},{"name":"Kristelle Brown","is_ca":false},{"name":"Piotr Formanowicz","is_ca":false},{"name":"Kevin Morgan","is_ca":false},{"name":"Noor Kalsheker","is_ca":false},{"name":"Jonathan M. Garibaldi","is_ca":false},{"name":"Jacek Błażewicz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04385491570993191,"gpt":0.3532504922015683,"spread":0.3093955764916364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280953,0.00005641671,0.0001027476,0.00003740267,0.0004378298,0.0000353501,0.0001983332,0.0000374144,0.000001450021],"category_scores_gemma":[0.0003793454,0.00003383866,0.00006007388,0.0004168648,0.0002507415,0.000003085069,0.000196007,0.00002473591,7.328468e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001212085,"about_ca_system_score_gemma":0.00003391597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004790797,"about_ca_topic_score_gemma":0.000002348265,"domain_scores_codex":[0.9992718,0.00002491093,0.0002375541,0.0001902675,0.0001294743,0.0001459799],"domain_scores_gemma":[0.999088,0.0005526421,0.0001231534,0.0001078235,0.0001074057,0.00002096469],"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.000008187662,0.00001182297,0.001167087,0.000005486499,0.00001053635,9.34314e-8,0.00006462118,0.01910197,0.004998954,0.000537243,0.0006068046,0.9734872],"study_design_scores_gemma":[0.0002746366,0.0004283937,0.00808967,0.00006508339,0.000009315107,0.000005162429,0.000358404,0.9641036,0.001937922,0.0212184,0.00340313,0.0001062595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6064044,0.00008223451,0.3931459,0.00005300243,0.0001153096,0.00007373311,0.000003699489,0.000006980131,0.0001147686],"genre_scores_gemma":[0.8342783,0.00001206275,0.1655251,0.00003617848,0.0001234268,0.000001609599,0.00001133693,0.000002101864,0.000009791071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9733809,"threshold_uncertainty_score":0.3367477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}