{"id":"W2128098252","doi":"10.6138/jit.2014.15.1.12","title":"Equilibrium Flows and Path Dilation for a Network Forwarding Game","year":2014,"lang":"en","type":"article","venue":"網際網路技術學刊","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Shortest path problem; Packet forwarding; Node (physics); Path (computing); Network packet; Routing (electronic design automation); Nash equilibrium; Relay; Computer network; Flow (mathematics); Flow network; Mathematical optimization; Graph; Mathematics; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533625,0.0001267741,0.0001752664,0.0000300299,0.00007536209,0.0001717612,0.0003381814,0.00007361289,0.000004508011],"category_scores_gemma":[0.00005657187,0.0001205276,0.00005977015,0.0001824352,0.00001885457,0.0003876135,0.0002282453,0.00008013021,0.00001251787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000202353,"about_ca_system_score_gemma":0.00001580969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003960043,"about_ca_topic_score_gemma":0.000007024762,"domain_scores_codex":[0.9988471,0.00005211415,0.0001927268,0.0003775009,0.0001405382,0.0003900134],"domain_scores_gemma":[0.9990563,0.0002777162,0.00008192009,0.0004378937,0.00004520341,0.0001009514],"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.00004319386,0.00004611264,0.003762505,0.00010938,0.00005038425,0.000003979028,0.0008574488,0.05836098,0.001266178,0.3792789,0.0282074,0.5280135],"study_design_scores_gemma":[0.0003287216,0.00009634997,0.001135757,0.00002919951,0.000007054594,0.000005251607,0.000001816516,0.9266717,0.00005376229,0.02060018,0.0509203,0.0001499223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01837395,0.0001782297,0.9783648,0.0003574119,0.0006041522,0.000349065,0.000001008467,0.0001723481,0.001598986],"genre_scores_gemma":[0.9200397,0.000008041083,0.07825659,0.0004392198,0.0009615386,0.00008267678,0.000005425757,0.00001743371,0.0001894004],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9016657,"threshold_uncertainty_score":0.4914975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01023242073718173,"score_gpt":0.2233301645475133,"score_spread":0.2130977438103316,"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."}}