{"id":"W48467249","doi":"10.1007/978-3-642-41527-2_14","title":"Gossip Protocols for Renaming and Sorting","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Gossip; Computer science; Sorting; Node (physics); Protocol (science); Computer network; Theoretical computer science; Binary logarithm; Sorting network; Logarithm; Communication complexity; Combinatorics; Discrete mathematics; Sorting algorithm; Mathematics; Algorithm","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.001311081,0.001125016,0.00121676,0.001033802,0.001697671,0.002646493,0.00203634,0.001244287,0.008150568],"category_scores_gemma":[0.003203066,0.0006984923,0.0006488034,0.00218746,0.001521521,0.004522943,0.002135084,0.002676634,0.002294189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344107,"about_ca_system_score_gemma":0.00101742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009832826,"about_ca_topic_score_gemma":0.00144807,"domain_scores_codex":[0.9989485,0.0002113993,0.00009515483,0.0001409303,0.0004681916,0.0001357715],"domain_scores_gemma":[0.998634,0.0006217241,0.00006802003,0.0004246534,0.0001887752,0.00006276515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002291406,0.00008107659,0.0001051779,0.0004197997,0.0000518183,0.0001125489,0.0003949715,0.01834935,0.006043986,0.7931956,0.02245264,0.158564],"study_design_scores_gemma":[0.0001265796,0.0001033244,0.0001425875,0.000118834,0.00006592987,0.0002696618,0.0001669978,0.1019809,0.01265666,0.7690803,0.1152213,0.00006702038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0150237,0.009237364,0.9032697,0.001077477,0.001146456,0.0003261913,0.0004457046,0.003077301,0.06639613],"genre_scores_gemma":[0.3185449,0.01332397,0.55122,0.0006137181,0.0009599379,0.001166186,0.001839422,0.001381539,0.1109503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008150568,"threshold_uncertainty_score":0.02726638,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0277208962274286,"score_gpt":0.2802431267251532,"score_spread":0.2525222304977245,"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."}}