{"id":"W2149875071","doi":"10.1109/ccece.2004.1344956","title":"Pie: scalable routing in peer-to-peer networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Pastry; Distributed hash table; Computer science; Chord (peer-to-peer); Scalability; Distributed computing; Peer-to-peer; Computer network; Hash table; Routing protocol; Routing (electronic design automation); Hash function; Consistent hashing; Load balancing (electrical power); Theoretical computer science; Database; Computer security","routes":{"ca_aff":true,"ca_fund":true,"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.002203662,0.0007142029,0.0007988038,0.001049467,0.001052472,0.001931021,0.002497811,0.0007423073,0.004816722],"category_scores_gemma":[0.006016628,0.0003768253,0.0002963202,0.001580042,0.0006499744,0.004006153,0.002208792,0.001090545,0.001753465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006391162,"about_ca_system_score_gemma":0.001152775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001212116,"about_ca_topic_score_gemma":0.001235179,"domain_scores_codex":[0.9984799,0.0002952141,0.00009542618,0.0001617617,0.0008243383,0.0001432715],"domain_scores_gemma":[0.9982287,0.0006637344,0.0001356492,0.000440671,0.0003466914,0.0001846105],"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.0005276094,0.0002277247,0.001748758,0.0007932234,0.0001289615,0.0004919873,0.0004042028,0.141046,0.0278082,0.09638214,0.06893081,0.6615103],"study_design_scores_gemma":[0.0002598604,0.0005555609,0.001351507,0.0001009851,0.00009606723,0.001243148,0.0002963637,0.6892324,0.03226926,0.1119369,0.1625256,0.0001321689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01285966,0.001647418,0.9507763,0.0007162134,0.0004076584,0.0006056635,0.0006075306,0.01749436,0.01488523],"genre_scores_gemma":[0.2486648,0.002255074,0.7290484,0.0003119895,0.0003374646,0.0008654125,0.003401258,0.0009197495,0.01419576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004816722,"threshold_uncertainty_score":0.01611352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01398323632986114,"score_gpt":0.2494391847397584,"score_spread":0.2354559484098973,"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."}}