{"id":"W1952462664","doi":"10.1007/s12083-015-0380-9","title":"Taking a free ride for routing topology inference in peer-to-peer networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Network topology; Network tomography; Routing (electronic design automation); Routing table; Distributed computing; Topology (electrical circuits); Computer network; Host (biology); Internet topology; Logical topology; The Internet; Peer-to-peer; Synchronization (alternating current); Routing protocol; Static routing; Engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009061599,0.00128948,0.003658949,0.002273777,0.004914781,0.003636091,0.005158008,0.00453195,0.004249029],"category_scores_gemma":[0.05091196,0.001459617,0.001542435,0.001665311,0.0035068,0.01220401,0.00612929,0.004375003,0.0008607608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001559029,"about_ca_system_score_gemma":0.002143264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007801536,"about_ca_topic_score_gemma":0.01132791,"domain_scores_codex":[0.9941458,0.002375034,0.0004430959,0.001127396,0.001570705,0.0003379755],"domain_scores_gemma":[0.9777076,0.01373903,0.001032085,0.004747095,0.001861178,0.0009129602],"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.0009857551,0.0002898885,0.003597436,0.0005690855,0.0005410159,0.0007732295,0.001451544,0.5282292,0.004851638,0.1489939,0.01154994,0.2981675],"study_design_scores_gemma":[0.00004644669,0.0001175851,0.0002051892,0.00003614713,0.0000713267,0.0001496736,0.000155201,0.9043712,0.001691078,0.09064259,0.002462881,0.00005065051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0202553,0.0008511333,0.9736828,0.001336092,0.0002996666,0.0001842038,0.00007104793,0.001398557,0.001921177],"genre_scores_gemma":[0.6012873,0.0006670944,0.3907469,0.0005125394,0.0002944538,0.00024754,0.0002703397,0.0003727505,0.005601068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009061599,"threshold_uncertainty_score":0.04792291,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0513139108326722,"score_gpt":0.3247086812917984,"score_spread":0.2733947704591262,"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."}}