{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012682673,0.00040161604,0.9954086,0.00046168952,0.00002880473,0.00004735335,0.000024468718,0.000024650588,0.0023345586],"genre_scores_gemma":[0.17593451,0.0010552589,0.8198174,0.000256653,0.00019011633,0.00040938807,0.000066548666,0.00003829668,0.0022317856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9836337,0.010635644,0.00085705926,0.0011607656,0.003227624,0.0004852678],"domain_scores_gemma":[0.9816109,0.013686334,0.0011083657,0.0013563154,0.0018156102,0.00042249204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024630122,0.0018604766,0.0024690116,0.0040216683,0.0011909741,0.006501389,0.0039642486,0.002578849,0.002746607],"category_scores_gemma":[0.03196565,0.001350423,0.002299037,0.00298553,0.0069539626,0.007220988,0.0061897035,0.0042549907,0.00057427253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000026871578,0.00003556702,0.00035027816,0.00018525605,0.00008706956,0.00015595734,0.00027245656,0.12028834,0.00027991616,0.84984666,0.0007077871,0.027763901],"study_design_scores_gemma":[0.000019086818,0.00003975057,0.000102838705,0.00013306415,0.000037868926,0.00008910735,0.000058814807,0.3847372,0.00027752237,0.6106548,0.0038083838,0.000041669566],"about_ca_topic_score_codex":0.0021794143,"about_ca_topic_score_gemma":0.0018375462,"teacher_disagreement_score":0.024630122,"about_ca_system_score_codex":0.0029922442,"about_ca_system_score_gemma":0.0034872666,"threshold_uncertainty_score":0.13025802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011078608,0.00014001381,0.98495126,0.00018964111,0.00005031252,0.000086975524,0.00008741425,0.0006163734,0.0027994218],"genre_scores_gemma":[0.09727454,0.00012399368,0.9000403,0.00006482282,0.000034039327,0.0002116839,0.00016083894,0.00009046604,0.0019992606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931955,0.00020494613,0.000046379333,0.00015315483,0.00019627078,0.00007974413],"domain_scores_gemma":[0.9980001,0.0013444081,0.0001345635,0.000121436125,0.0003312888,0.0000681514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012308711,0.00078902417,0.00070768007,0.00206982,0.0008456934,0.0014477136,0.0015485723,0.001709338,0.006806684],"category_scores_gemma":[0.0065587447,0.00041588195,0.0005847365,0.0016918194,0.0011377594,0.0017115386,0.0011333202,0.00087894395,0.0010826879],"study_design_candidate":"theoretical_or_conceptual","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.0003062253,0.00012466939,0.0010126462,0.00026665913,0.00005994197,0.00012649721,0.0001746759,0.60685587,0.007858275,0.08370183,0.0036470373,0.2958656],"study_design_scores_gemma":[0.000082240884,0.000053849006,0.00015999058,0.000034369226,0.000012123024,0.000058707454,0.000029384775,0.9456152,0.003725701,0.047599565,0.0026134092,0.000015463735],"about_ca_topic_score_codex":0.0041071298,"about_ca_topic_score_gemma":0.0032082389,"teacher_disagreement_score":0.006806684,"about_ca_system_score_codex":0.0018895009,"about_ca_system_score_gemma":0.0024260692,"threshold_uncertainty_score":0.022770584},"labels":[],"label_agreement":null}]}