{"id":"W2098749004","doi":"10.1145/1281100.1281117","title":"On the complexity of greedy routing in ring-based peer-to-peer networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Upper and lower bounds; Routing (electronic design automation); Ring (chemistry); Successor cardinal; Node (physics); Mathematics; Greedy algorithm; Discrete mathematics; Network topology; Topology (electrical circuits); Computer science; Computer network; Algorithm; Physics","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.004217408,0.001415164,0.002446749,0.001575578,0.00187723,0.003692095,0.003708771,0.002900611,0.004941194],"category_scores_gemma":[0.03486185,0.001066274,0.00145395,0.002106986,0.002995465,0.008931347,0.003682476,0.0028314,0.0006168422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004559718,"about_ca_system_score_gemma":0.002057214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004783238,"about_ca_topic_score_gemma":0.003530459,"domain_scores_codex":[0.9957041,0.001782302,0.0001962542,0.0006756753,0.0008543528,0.0007872713],"domain_scores_gemma":[0.9266304,0.06512058,0.003073048,0.002319111,0.00130813,0.001548691],"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.0006626603,0.0001540122,0.003115139,0.000305772,0.0001515966,0.0003299382,0.000345225,0.8624751,0.001834262,0.1067221,0.006267818,0.01763647],"study_design_scores_gemma":[0.00006762311,0.00004571321,0.0003780382,0.00001782365,0.00003440132,0.0001076001,0.00007643325,0.9008505,0.0003535633,0.09734182,0.0007075823,0.00001890745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4183091,0.003693803,0.5432225,0.009096605,0.0002760914,0.000516823,0.001969143,0.001131859,0.02178401],"genre_scores_gemma":[0.9086538,0.002255852,0.08137456,0.0005898313,0.0003347948,0.0005563922,0.001149249,0.0003170772,0.004768445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004941194,"threshold_uncertainty_score":0.0330832,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05092940374219191,"score_gpt":0.2797051576839101,"score_spread":0.2287757539417182,"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."}}