{"id":"W4380876964","doi":"10.5817/cz.muni.eurocomb23-058","title":"Cop number of random k-uniform hypergraphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Hypergraph; Combinatorics; Conjecture; Random graph; Mathematics; Social connectedness; Zigzag; Upper and lower bounds; Graph; Discrete mathematics; Binomial (polynomial); Vertex (graph theory); Binary logarithm; Geometry; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.002433083,0.001001909,0.001574627,0.002160701,0.001517501,0.002756448,0.002542412,0.002008171,0.007730514],"category_scores_gemma":[0.02490983,0.0009563572,0.0008890337,0.001091653,0.004669717,0.004490315,0.002381402,0.002450826,0.0009953395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002701596,"about_ca_system_score_gemma":0.0009177348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002479418,"about_ca_topic_score_gemma":0.002153698,"domain_scores_codex":[0.9977822,0.0009518727,0.0000741862,0.0004684991,0.0003352591,0.0003878954],"domain_scores_gemma":[0.9829959,0.01014256,0.002322047,0.001653591,0.000770819,0.002115018],"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.0007440828,0.0001526947,0.007581058,0.0003487373,0.0001437318,0.0008054374,0.0006894724,0.1134774,0.005585288,0.849419,0.01216513,0.008887955],"study_design_scores_gemma":[0.0001352715,0.00009181849,0.002962749,0.0001070701,0.00005443802,0.000466343,0.0002440528,0.600879,0.00270936,0.3897817,0.002491603,0.00007661428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8023652,0.001051205,0.1608683,0.003097207,0.000119005,0.0002966484,0.00119665,0.0006708901,0.03033499],"genre_scores_gemma":[0.9855878,0.0003749514,0.007412542,0.0003650756,0.00006807605,0.00023534,0.0005065376,0.0002009813,0.005248813],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007730514,"threshold_uncertainty_score":0.02586114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02261116946693172,"score_gpt":0.3191085700868565,"score_spread":0.2964974006199248,"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."}}