{"id":"W4402475585","doi":"10.1109/ccece59415.2024.10667338","title":"A Recursive Partitioning Approach to Improving Hypergraph Partitioning","year":2024,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Hypergraph; Recursive partitioning; Computer science; Parallel computing; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Machine learning","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":[],"consensus_categories":[],"category_scores_codex":[0.000139595,0.0001306024,0.0001098642,0.000177138,0.00007246621,0.0001865509,0.00008600028,0.00006486439,0.00006520698],"category_scores_gemma":[0.0000156148,0.0001257127,0.00006422538,0.0003962888,0.00001331169,0.0002264274,0.00002100743,0.0001539822,0.0001343678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005405768,"about_ca_system_score_gemma":0.00001081879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002055846,"about_ca_topic_score_gemma":0.000003590641,"domain_scores_codex":[0.999242,0.00001143797,0.0001618176,0.0002140543,0.0001050605,0.000265651],"domain_scores_gemma":[0.9997044,0.00002873842,0.000005606866,0.0001433288,0.00002225959,0.00009568113],"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.00001290245,0.0001128499,0.0004525229,0.001410521,0.0003307567,0.00008700742,0.005736566,0.03555611,0.1657188,0.3777586,0.1767498,0.2360736],"study_design_scores_gemma":[0.0002867466,0.0002740727,0.0004856084,0.0008792269,0.000135628,0.0001538956,0.001342823,0.6307855,0.2557568,0.02585386,0.08210137,0.001944483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007879752,0.0007054165,0.8499351,0.00007196543,0.0002593387,0.0002221624,0.000005314867,0.003964825,0.1369562],"genre_scores_gemma":[0.9535093,0.00002578715,0.04558276,0.00009881877,0.0001492966,0.0002029439,0.00001211565,0.00004396318,0.0003749566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9456296,"threshold_uncertainty_score":0.5126413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00886469763933031,"score_gpt":0.2016819510933979,"score_spread":0.1928172534540676,"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."}}