{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001019385,0.0005377258,0.0005780472,0.0008044617,0.0003538042,0.001142918,0.003981529,0.0003865949,0.000003382736],"category_scores_gemma":[0.0003879071,0.0004819794,0.00008820854,0.0005843536,0.0005617619,0.0006592826,0.002956169,0.0006381355,0.00002518427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002143563,"about_ca_system_score_gemma":0.0002756631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001151242,"about_ca_topic_score_gemma":0.00003420349,"domain_scores_codex":[0.9959782,0.00001562947,0.0005746571,0.00182396,0.0006769751,0.0009305427],"domain_scores_gemma":[0.9970615,0.0006146716,0.0003407973,0.001515072,0.0002832393,0.0001847193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002614741,0.000007515091,0.00003279025,0.00005897826,0.000005633206,0.00001316061,0.0003038396,0.003194913,0.0002382426,0.02322057,0.0001487337,0.972773],"study_design_scores_gemma":[0.000310095,0.000403389,0.0001222713,0.0011607,0.0000054116,0.00006430048,2.615522e-7,0.5318111,0.002759385,0.4521503,0.0102226,0.0009901198],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008335716,0.0001417025,0.9863961,0.002029477,0.0004989618,0.009084277,0.000002801171,0.000515972,0.001247306],"genre_scores_gemma":[0.01175802,0.000005137756,0.9839472,0.001174514,0.0003466868,0.002154683,0.000001475455,0.00004102326,0.0005713181],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9717829,"threshold_uncertainty_score":0.999894,"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."}}