{"id":"W3092789209","doi":"10.1017/9781108649094.004","title":"Topological connectedness and independent sets in graphs","year":2019,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Social connectedness; Hypergraph; Combinatorics; Mathematics; Line graph; Simplicial complex; Graph; Topology (electrical circuits); Discrete mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000158304,0.0003118638,0.00054012,0.000596554,0.00009061347,0.00009220609,0.001217008,0.0004633814,0.00001092227],"category_scores_gemma":[0.00002290086,0.0002923599,0.0001510974,0.00006322915,0.0002388532,0.0001728572,0.001659867,0.0005246213,0.00002041229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008577515,"about_ca_system_score_gemma":0.00006162465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000279282,"about_ca_topic_score_gemma":0.00001358212,"domain_scores_codex":[0.9982642,0.00006454406,0.0002064479,0.0008552278,0.0002977095,0.0003118913],"domain_scores_gemma":[0.9987285,0.0001793655,0.0001600622,0.00068237,0.00007651025,0.0001731546],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001639187,0.00001409088,0.00008402509,0.00001895881,0.00005697219,0.0005745317,0.00001870254,0.000002236233,0.00000275109,0.9945348,0.001216551,0.003460022],"study_design_scores_gemma":[0.001871273,0.0003054551,0.004594583,0.0001323735,0.0001978118,0.00009813966,0.00006665553,0.001191481,0.00004814908,0.002415407,0.9876267,0.001451994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003190983,0.0002790091,0.00333182,0.00007543304,0.0002124192,0.0002781879,0.0001478448,0.000120541,0.9923638],"genre_scores_gemma":[0.04211112,0.0002430717,0.0003082995,0.0001494236,0.00001627154,4.608459e-7,0.00003742204,0.000009855726,0.9571241],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9921194,"threshold_uncertainty_score":0.9999529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02314092427799761,"score_gpt":0.205071903698396,"score_spread":0.1819309794203984,"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."}}