{"id":"W2900649734","doi":"10.1016/j.jda.2018.11.013","title":"Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction","year":2018,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compaction; Vertex (graph theory); Mathematical proof; Bipartite graph; Vertex cover; Mathematics; Computational complexity theory; Combinatorics; Computer science; Time complexity; Discrete mathematics; Graph; Algorithm; Geometry; Geology","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high","status":"direct model label, unvalidated"}],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006607648,0.001344859,0.002681248,0.002573043,0.00224028,0.007570059,0.005791644,0.003422309,0.01059906],"category_scores_gemma":[0.07790814,0.001057121,0.002658919,0.005370851,0.00489488,0.02027165,0.004445279,0.005555752,0.001215651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003975282,"about_ca_system_score_gemma":0.005420459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002464207,"about_ca_topic_score_gemma":0.003861505,"domain_scores_codex":[0.9901828,0.003233784,0.0007403014,0.00181123,0.002664039,0.001367861],"domain_scores_gemma":[0.8511694,0.117312,0.006351527,0.01783653,0.004900956,0.002429569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002683729,0.0007156366,0.01231214,0.0009562755,0.0002754381,0.0004884722,0.001038973,0.1962986,0.009127177,0.5814951,0.02030985,0.1742987],"study_design_scores_gemma":[0.0001736839,0.0002531599,0.002079532,0.00006365182,0.0002373977,0.0005015306,0.0002821427,0.4703408,0.005049089,0.517779,0.00316345,0.00007665759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3496145,0.002847883,0.5980974,0.01383027,0.0006129155,0.0005167553,0.002449436,0.002048471,0.02998233],"genre_scores_gemma":[0.8213742,0.001125603,0.1632804,0.00118273,0.0008852493,0.0004793727,0.001998607,0.0006578777,0.00901596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01059906,"threshold_uncertainty_score":0.03545737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07855679433831916,"score_gpt":0.3648430283686503,"score_spread":0.2862862340303312,"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."}}