{"id":"W4287812716","doi":"10.48550/arxiv.2004.11315","title":"Engineering Data Reduction for Nested Dissection","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Preprocessor; Computer science; Reduction (mathematics); Sparse matrix; Computation; Dense graph; Graph; Node (physics); Algorithm; Shortest path problem; Theoretical computer science; Mathematics; Artificial intelligence; 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.001295548,0.001125939,0.000960589,0.001324636,0.001141839,0.001591034,0.001972059,0.0009355476,0.008793752],"category_scores_gemma":[0.007360556,0.0006958453,0.001686935,0.001458572,0.001582734,0.002993505,0.003126997,0.002866287,0.003232253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009363087,"about_ca_system_score_gemma":0.00158675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002113252,"about_ca_topic_score_gemma":0.004503927,"domain_scores_codex":[0.9981864,0.0003193583,0.0001205145,0.0004030516,0.0008064543,0.0001641975],"domain_scores_gemma":[0.9960912,0.001774171,0.0002316146,0.001217394,0.000573825,0.0001117569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002492004,0.0002727985,0.001873951,0.0007792306,0.00009124744,0.0003419595,0.0006547617,0.1833102,0.02834248,0.2554274,0.02708221,0.5015747],"study_design_scores_gemma":[0.00007767903,0.0001410377,0.0003104359,0.00009760151,0.00003567832,0.0004228792,0.000295023,0.5671241,0.02757668,0.3481042,0.05577111,0.0000434742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006723278,0.0001063469,0.987947,0.000250598,0.00005591815,0.00008728517,0.0002126213,0.0009453708,0.003671587],"genre_scores_gemma":[0.04905139,0.0001383169,0.9453843,0.0001802162,0.00003667759,0.0001311631,0.0008589935,0.0005638193,0.003655062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008793752,"threshold_uncertainty_score":0.02941799,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1338539101491547,"score_gpt":0.1952139794541397,"score_spread":0.06136006930498494,"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."}}