{"id":"W4412444696","doi":"10.1109/access.2025.3589353","title":"P4Muse: Enabling Modular P4 Programming via Compiler-Managed Code Merging Without Syntax Modifications","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Computer science; Programming language; Compiler; Modular design; Abstract syntax tree; Syntax; Code (set theory); Parallel computing; Parsing; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0004613205,0.000211666,0.0002583021,0.0004151893,0.0005746528,0.0009106016,0.002297648,0.00008764059,0.000003164126],"category_scores_gemma":[0.00005858906,0.0001983228,0.00008025071,0.001289292,0.00006029422,0.0008941208,0.0004233707,0.0002448579,0.000009353695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007527274,"about_ca_system_score_gemma":0.00007835788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001546242,"about_ca_topic_score_gemma":0.00002744662,"domain_scores_codex":[0.9981856,0.0001270637,0.0004008615,0.000626405,0.0002683196,0.0003917618],"domain_scores_gemma":[0.998458,0.0001118816,0.0001887079,0.0009485658,0.0002105031,0.0000823054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002236962,0.0004904574,0.007224006,0.0003002893,0.000229717,0.00003320834,0.001443308,0.7034022,0.007464802,0.04968017,0.003839031,0.2258705],"study_design_scores_gemma":[0.0002440506,0.00001095162,0.0005350855,0.0001369222,0.00001884441,0.000002379723,0.00001300707,0.9713112,0.01886312,0.004030972,0.004544439,0.0002890378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007863971,0.0001407078,0.986622,0.0008908313,0.0005622932,0.0004133205,0.000001763021,0.001672978,0.001832177],"genre_scores_gemma":[0.8061848,0.00003033807,0.1929518,0.000349942,0.00005313696,0.0000882047,0.000004897741,0.0000143638,0.0003225937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7983208,"threshold_uncertainty_score":0.8780953,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03322025648786596,"score_gpt":0.3280879164643197,"score_spread":0.2948676599764537,"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."}}