{"meta":{"query_hash":"2e3221996a4b","filters":{"venue":"Foundations of Computing and Decision Sciences"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/2e3221996a4b","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11736168307707921,"score_gpt":0.5092099071067949,"score_spread":0.3918482240297157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079396854","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.47853005,0.00019886145,0.5197256,0.000057864436,0.0009793915,0.00019049882,0.0000024648186,0.000019740275,0.00029550353],"genre_scores_gemma":[0.495275,0.0000122259335,0.504561,0.000056516863,0.00008170102,0.0000042884226,0.0000011954671,0.000004611937,0.0000034760321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99352884,0.00072800386,0.0023918771,0.0004926497,0.0024486957,0.00040991406],"domain_scores_gemma":[0.96831876,0.027782632,0.0015152581,0.0008851823,0.0013309323,0.0001672466],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.02981259,0.00025605535,0.0005718917,0.001396101,0.0013499147,0.001046089,0.001459923,0.00015429562,0.00012486773],"category_scores_gemma":[0.049747963,0.000147142,0.0001988533,0.0036507214,0.0007273872,0.0027369326,0.00081417116,0.00028087758,0.000037425656],"study_design_candidate":"design_other","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.000053896132,0.000065340275,0.006870553,0.000007665918,0.000009251034,5.0150224e-8,0.011942975,0.001968499,0.0023653226,0.014523579,0.0001813312,0.9620115],"study_design_scores_gemma":[0.0007794723,0.0002842549,0.049989637,0.00048045634,0.00003794526,0.00005177279,0.014503805,0.5873103,0.0029227505,0.33520743,0.008021215,0.00041092793],"about_ca_topic_score_codex":0.00013521126,"about_ca_topic_score_gemma":0.0000074038853,"teacher_disagreement_score":0.9616006,"about_ca_system_score_codex":0.000044091044,"about_ca_system_score_gemma":0.00013390555,"threshold_uncertainty_score":0.99999094},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.043854915709931906,"score_gpt":0.3532504922015683,"score_spread":0.3093955764916364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390063511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60640436,0.00008223451,0.3931459,0.00005300243,0.0001153096,0.000073733114,0.000003699489,0.0000069801313,0.0001147686],"genre_scores_gemma":[0.83427835,0.000012062748,0.16552514,0.00003617848,0.00012342675,0.0000016095994,0.000011336927,0.0000021018639,0.000009791071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992718,0.000024910934,0.0002375541,0.00019026753,0.00012947433,0.0001459799],"domain_scores_gemma":[0.999088,0.0005526421,0.00012315344,0.00010782354,0.000107405736,0.000020964686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280953,0.00005641671,0.0001027476,0.00003740267,0.00043782982,0.0000353501,0.00019833316,0.0000374144,0.000001450021],"category_scores_gemma":[0.00037934544,0.000033838664,0.00006007388,0.00041686482,0.0002507415,0.0000030850695,0.00019600698,0.00002473591,7.3284684e-7],"study_design_candidate":"simulation_or_modeling","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.000008187662,0.000011822972,0.0011670868,0.000005486499,0.000010536353,9.3431396e-8,0.000064621185,0.019101966,0.0049989535,0.000537243,0.0006068046,0.9734872],"study_design_scores_gemma":[0.00027463664,0.00042839366,0.00808967,0.00006508339,0.0000093151075,0.0000051624293,0.00035840398,0.96410364,0.0019379216,0.0212184,0.0034031302,0.00010625945],"about_ca_topic_score_codex":0.000004790797,"about_ca_topic_score_gemma":0.0000023482648,"teacher_disagreement_score":0.9733809,"about_ca_system_score_codex":0.0000012120853,"about_ca_system_score_gemma":0.000033915974,"threshold_uncertainty_score":0.3367477},"labels":[],"label_agreement":null}]}