{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001256073,0.0001876133,0.0002583921,0.000438756,0.001345658,0.0001358385,0.003013878,0.00002695028,0.00001314703],"category_scores_gemma":[0.00002766078,0.0001751506,0.0001004946,0.003068692,0.001412456,0.0004133536,0.001485309,0.0002249613,0.000005994504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001380936,"about_ca_system_score_gemma":0.0002104036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004049849,"about_ca_topic_score_gemma":4.408356e-7,"domain_scores_codex":[0.9970254,0.0001624129,0.0003165212,0.000858167,0.001014309,0.0006231402],"domain_scores_gemma":[0.9977502,0.0003120136,0.00009255842,0.001045682,0.000463594,0.0003360059],"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.00007339608,0.000220499,0.00002122372,0.000006247787,0.00001003648,0.000002486352,0.0001667769,0.01524019,0.03573719,0.9443107,0.00001714579,0.004194087],"study_design_scores_gemma":[0.0005023935,0.001030196,0.0001125947,0.000006733005,0.000005076648,0.00004319931,0.000007996566,0.6079988,0.01009055,0.3798708,0.0001457145,0.0001859302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09420871,0.00001310281,0.9033883,0.0008488568,0.0002871636,0.0009501849,0.00003283561,0.0001232084,0.0001476469],"genre_scores_gemma":[0.5342804,3.734708e-7,0.4651596,0.0001541072,0.00004502544,0.0003440049,0.000005335283,0.000009180623,0.000002002409],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5927587,"threshold_uncertainty_score":0.9999545,"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."}}