{"id":"W7030217835","doi":"","title":"METIS: a highly-robust fault-tolerant routing algorithm with a recursive-based path discovery scheme for 2d mesh network-on-chip-interconnected chip multi-processors","year":2014,"lang":"en","type":"dissertation","venue":"Ktisis at Cyprus University of Technology (Cyprus University of Technology)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Routing table; Router; Network packet; Equal-cost multi-path routing; Interconnection; Static routing; Link-state routing protocol; Routing (electronic design automation)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.000569547,0.001072506,0.002251433,0.003544412,0.001359962,0.00006546082,0.004845452,0.00297238,0.0000353637],"category_scores_gemma":[0.0001549718,0.001232353,0.0007862867,0.003386957,0.001071152,0.0005723603,0.000875488,0.001458753,0.00002158778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007741757,"about_ca_system_score_gemma":0.0004410935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007501222,"about_ca_topic_score_gemma":0.003565923,"domain_scores_codex":[0.9949653,0.0001740472,0.0007828745,0.002189348,0.0006300298,0.001258374],"domain_scores_gemma":[0.9936702,0.0002662696,0.002577801,0.002031084,0.001273155,0.0001815523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.02030937,0.007915395,0.01652539,0.007214068,0.01948107,0.003914625,0.0118126,0.0393023,0.009413323,0.5471895,0.0402254,0.276697],"study_design_scores_gemma":[0.04555888,0.01538249,0.003038427,0.02160588,0.004280518,0.0004451487,0.06826536,0.7041509,0.03977049,0.005520109,0.08094309,0.01103877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2931632,0.0004791072,0.6984909,0.002007753,0.000957899,0.001983862,0.0003107487,0.001829131,0.000777419],"genre_scores_gemma":[0.7261193,0.000262575,0.2691822,0.0000669671,0.00007594766,0.000007926388,0.0004432996,0.0001203778,0.00372137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6648486,"threshold_uncertainty_score":0.9999402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009664328281117537,"score_gpt":0.1981787967192097,"score_spread":0.1885144684380922,"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."}}