{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02463012,0.001860477,0.002469012,0.004021668,0.001190974,0.006501389,0.003964249,0.002578849,0.002746607],"category_scores_gemma":[0.03196565,0.001350423,0.002299037,0.00298553,0.006953963,0.007220988,0.006189703,0.004254991,0.0005742725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002992244,"about_ca_system_score_gemma":0.003487267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002179414,"about_ca_topic_score_gemma":0.001837546,"domain_scores_codex":[0.9836337,0.01063564,0.0008570593,0.001160766,0.003227624,0.0004852678],"domain_scores_gemma":[0.9816109,0.01368633,0.001108366,0.001356315,0.00181561,0.000422492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002687158,0.00003556702,0.0003502782,0.0001852561,0.00008706956,0.0001559573,0.0002724566,0.1202883,0.0002799162,0.8498467,0.0007077871,0.0277639],"study_design_scores_gemma":[0.00001908682,0.00003975057,0.0001028387,0.0001330642,0.00003786893,0.00008910735,0.00005881481,0.3847372,0.0002775224,0.6106548,0.003808384,0.00004166957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001268267,0.000401616,0.9954086,0.0004616895,0.00002880473,0.00004735335,0.00002446872,0.00002465059,0.002334559],"genre_scores_gemma":[0.1759345,0.001055259,0.8198174,0.000256653,0.0001901163,0.0004093881,0.00006654867,0.00003829668,0.002231786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02463012,"threshold_uncertainty_score":0.130258,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230871,0.0007890242,0.0007076801,0.00206982,0.0008456934,0.001447714,0.001548572,0.001709338,0.006806684],"category_scores_gemma":[0.006558745,0.000415882,0.0005847365,0.001691819,0.001137759,0.001711539,0.00113332,0.0008789439,0.001082688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001889501,"about_ca_system_score_gemma":0.002426069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00410713,"about_ca_topic_score_gemma":0.003208239,"domain_scores_codex":[0.9993196,0.0002049461,0.00004637933,0.0001531548,0.0001962708,0.00007974413],"domain_scores_gemma":[0.9980001,0.001344408,0.0001345635,0.0001214361,0.0003312888,0.0000681514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003062253,0.0001246694,0.001012646,0.0002666591,0.00005994197,0.0001264972,0.0001746759,0.6068559,0.007858275,0.08370183,0.003647037,0.2958656],"study_design_scores_gemma":[0.00008224088,0.00005384901,0.0001599906,0.00003436923,0.00001212302,0.00005870745,0.00002938478,0.9456152,0.003725701,0.04759957,0.002613409,0.00001546373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01107861,0.0001400138,0.9849513,0.0001896411,0.00005031252,0.00008697552,0.00008741425,0.0006163734,0.002799422],"genre_scores_gemma":[0.09727454,0.0001239937,0.9000403,0.00006482282,0.00003403933,0.0002116839,0.0001608389,0.00009046604,0.001999261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006806684,"threshold_uncertainty_score":0.02277058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}