{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794342,0.001200477,0.0008638881,0.002226724,0.001012088,0.0008058528,0.001399776,0.0009982588,0.00393084],"category_scores_gemma":[0.00548098,0.0005167629,0.0008261597,0.003780076,0.001018761,0.003156283,0.002045464,0.0008194033,0.001311225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006759678,"about_ca_system_score_gemma":0.001039563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002614516,"about_ca_topic_score_gemma":0.00386726,"domain_scores_codex":[0.9992422,0.0001933807,0.00005527187,0.0001602152,0.0002434375,0.0001055035],"domain_scores_gemma":[0.9974348,0.00133111,0.0003173749,0.0004119312,0.0003961708,0.0001085996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003407538,0.000484631,0.003149952,0.0009681987,0.0001325202,0.0007061926,0.000688251,0.2382488,0.0248772,0.1002567,0.01860293,0.611544],"study_design_scores_gemma":[0.0001114959,0.0002629009,0.001436323,0.0001098723,0.00009328101,0.00102594,0.0003609406,0.7149581,0.01789894,0.2502383,0.01343394,0.0000698999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.032284,0.0003154356,0.9613422,0.0001953179,0.00003093987,0.0002368816,0.0003391442,0.001285983,0.003970113],"genre_scores_gemma":[0.1218776,0.0004209233,0.8726,0.00014355,0.00005034635,0.0002849745,0.002020814,0.0002152159,0.002386544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00393084,"threshold_uncertainty_score":0.01314998,"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."}}