{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001497027,0.0001315614,0.0002102367,0.0001391656,0.0001151567,0.0001548235,0.000108587,0.00005737435,0.00002661591],"category_scores_gemma":[0.00002535888,0.0001046856,0.00003725708,0.0001458161,0.00006816487,0.0003437616,0.00005824459,0.0001051304,9.321845e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001041604,"about_ca_system_score_gemma":0.00001926506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004060765,"about_ca_topic_score_gemma":0.000107544,"domain_scores_codex":[0.9991882,0.00004054911,0.0002018286,0.0002650274,0.0001265595,0.0001778016],"domain_scores_gemma":[0.9996022,0.0001046425,0.00005116937,0.0001342385,0.00002236842,0.0000853724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001145,0.000009977838,0.002953678,0.00001040011,0.00001590482,0.000006974883,0.0006842443,0.001211436,0.0001366391,0.01764753,0.0001057423,0.977103],"study_design_scores_gemma":[0.04240464,0.0001086043,0.1171874,0.00004546648,0.00002324391,0.0003195844,0.0001556412,0.8058005,0.0009096539,0.02196975,0.01042675,0.0006487581],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.314379,0.002912445,0.6772009,0.002473271,0.0004632635,0.0006627478,0.00001173586,0.0001931334,0.001703487],"genre_scores_gemma":[0.9569929,0.0006382672,0.04193955,0.000279917,0.00007761501,0.000006756823,0.00000311672,0.000005856532,0.00005597995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9764542,"threshold_uncertainty_score":0.4268954,"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."}}