{"id":"W4287236889","doi":"10.48550/arxiv.2104.03546","title":"Graph Partitioning and Sparse Matrix Ordering using Reinforcement\\n Learning and Graph Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Dense graph; Reinforcement learning; Sparse matrix; Adjacency matrix; Graph; Algorithm; Theoretical computer science; Combinatorics; Artificial intelligence; Mathematics; Line graph; Pathwidth","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003720024,0.0009539475,0.0007045406,0.0008205746,0.0004705848,0.0006308585,0.001159802,0.0007948444,0.002568434],"category_scores_gemma":[0.001770187,0.0004793845,0.0005583328,0.0007963338,0.0008289969,0.001325069,0.001025612,0.001226537,0.0005565159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001029787,"about_ca_system_score_gemma":0.001101319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00908766,"about_ca_topic_score_gemma":0.01934079,"domain_scores_codex":[0.9997066,0.00006951588,0.00001240687,0.00007714178,0.00009610461,0.00003834882],"domain_scores_gemma":[0.9994116,0.0002634935,0.0000728358,0.0001106243,0.00009703288,0.00004455659],"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.00008796927,0.00006892333,0.0005479753,0.00008332457,0.00003428303,0.0000911578,0.00009524999,0.800464,0.009231505,0.02957121,0.002548293,0.1571763],"study_design_scores_gemma":[0.000006065868,0.00001159672,0.00003579916,0.000002771989,0.000002118049,0.00001121748,0.000005564713,0.9921733,0.001176904,0.005999474,0.0005726496,0.000002529095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009467202,0.00008178811,0.9884178,0.00009167734,0.00001938285,0.00002983796,0.00003479912,0.0005249904,0.001332597],"genre_scores_gemma":[0.236136,0.0001456861,0.7580271,0.0001566586,0.00004953336,0.0001248998,0.0003680701,0.0003019446,0.00469016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00908766,"threshold_uncertainty_score":0.01806951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04123634730311696,"score_gpt":0.186060707543579,"score_spread":0.144824360240462,"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."}}