{"id":"W2207885168","doi":"10.23638/dmtcs-19-1-20","title":"Equivalence of the filament and overlap graphs of subtrees of limited trees","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equivalence (formal languages); Combinatorics; Mathematics; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001848413,0.0002002331,0.0004376351,0.000187546,0.0004337162,0.0001806872,0.005939024,0.00004876862,0.00000953899],"category_scores_gemma":[0.0006735106,0.0001260622,0.0001572042,0.0006214568,0.01165291,0.000586196,0.003920557,0.0001649568,8.878874e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001270212,"about_ca_system_score_gemma":0.00008804992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000045467,"about_ca_topic_score_gemma":0.000001517373,"domain_scores_codex":[0.9971556,0.0001144524,0.000570688,0.0004874624,0.001248709,0.0004230668],"domain_scores_gemma":[0.9955257,0.0007034312,0.000632908,0.002634347,0.0003575233,0.0001461214],"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.000009348359,0.000087219,0.001555752,0.0001198987,0.00001211782,0.00000113395,0.00110619,0.0000330116,0.01257926,0.9816831,0.000002207121,0.002810796],"study_design_scores_gemma":[0.0002027774,0.000217805,0.009120409,0.0003051189,0.00001128848,0.000008576102,0.00006253085,0.172002,0.06384317,0.7540926,0.000001502989,0.0001322702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4632871,0.00005958208,0.5345458,0.000358653,0.0001351931,0.000297069,0.00001435694,0.00002058462,0.001281683],"genre_scores_gemma":[0.8688897,0.00002156963,0.1310474,0.00001614612,0.000007177492,0.000004476055,1.510309e-7,0.000007256527,0.000006133479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4056026,"threshold_uncertainty_score":0.9994393,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02486302712505086,"score_gpt":0.3021602226932132,"score_spread":0.2772971955681623,"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."}}