{"id":"W1996563160","doi":"10.1002/jcd.20283","title":"Existential closure of block intersection graphs of infinite designs having infinite block size","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Intersection (aeronautics); Block (permutation group theory); Block size; Discrete mathematics; Closure (psychology); Graph; Computer science","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.001346759,0.0004615403,0.0006160711,0.001050053,0.001148817,0.001504658,0.0009340651,0.000538397,0.001896036],"category_scores_gemma":[0.00572953,0.0006410003,0.0007656814,0.0007953914,0.002640892,0.004099349,0.002066971,0.0009081015,0.0001323937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009471257,"about_ca_system_score_gemma":0.0006070362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001019176,"about_ca_topic_score_gemma":0.0007791994,"domain_scores_codex":[0.9984621,0.0003832222,0.0001167965,0.0004307565,0.0003445231,0.0002626263],"domain_scores_gemma":[0.9933994,0.003617697,0.001399286,0.0005833049,0.0005057349,0.000494582],"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.0007601051,0.0001734986,0.01062945,0.000283022,0.00008529624,0.0009438449,0.002429512,0.03753739,0.02204384,0.8813866,0.0008038354,0.04292373],"study_design_scores_gemma":[0.00009681431,0.0002937079,0.004460767,0.0001091794,0.0001127641,0.001472866,0.001277485,0.1185577,0.02093145,0.8441043,0.008507976,0.00007491962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8318148,0.0002740572,0.160338,0.0001324675,0.00001365856,0.00004958936,0.0002358162,0.000144465,0.006997184],"genre_scores_gemma":[0.9654599,0.0001636413,0.03239588,0.00004835563,0.00001468759,0.00008950818,0.0003474387,0.00005561061,0.001424895],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001896036,"threshold_uncertainty_score":0.007122397,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07509661579310065,"score_gpt":0.2916596910825237,"score_spread":0.2165630752894231,"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."}}