{"id":"W2107442425","doi":"10.1109/lcn.2007.65","title":"Search Algorithms for Unstructured Peer-to-Peer Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Network topology; Flooding (psychology); Computer science; Algorithm; Random graph; Random walk; Theoretical computer science; Mathematics; Graph; Computer network","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00229047,0.0003267726,0.0003322341,0.0004704036,0.0002407061,0.0003518646,0.003114773,0.0002972005,0.00002384087],"category_scores_gemma":[0.0003597096,0.0002875355,0.0001287401,0.001973183,0.00007661158,0.0002998319,0.001217873,0.0003790314,0.0001212045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001532864,"about_ca_system_score_gemma":0.0000708839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005602102,"about_ca_topic_score_gemma":0.000107415,"domain_scores_codex":[0.9960067,0.00002657013,0.0004242287,0.0009365208,0.001143614,0.001462322],"domain_scores_gemma":[0.9968409,0.0003534,0.00005255099,0.001386524,0.0009375847,0.0004290684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003294582,0.00003641553,0.0004356477,0.000006934068,0.00003820624,0.00003118836,0.0003891322,0.01343123,0.0003266786,0.04973776,0.206508,0.7290259],"study_design_scores_gemma":[0.001122027,0.0007513726,0.007837432,0.00003418286,0.0000152618,0.00008271891,0.0002791,0.4604203,0.02416757,0.01209862,0.4918557,0.001335656],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004873473,0.00004580096,0.9637181,0.02406325,0.001333125,0.0009018446,0.000006640816,0.001717646,0.003340123],"genre_scores_gemma":[0.2248962,0.000001789916,0.7613407,0.00269267,0.0004327541,0.00005357697,0.00001023594,0.00003293421,0.01053911],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7276903,"threshold_uncertainty_score":0.9999577,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03029203818645832,"score_gpt":0.3103137241820121,"score_spread":0.2800216859955538,"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."}}