{"id":"W2953256091","doi":"10.48550/arxiv.1204.6093","title":"Linear Consensus Algorithms Based on Balanced Asymmetric Chains","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Consensus algorithm; Set (abstract data type); Chain (unit); Property (philosophy); Algorithm; Computer science; Finite set; Mathematics; Discrete mathematics; Mathematical optimization","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.001204274,0.0005168846,0.0005282769,0.0007286106,0.0005869077,0.001291973,0.0009720478,0.0007199778,0.00278438],"category_scores_gemma":[0.007042639,0.0003223206,0.0002827626,0.0007738863,0.0009717557,0.002342477,0.001639499,0.001005167,0.0005200385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007867691,"about_ca_system_score_gemma":0.0006063949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009782251,"about_ca_topic_score_gemma":0.0008850916,"domain_scores_codex":[0.999079,0.0003063914,0.0000608343,0.0001485129,0.0002993259,0.0001058856],"domain_scores_gemma":[0.9972966,0.001284166,0.0004590649,0.000287107,0.0005218055,0.0001513098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000298118,0.0000678065,0.0008176261,0.0001013197,0.0000428997,0.0001199573,0.0002052335,0.5339327,0.009174623,0.4015304,0.001026378,0.05268296],"study_design_scores_gemma":[0.0000219842,0.00003287185,0.00006186037,0.000007019408,0.000005663105,0.00001664641,0.00001550084,0.9093676,0.0009836457,0.08892437,0.0005568402,0.000005974955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05789311,0.0001681887,0.9367909,0.0001684857,0.00003152866,0.00006033937,0.00006477546,0.0001836719,0.004638972],"genre_scores_gemma":[0.9148317,0.0003241131,0.07947305,0.00007746738,0.00005870716,0.0001953043,0.0001876944,0.00005693828,0.004795064],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00278438,"threshold_uncertainty_score":0.009314656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07515525536335256,"score_gpt":0.201810817711824,"score_spread":0.1266555623484714,"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."}}