{"id":"W2141425813","doi":"10.1109/hpdc.2005.1520983","title":"DHT overlay schemes for scalable p-range resource discovery","year":2005,"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":"Centre de Santé et de Services Sociaux Cavendish","funders":"","keywords":"Distributed hash table; Computer science; Scalability; Distributed computing; Replication (statistics); Node (physics); Hash function; Tree (set theory); Computer network; Hash table; Overlay network; Grid; Resource (disambiguation); Theoretical computer science; Peer-to-peer; Database; World Wide Web; Mathematics; Computer security; The Internet","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.0002736046,0.0001725998,0.0001890527,0.0001371977,0.000130438,0.0003355983,0.001602459,0.0001023774,0.00001656893],"category_scores_gemma":[0.0001072222,0.0001465266,0.00008782433,0.0005242677,0.00005003118,0.001036639,0.0007229638,0.0001128556,0.0001749769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008017063,"about_ca_system_score_gemma":0.00003543923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001273986,"about_ca_topic_score_gemma":0.00004593164,"domain_scores_codex":[0.9984416,0.00001365748,0.0002052885,0.0005208175,0.0002776499,0.0005410028],"domain_scores_gemma":[0.9986752,0.0001566289,0.00004807076,0.0009834534,0.00005253024,0.00008415892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001507544,0.00007855782,0.0006584749,0.00001333314,0.00002155573,0.000003329272,0.0001087899,0.000615027,0.0008290121,0.1731168,0.5754989,0.2490411],"study_design_scores_gemma":[0.000278843,0.00008145373,0.0003757567,0.00001850618,0.000003622589,0.000005290969,0.00002286316,0.02875002,0.01448009,0.002332298,0.9533909,0.0002603304],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01744765,0.0003548012,0.940161,0.02311292,0.0001564608,0.0003957795,0.0000064501,0.001590646,0.01677426],"genre_scores_gemma":[0.2670097,0.00001187083,0.6878011,0.003952958,0.0002911846,0.0001292571,0.000003356492,0.00002399545,0.04077657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.377892,"threshold_uncertainty_score":0.5975182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01495640329560908,"score_gpt":0.248363607553966,"score_spread":0.2334072042583569,"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."}}