{"id":"W4247832516","doi":"10.1002/jgt.20271","title":"Maximum acyclic and fragmented sets in regular graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Bounded function; Graph; Upper and lower bounds; Order (exchange); 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008228253,0.0002554306,0.0006437221,0.001925936,0.001116535,0.001649018,0.001259937,0.0008066549,0.0041814],"category_scores_gemma":[0.007337827,0.0006856269,0.0005177132,0.001747012,0.002066618,0.003189296,0.001316106,0.0007973637,0.0002606518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009305434,"about_ca_system_score_gemma":0.0003173157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00140153,"about_ca_topic_score_gemma":0.001994516,"domain_scores_codex":[0.9989441,0.0002306355,0.00006807542,0.0002839887,0.0003347094,0.0001384317],"domain_scores_gemma":[0.9910858,0.005537136,0.001187056,0.001050824,0.0005028873,0.0006363351],"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.001148022,0.000154085,0.01507647,0.000576812,0.0001322683,0.001328663,0.002481695,0.04630172,0.01668841,0.8464091,0.003635142,0.06606768],"study_design_scores_gemma":[0.00008018582,0.00009591167,0.006086708,0.00009015087,0.00008424072,0.0019293,0.0006275083,0.07746723,0.006363064,0.8995748,0.007567004,0.00003385158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8790044,0.0008011271,0.105538,0.0005321979,0.00001839898,0.00004968022,0.0007518726,0.0003055593,0.01299875],"genre_scores_gemma":[0.973417,0.000155238,0.02376453,0.00007514317,0.00002265131,0.00003969457,0.0006604171,0.00003555817,0.001829704],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0041814,"threshold_uncertainty_score":0.0139882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01239526032330909,"score_gpt":0.2878449829069343,"score_spread":0.2754497225836252,"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."}}