{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294866,0.0009969533,0.0008897807,0.0009421397,0.0008714155,0.001686886,0.001036608,0.00142141,0.003644153],"category_scores_gemma":[0.01647523,0.0005020368,0.0005421596,0.000584607,0.00253909,0.003268798,0.001181861,0.001176317,0.0002154123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003316318,"about_ca_system_score_gemma":0.001359886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001721827,"about_ca_topic_score_gemma":0.0008199188,"domain_scores_codex":[0.9981342,0.0009466027,0.00007285004,0.0002596489,0.0003015567,0.0002852376],"domain_scores_gemma":[0.9853861,0.0114554,0.001677209,0.0005720852,0.0004347567,0.0004744517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004579155,0.0003728348,0.001673055,0.0001064218,0.00004885358,0.0002021727,0.0004139909,0.6080044,0.01396499,0.3623016,0.001080389,0.01137335],"study_design_scores_gemma":[0.00007311426,0.0001537129,0.0005220519,0.00001029766,0.00001564942,0.00008289317,0.00008960163,0.8710368,0.002048263,0.1254021,0.0005463598,0.0000190667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6465158,0.0001445442,0.3384311,0.0006469366,0.00003814817,0.0002804353,0.0002241358,0.0002201192,0.01349871],"genre_scores_gemma":[0.954964,0.0001468387,0.04244648,0.00007891027,0.00001887829,0.0002432611,0.00009397908,0.00004922338,0.00195853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003644153,"threshold_uncertainty_score":0.02406162,"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."}}