{"id":"W2047467760","doi":"10.1002/rsa.20061","title":"Cores in random hypergraphs and Boolean formulas","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; struct; Mathematics; Literal (mathematical logic); Combinatorics; Core (optical fiber); Discrete mathematics; Random graph; Algorithm; Computer science; Graph","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.002088483,0.0002569925,0.0007632308,0.001916868,0.0006717927,0.001751872,0.0009422066,0.0007770194,0.002574091],"category_scores_gemma":[0.01851732,0.0007758695,0.0006001721,0.001082524,0.001723929,0.002582578,0.001369613,0.001213612,0.0001958963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001498878,"about_ca_system_score_gemma":0.0005502173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001083081,"about_ca_topic_score_gemma":0.001638112,"domain_scores_codex":[0.9980454,0.0007519203,0.0001185873,0.0003148062,0.0005162557,0.0002529382],"domain_scores_gemma":[0.9850501,0.009843964,0.001750389,0.001370214,0.00125005,0.0007353326],"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.0006963592,0.000177681,0.01078421,0.0001838787,0.0001060362,0.0007306114,0.0006062512,0.1320066,0.01174524,0.7918308,0.003800042,0.04733245],"study_design_scores_gemma":[0.00009227467,0.00008045331,0.002426132,0.00003208111,0.00003209549,0.0003735514,0.0001224184,0.4783832,0.005885577,0.5108154,0.001730937,0.00002590985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6949804,0.0004277419,0.2947053,0.0005842866,0.00003447134,0.0001167452,0.000265007,0.0008358909,0.008050154],"genre_scores_gemma":[0.9524162,0.00009226433,0.04525099,0.0001773082,0.00002623749,0.0001249191,0.0002537839,0.00009741756,0.001560774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002574091,"threshold_uncertainty_score":0.0110451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005996719707171033,"score_gpt":0.2216096229441444,"score_spread":0.2156129032369733,"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."}}