{"id":"W1897016437","doi":"10.1016/j.ejc.2016.04.005","title":"Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Mathematics; Countable set; Combinatorics; Rank (graph theory); Independence (probability theory); Discrete mathematics; Independence number; Graph; Statistics","routes":{"ca_aff":true,"ca_fund":false,"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.001938974,0.0003241535,0.000673322,0.0003124379,0.0002324321,0.0000432302,0.0007590008,0.00009281265,0.00005155573],"category_scores_gemma":[0.001319412,0.0002137249,0.0003399366,0.0003913397,0.0003254852,0.0003421123,0.0001792623,0.0004846617,0.000006857731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005764192,"about_ca_system_score_gemma":0.00006350646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001822365,"about_ca_topic_score_gemma":6.877396e-7,"domain_scores_codex":[0.9966879,0.0008687577,0.001014326,0.000215128,0.0008539162,0.0003599938],"domain_scores_gemma":[0.9947937,0.002085724,0.001485992,0.0004523659,0.0009962305,0.0001860111],"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.001865736,0.00123233,0.03916423,0.0004098679,0.001656237,0.001395458,0.006394539,0.00004988567,0.01902584,0.8898799,0.03384755,0.00507843],"study_design_scores_gemma":[0.007915202,0.002031734,0.01325247,0.001891784,0.0004976119,0.0004811167,0.001572857,0.0000240232,0.02056673,0.9423564,0.008364843,0.001045208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.980358,0.001549402,0.008166096,0.0002563488,0.001434315,0.0001534729,0.0001269292,0.00004006344,0.007915349],"genre_scores_gemma":[0.9975582,0.0007003673,0.0006660743,0.0001498944,0.0000856868,6.368639e-7,0.000001336281,0.00007166395,0.000766142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05247653,"threshold_uncertainty_score":0.871545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01560923728923203,"score_gpt":0.2332751405937926,"score_spread":0.2176659033045606,"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."}}