{"id":"W1983758508","doi":"10.1142/s012905411450018x","title":"ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Adjacency list; Combinatorics; Graph factorization; Computer science; Subgraph isomorphism problem; Vertex (graph theory); Mathematics; Adjacency matrix; Degeneracy (biology); Algorithm; Graph; Discrete mathematics; Line graph; Voltage graph","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.00168339,0.0001758277,0.000297837,0.001135369,0.0002868967,0.0007018773,0.002235435,0.00005426259,0.0000190813],"category_scores_gemma":[0.0004228954,0.0001529592,0.0001329493,0.0008539844,0.0003152062,0.001678288,0.0003207488,0.0002410259,0.000009835271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001016949,"about_ca_system_score_gemma":0.0002004958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003684103,"about_ca_topic_score_gemma":0.00005472729,"domain_scores_codex":[0.9974271,0.00008270416,0.0007891811,0.000370429,0.001067886,0.0002627019],"domain_scores_gemma":[0.9960333,0.000704636,0.0008283022,0.0003797569,0.00190172,0.0001522801],"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.00005833291,0.0001857926,0.009511861,0.00001150877,0.0001600943,0.00002190317,0.0009378355,0.0162222,0.00208946,0.8320943,0.0005774868,0.1381293],"study_design_scores_gemma":[0.00093336,0.0005444521,0.04726497,0.0003929959,0.00001094896,0.0004285709,0.00001526201,0.9041505,0.0009341277,0.04447341,0.0006191938,0.000232234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3348337,0.00002164856,0.6596841,0.0006607446,0.004302204,0.00006562462,9.84385e-7,0.00002580016,0.0004051465],"genre_scores_gemma":[0.9603277,0.000005919231,0.03907155,0.0002289992,0.0003448478,0.000001895156,0.000001068494,0.000007222156,0.00001074992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8879283,"threshold_uncertainty_score":0.6768219,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02168548651430138,"score_gpt":0.2739457961700607,"score_spread":0.2522603096557593,"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."}}