{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128094,0.0001611124,0.0002953006,0.0004121734,0.0005100859,0.0002019572,0.0004709261,0.00009513235,0.00002624545],"category_scores_gemma":[0.0003188073,0.0001429524,0.000103793,0.0006901513,0.000450506,0.002042697,0.00009731769,0.0006255083,0.00002877812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001378694,"about_ca_system_score_gemma":0.000115469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000155061,"about_ca_topic_score_gemma":0.000004432991,"domain_scores_codex":[0.9978495,0.0002734152,0.0005867584,0.0002480881,0.0007669695,0.0002753173],"domain_scores_gemma":[0.997282,0.0007924761,0.0005236088,0.0002681245,0.0008570186,0.0002767802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0004349107,0.0003446587,0.5392583,0.00008893722,0.0005903768,0.00006796562,0.003276047,0.002609238,0.0005502099,0.3575707,0.01124672,0.08396193],"study_design_scores_gemma":[0.0006491966,0.0004488517,0.6083938,0.00003881334,0.00001929964,0.0003222918,0.0000890724,0.03026648,0.0001922102,0.3585325,0.0008920493,0.0001554336],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1176542,0.0001042558,0.8791904,0.001733683,0.0006351074,0.0001072208,0.00001121401,0.0000482251,0.0005156288],"genre_scores_gemma":[0.8855678,0.000009535513,0.113822,0.00005760353,0.0004697936,9.074304e-7,0.000006471652,0.00001146035,0.00005444541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7679135,"threshold_uncertainty_score":0.5829429,"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."}}