{"id":"W2784087054","doi":"10.1002/rsa.20841","title":"Enumeration and randomized constructions of hypertrees","year":2019,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"H2020 European Research Council; Azrieli Foundation","keywords":"Enumeration; Vertex (graph theory); Homology (biology); Combinatorics; Mathematics; Face (sociological concept); Upper and lower bounds; Discrete mathematics; Physics; Biology; Genetics; Graph; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004224021,0.000249976,0.001202997,0.0002865377,0.0001052108,0.0002169439,0.0003598385,0.0002142357,0.00003628371],"category_scores_gemma":[0.0002340759,0.0001630661,0.0002192206,0.0002465552,0.0003548435,0.0001416009,0.0007857058,0.0002700856,8.846956e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006651147,"about_ca_system_score_gemma":0.00004035673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002823878,"about_ca_topic_score_gemma":0.000004674301,"domain_scores_codex":[0.9983486,0.0002064735,0.0004688297,0.0005626684,0.0002475068,0.000165914],"domain_scores_gemma":[0.9983765,0.0006604092,0.0003277688,0.0004515172,0.00009860189,0.00008517051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004081187,0.00007442915,0.0009900447,0.0004774519,0.001784527,0.000016246,0.001082565,0.003069462,0.0002287217,0.2382367,0.0004613549,0.7494974],"study_design_scores_gemma":[0.1696413,0.0001361324,0.004146577,0.0001203776,0.0008592774,0.000174428,0.0001336204,0.3518052,0.0007606013,0.4693632,0.0018128,0.001046413],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08485287,0.01224451,0.8989162,0.0009314282,0.00124677,0.0009423403,0.0002602333,0.00009036823,0.0005152255],"genre_scores_gemma":[0.9319847,0.003747601,0.06381528,0.00007897737,0.0001317671,0.00002496222,0.00007529996,0.00000707463,0.0001343681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8471318,"threshold_uncertainty_score":0.6649643,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01057180760273754,"score_gpt":0.2395823954359309,"score_spread":0.2290105878331933,"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."}}