{"id":"W2952323553","doi":"10.48550/arxiv.1204.0304","title":"Distributed continuous-time convex optimization on weight-balanced digraphs","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Lipschitz continuity; Directed graph; Mathematics; Differentiable function; Regular polygon; Convex function; Convex optimization; Strongly connected component; Mathematical optimization; Combinatorics; Computer science; Discrete mathematics; Pure mathematics","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.001006146,0.0008762794,0.0007783303,0.0004506662,0.0002911293,0.001149186,0.0007975723,0.0006897506,0.001150945],"category_scores_gemma":[0.003634282,0.0003575694,0.0004078782,0.0006053332,0.001149585,0.00137091,0.001134358,0.0007971826,0.0002087049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001206473,"about_ca_system_score_gemma":0.00075556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004531896,"about_ca_topic_score_gemma":0.00266059,"domain_scores_codex":[0.9994777,0.0001808217,0.00002264035,0.0001415654,0.00009837277,0.00007890368],"domain_scores_gemma":[0.998907,0.0006516122,0.000147157,0.00007321161,0.0001328089,0.00008824927],"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.00006230474,0.00002468569,0.0003368169,0.00003819091,0.00002785925,0.00007623994,0.00004212767,0.9391216,0.002047817,0.04981604,0.000310056,0.008096289],"study_design_scores_gemma":[0.000006891891,0.00001625726,0.00005595845,0.000002379029,0.000003264126,0.000005340863,0.000009966861,0.9855844,0.0002120669,0.0138867,0.0002139668,0.000002721433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05246854,0.0001363555,0.9443378,0.0002263873,0.00002914267,0.00002767618,0.00005189186,0.00007979834,0.002642314],"genre_scores_gemma":[0.9508021,0.0002633021,0.0438469,0.00007848236,0.00002468182,0.000097119,0.0000993424,0.00004170887,0.004746249],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004531896,"threshold_uncertainty_score":0.00901103,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03149780213602189,"score_gpt":0.170409575794008,"score_spread":0.1389117736579861,"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."}}