{"id":"W2011182146","doi":"10.1145/509907.509911","title":"Dynamic subgraph connectivity with geometric applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.00009101881,0.00009624575,0.0000998288,0.0003203352,0.000187337,0.0001046597,0.0006210346,0.0000269825,0.0001545856],"category_scores_gemma":[0.00000684416,0.00007706112,0.00004509177,0.002786779,0.00007394797,0.000285417,0.0001077817,0.0001011479,0.0001316108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001831827,"about_ca_system_score_gemma":0.000007218046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002740947,"about_ca_topic_score_gemma":0.00004532915,"domain_scores_codex":[0.9991643,0.00001976942,0.00009407246,0.0003227398,0.0001918021,0.0002072633],"domain_scores_gemma":[0.9991251,0.0001260576,0.00003611474,0.0005813679,0.0000552832,0.0000761135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001325206,0.0003773787,0.002084838,0.0000115391,0.0000332433,0.000008175427,0.0001072379,0.00008755413,0.00003738952,0.5057516,0.0006889232,0.4908108],"study_design_scores_gemma":[0.0007208434,0.0002731761,0.02346552,0.000009572376,0.0000127612,0.0001301414,0.00003781668,0.9047403,0.0003426385,0.04766967,0.02196103,0.0006364994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003726439,0.0001701423,0.9781795,0.0006228972,0.00004328321,0.0001768562,0.000001900533,0.0003301337,0.01674885],"genre_scores_gemma":[0.8797474,0.00002890195,0.1193507,0.00017819,0.00000863005,0.00005722963,8.641128e-7,0.000004509536,0.0006236167],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9046528,"threshold_uncertainty_score":0.3142461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01772045978582197,"score_gpt":0.2233848102164054,"score_spread":0.2056643504305834,"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."}}