{"id":"W2950451213","doi":"10.48550/arxiv.1505.08044","title":"Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hypergraph; Countable set; Independence (probability theory); Mathematics; Independence number; Bounded function; Combinatorics; Rank (graph theory); Discrete mathematics; Set (abstract data type); Finite set; Independent set; Statistics; Graph; Computer science; Mathematical analysis","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.00271213,0.0006030098,0.001175995,0.002604309,0.001979166,0.004152535,0.001723746,0.001003469,0.003878542],"category_scores_gemma":[0.02351767,0.001218911,0.0013572,0.001646437,0.006589968,0.008006947,0.002794578,0.00348195,0.0004654508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00213802,"about_ca_system_score_gemma":0.0008271435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002248181,"about_ca_topic_score_gemma":0.001464239,"domain_scores_codex":[0.9961227,0.001210624,0.0001890517,0.0008828342,0.001146479,0.0004483194],"domain_scores_gemma":[0.9582676,0.0311202,0.003072985,0.00305526,0.002403062,0.002080849],"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.00008261589,0.00004555422,0.001937261,0.00008235779,0.00003889338,0.0001464242,0.0005393255,0.005167624,0.001761123,0.9835914,0.0009030263,0.005704246],"study_design_scores_gemma":[0.00001824951,0.00001536121,0.001150065,0.00002417866,0.00001824572,0.0002494644,0.000117464,0.02589521,0.001096649,0.9702459,0.001142722,0.00002643327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5387073,0.001041218,0.4170837,0.001831326,0.0000537896,0.00007028921,0.0009552,0.0007561801,0.03950104],"genre_scores_gemma":[0.9753004,0.0004917707,0.01946406,0.0002476838,0.0001461379,0.0001545486,0.0004125831,0.0001299225,0.003652768],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004152535,"threshold_uncertainty_score":0.01551247,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06729027525054163,"score_gpt":0.2113944391232576,"score_spread":0.144104163872716,"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."}}