{"id":"W4285200479","doi":"10.1109/access.2022.3175425","title":"A Computationally Efficient Connectivity Index for Weighted Directed Graphs With Application to Underwater Sensor Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Defence Research and Development Canada; Polytechnique Montréal; Concordia University","funders":"Polytechnique Montréal; Concordia University; Natural Sciences and Engineering Research Council of Canada; Amirkabir University of Technology; Iran University of Science and Technology; Defence Research and Development Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; McGill University","keywords":"Measure (data warehouse); Computer science; Vertex (graph theory); Generalization; Polynomial; Graph; Mathematics; Algorithm; Theoretical computer science; Data mining","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0001558108,0.0001310168,0.0001573274,0.0001203312,0.0002634581,0.0001027743,0.000369725,0.00003278061,0.00001198909],"category_scores_gemma":[5.487043e-7,0.0001209498,0.00003892255,0.0004928666,0.00001454617,0.00006910544,0.00007430134,0.0001243563,0.000003590821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001117072,"about_ca_system_score_gemma":0.00001490011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007234031,"about_ca_topic_score_gemma":0.00008185239,"domain_scores_codex":[0.9991185,0.00006483771,0.0002013705,0.0002132026,0.0001989554,0.0002031487],"domain_scores_gemma":[0.9993702,0.0001230871,0.00005147971,0.0002786434,0.0001095353,0.00006703998],"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.00006369303,0.00005149263,0.001434834,0.00002027764,0.00005622252,4.904194e-7,0.0002203666,0.9941081,0.0017748,0.00009417409,0.0002714912,0.001904002],"study_design_scores_gemma":[0.0005746374,0.00004803081,0.005599379,0.000008676393,0.00001258409,0.000005337066,0.00007257971,0.986299,0.001943185,0.0003480428,0.004874622,0.0002138703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3739559,0.00001825041,0.6248018,0.000131318,0.0000622621,0.0006355479,0.00001845491,0.0002935818,0.00008292773],"genre_scores_gemma":[0.9968147,0.000001243852,0.001499079,0.000224538,0.0000428499,0.001282313,0.00006942487,0.00003953946,0.00002636225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6233027,"threshold_uncertainty_score":0.493219,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01376123056628816,"score_gpt":0.2435603993777627,"score_spread":0.2297991688114746,"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."}}