{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178423,0.00139212,0.0009121165,0.001691281,0.001710504,0.004332123,0.003216385,0.001436643,0.02185592],"category_scores_gemma":[0.002237896,0.001062578,0.002480047,0.002657729,0.002196929,0.006794442,0.005221312,0.005128247,0.006981462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001481754,"about_ca_system_score_gemma":0.0009363028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006725499,"about_ca_topic_score_gemma":0.001275501,"domain_scores_codex":[0.999211,0.0001480763,0.00007168261,0.0002225291,0.0002491431,0.0000975395],"domain_scores_gemma":[0.9992366,0.0002571044,0.0000341318,0.0002779227,0.0001280515,0.00006620668],"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.00002871234,0.00004473145,0.00009805149,0.0001246506,0.00001049526,0.00005375854,0.0001994629,0.001795845,0.002507087,0.924556,0.006624099,0.06395721],"study_design_scores_gemma":[0.00001903295,0.00002222604,0.000105809,0.00003055796,0.00001746313,0.0001287613,0.00005961879,0.007363509,0.001075491,0.9642033,0.02695769,0.00001656774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008161752,0.0003620481,0.9528489,0.0006403251,0.0002844908,0.0002662049,0.0003446644,0.0008830396,0.0362087],"genre_scores_gemma":[0.07076884,0.0008194582,0.8866717,0.0003938617,0.0003596637,0.000474863,0.001122511,0.0006435078,0.03874556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02185592,"threshold_uncertainty_score":0.07311535,"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."}}