{"id":"W2957704882","doi":"10.1007/978-3-030-25005-8_21","title":"A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modular design; Scheme (mathematics); Computer science; Theoretical computer science; Parallel computing; Hypergraph; Programming language; Mathematics; Discrete mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000536181,0.000323555,0.0004414445,0.0009473203,0.0002252847,0.0001498746,0.002149182,0.0001900413,0.000003283707],"category_scores_gemma":[0.00002831283,0.0003145518,0.0001357585,0.0006083751,0.0008799929,0.0003921748,0.0009024175,0.000387756,0.000005997923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008728703,"about_ca_system_score_gemma":0.0003639839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004528216,"about_ca_topic_score_gemma":0.000007580041,"domain_scores_codex":[0.9973846,0.00002261327,0.0003849428,0.001185862,0.000538848,0.0004831355],"domain_scores_gemma":[0.9974943,0.0005295255,0.0001965283,0.001273854,0.0003688348,0.0001369174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007739016,0.00003738877,0.00003979027,0.0001026213,0.00002251482,0.000003852545,0.0001233058,0.01873201,0.006587225,0.6221622,0.000003939148,0.3521774],"study_design_scores_gemma":[0.0002376256,0.0001292506,0.00003601514,0.0000834597,0.000004832963,0.00002852099,7.58524e-8,0.5154938,0.001938855,0.4808867,0.0008878765,0.000273001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002047054,0.0007711877,0.9968193,0.0002217003,0.0002241721,0.001237651,0.00003402328,0.00006016774,0.0004270987],"genre_scores_gemma":[0.01455552,0.0000700602,0.9846255,0.0002182031,0.0001679668,0.00009261775,0.00001036037,0.00002906268,0.0002306724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4967618,"threshold_uncertainty_score":0.9999307,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01452407807880943,"score_gpt":0.2809708427979573,"score_spread":0.2664467647191479,"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."}}