{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006648039,0.0001664394,0.0003008592,0.001554455,0.000099566,0.00006743833,0.000965999,0.00008933103,0.00001207791],"category_scores_gemma":[0.0001968474,0.0001381831,0.000152195,0.001348635,0.0002795181,0.0007757584,0.0002039752,0.0005718937,0.000003280509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004022607,"about_ca_system_score_gemma":0.00004236438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001673992,"about_ca_topic_score_gemma":0.000006552264,"domain_scores_codex":[0.9977696,0.0003724703,0.000589127,0.0002448734,0.0005395377,0.0004844218],"domain_scores_gemma":[0.9982451,0.0006081125,0.0003101529,0.000431914,0.0001599611,0.0002447569],"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.0005224216,0.000194176,0.01073092,0.00002575579,0.00008457512,0.000913966,0.001079189,0.00003471071,0.01100748,0.8599649,0.000116801,0.1153251],"study_design_scores_gemma":[0.0009648487,0.0002290527,0.02273968,0.00007670379,0.000005964484,0.0003635856,0.0002667476,0.00005227872,0.003488147,0.9712794,0.0003888205,0.0001447867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7543759,0.002317162,0.2418118,0.0003202486,0.0002573333,0.0001261209,8.039157e-7,0.0000262103,0.0007644725],"genre_scores_gemma":[0.9830793,0.0003279112,0.01626185,0.0002342623,0.00002875654,0.000001360342,2.326327e-7,0.00001531731,0.00005097249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2287034,"threshold_uncertainty_score":0.5634944,"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."}}