{"id":"W4225162735","doi":"10.1016/j.tcs.2022.04.052","title":"A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Modular design; Mathematics; Orthogonality; Time complexity; Decomposition; Scheme (mathematics); Polynomial; Focus (optics); Discrete mathematics; Combinatorics; Algorithm; Computer science","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.002201783,0.001471485,0.001217165,0.002557091,0.002161069,0.005526945,0.004064687,0.002060659,0.01576367],"category_scores_gemma":[0.005702689,0.001094434,0.003708008,0.003846728,0.003103388,0.008265263,0.007734104,0.006215369,0.004319287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001885242,"about_ca_system_score_gemma":0.001526715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00136801,"about_ca_topic_score_gemma":0.002504673,"domain_scores_codex":[0.9983734,0.0003243468,0.0001735368,0.0004833191,0.0004595277,0.0001858243],"domain_scores_gemma":[0.9975718,0.0008962451,0.0001091118,0.0008560659,0.0003712396,0.0001954723],"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.00005059003,0.00008344084,0.0002794885,0.0001546737,0.0000193497,0.0000915247,0.0002843249,0.004476544,0.003333749,0.9170104,0.005250807,0.06896527],"study_design_scores_gemma":[0.00003693056,0.00003928315,0.0001954773,0.00004730677,0.00003790895,0.0001643499,0.00008687796,0.02702275,0.001520747,0.9554464,0.01536747,0.00003450846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007676422,0.0001316907,0.9789909,0.0004714318,0.0001706653,0.0002123793,0.0002402322,0.0006478888,0.01145849],"genre_scores_gemma":[0.06940607,0.0003641975,0.9160464,0.0002908139,0.0002326447,0.0004022507,0.0008088132,0.0004847063,0.01196409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01576367,"threshold_uncertainty_score":0.05273473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006917649435479797,"score_gpt":0.2796359749847135,"score_spread":0.2727183255492338,"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."}}