{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002390631,0.0009277933,0.001424463,0.003205899,0.003684242,0.006686958,0.002229314,0.00164604,0.00842955],"category_scores_gemma":[0.01049502,0.001961216,0.002099404,0.00242848,0.006018023,0.01103297,0.004916299,0.005071967,0.001038937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001981118,"about_ca_system_score_gemma":0.001114417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001803027,"about_ca_topic_score_gemma":0.002115611,"domain_scores_codex":[0.9970368,0.0009062798,0.0001587593,0.0005353388,0.0008143457,0.0005484287],"domain_scores_gemma":[0.9818457,0.01138811,0.001693013,0.00161617,0.001319399,0.002137466],"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.00004948558,0.00003327429,0.0003268725,0.00003842967,0.00001682527,0.0001016592,0.0003800183,0.0009219736,0.0007925524,0.9946525,0.0005363547,0.00214995],"study_design_scores_gemma":[0.00001660052,0.00001142081,0.0002710925,0.00001176996,0.00001762219,0.000160985,0.0001063553,0.005163488,0.0006919494,0.992703,0.000827656,0.00001806771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5270692,0.0007185931,0.3668483,0.001820327,0.0001544607,0.00009632464,0.0007768659,0.00112504,0.1013909],"genre_scores_gemma":[0.9631987,0.0003741061,0.02014702,0.0003242491,0.000190045,0.0001360988,0.0004144184,0.0002572182,0.0149581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00842955,"threshold_uncertainty_score":0.02819967,"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."}}