{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007471412,0.0007407701,0.001188555,0.0005290285,0.0003494763,0.00006344212,0.001314483,0.0009561656,0.00009525238],"category_scores_gemma":[0.0004879938,0.0007665726,0.0005565153,0.0006627549,0.0007496236,0.0002810893,0.001448352,0.001331706,0.00001192457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001906069,"about_ca_system_score_gemma":0.0002511504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003394451,"about_ca_topic_score_gemma":0.0001260799,"domain_scores_codex":[0.9968986,0.0004501634,0.0005593561,0.001106334,0.0003876425,0.0005979004],"domain_scores_gemma":[0.9949384,0.00136527,0.001018632,0.001455847,0.0009513478,0.0002704989],"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.002491271,0.0009083315,0.03953854,0.001896095,0.003357632,0.0009595146,0.007407779,0.05126039,0.000565398,0.8760531,0.01537455,0.0001873922],"study_design_scores_gemma":[0.001682034,0.0001646733,0.0008199921,0.0006658077,0.0008541073,0.00001512249,0.002788163,0.007318708,0.001152497,0.9829757,0.0003683886,0.00119478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9816279,0.0006463907,0.007476569,0.00003251721,0.0007838741,0.0006117943,0.001433912,0.00018955,0.007197484],"genre_scores_gemma":[0.995713,0.0006019265,0.0005697042,0.0001319828,0.00006952728,0.000002723593,0.0001090619,0.00008206003,0.00271999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1069226,"threshold_uncertainty_score":0.9994785,"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."}}