{"id":"W2953319764","doi":"10.48550/arxiv.1501.02716","title":"Gracefully Degrading Consensus and $k$-Set Agreement in Directed Dynamic Networks","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Adversary; Impossibility; Adversary model; Computer science; Vertex (graph theory); Set (abstract data type); Consensus; Graph; Theoretical computer science; Discrete mathematics; Computer network; Mathematics; Combinatorics; Computer security; Artificial intelligence; Multi-agent system","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.0004889626,0.0003348118,0.0004634548,0.0002372401,0.00009412019,0.0001704334,0.0009653857,0.0002972,0.000003467454],"category_scores_gemma":[0.00003320321,0.0003833585,0.00008628107,0.0006861845,0.0001028465,0.0001441709,0.001260077,0.0005670012,0.00001301791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003740273,"about_ca_system_score_gemma":0.0001649548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005156983,"about_ca_topic_score_gemma":0.0006775462,"domain_scores_codex":[0.9978564,0.000212164,0.0002960608,0.0010906,0.0001000829,0.00044471],"domain_scores_gemma":[0.9983802,0.00008707814,0.0002684458,0.0008612327,0.0001718967,0.0002311868],"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.00008958496,0.0001842994,0.02712111,0.0001995896,0.0001945743,0.002830212,0.0008055859,0.9040992,0.00002008647,0.05656379,0.003432272,0.004459751],"study_design_scores_gemma":[0.0007101087,0.00003035869,0.005207328,0.0002305295,0.00002114949,0.00001489288,0.00008708231,0.9872605,0.000001521034,0.005458878,0.0005561039,0.0004215319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5745684,0.0008561602,0.4213378,0.0001233806,0.0009003155,0.0004750758,0.00005519855,0.0002705157,0.001413164],"genre_scores_gemma":[0.9984167,0.0001578212,0.0006747405,0.00003361407,0.00002647783,0.000001740655,0.00004000564,0.00001207211,0.0006368852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4238482,"threshold_uncertainty_score":0.9998618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05965823511160914,"score_gpt":0.1992313633525006,"score_spread":0.1395731282408914,"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."}}