{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003517359,0.0002346654,0.0002932501,0.0003577304,0.0001247568,0.0001009429,0.002579715,0.0001360578,0.00002218398],"category_scores_gemma":[0.000828498,0.0001714613,0.00007976277,0.002087555,0.0001981701,0.0001160339,0.0008367729,0.0004655729,0.00005341251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001319257,"about_ca_system_score_gemma":0.00004154374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003690142,"about_ca_topic_score_gemma":0.00166681,"domain_scores_codex":[0.997218,0.00007091495,0.0004941127,0.0005267815,0.0009153945,0.0007747932],"domain_scores_gemma":[0.9973722,0.0007969699,0.0001228737,0.001306435,0.0002827294,0.0001188159],"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.00004557912,0.0001528987,0.009060047,0.000005799242,0.00001438597,0.00003333885,0.0004256014,0.117437,0.0001545026,0.829897,0.01427106,0.02850276],"study_design_scores_gemma":[0.0005381712,0.0003523575,0.09342705,0.0001296649,0.000004109729,0.000004772213,0.0001749877,0.8778188,0.006529703,0.01848984,0.002034754,0.0004957644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1365394,0.000007669063,0.8215906,0.03119397,0.0002728677,0.0003878945,0.000001326,0.0005064551,0.009499811],"genre_scores_gemma":[0.929278,1.772184e-7,0.0670095,0.003234086,0.00004760141,0.00001258977,0.000001369023,0.00001327764,0.0004033722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8114071,"threshold_uncertainty_score":0.6991991,"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."}}