{"id":"W2059789746","doi":"10.1109/jsyst.2014.2306147","title":"MR-Chord: Improved Chord Lookup Performance in Structured Mobile P2P Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Chord (peer-to-peer); Computer science; Distributed hash table; Pastry; Computer network; Routing table; Routing protocol; Overlay network; Hash table; Distributed computing; Peer-to-peer; Hash function; Routing (electronic design automation); The Internet; Computer security; Operating system","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001581027,0.0003480817,0.0005304562,0.0004594205,0.0002548951,0.00062639,0.002579429,0.0002911057,0.000005088736],"category_scores_gemma":[0.00007132467,0.0002967505,0.000104891,0.000947449,0.00006132691,0.0007202064,0.00028639,0.001122184,0.00004624632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002640653,"about_ca_system_score_gemma":0.00009063334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004880793,"about_ca_topic_score_gemma":0.00006259905,"domain_scores_codex":[0.996922,0.0002153825,0.0008229578,0.0005404103,0.000537458,0.0009618401],"domain_scores_gemma":[0.9979873,0.00009802428,0.000401496,0.001042316,0.0001992391,0.0002716504],"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.00003600518,0.0000517672,0.009512786,0.00005906376,0.00005720081,0.00006194894,0.0005447814,0.8204959,0.003254675,0.0007093748,0.008940718,0.1562757],"study_design_scores_gemma":[0.0008960651,0.0005040179,0.006532301,0.0002591917,0.000007684673,0.0008856214,0.00005510336,0.9615876,0.000689163,0.0003853279,0.02764049,0.000557426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4706253,0.0008371866,0.5186959,0.0002452997,0.008041853,0.0005814292,0.000001327181,0.0004125805,0.0005591663],"genre_scores_gemma":[0.992342,0.00007730351,0.005773904,0.0001338268,0.001251674,0.00007794182,6.615958e-7,0.00003038623,0.0003122858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5217168,"threshold_uncertainty_score":0.9999484,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007115304200972269,"score_gpt":0.2178801148117693,"score_spread":0.210764810610797,"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."}}