{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001951776,0.0001870256,0.0001784745,0.0001445485,0.000115027,0.0001047145,0.001914415,0.0001478261,0.000003882048],"category_scores_gemma":[0.00004795523,0.0002317378,0.0001035019,0.0004773938,0.00002525999,0.0005833275,0.001617779,0.0003055903,0.00001521699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005429853,"about_ca_system_score_gemma":0.00005904906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001668945,"about_ca_topic_score_gemma":0.000001558702,"domain_scores_codex":[0.9985591,0.00004395155,0.0001170631,0.001046782,0.0000429887,0.0001901809],"domain_scores_gemma":[0.9983793,0.00004300777,0.0001123503,0.001293558,0.00006647813,0.0001052736],"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.00006408809,0.00008917037,0.00006000846,0.0002807344,0.0001829757,0.0001055552,0.0003860642,0.3984883,0.001312548,0.5943028,0.0005732644,0.004154452],"study_design_scores_gemma":[0.0001927354,0.00002906505,0.00016604,0.00003991488,0.00004608484,0.000008756204,0.00003374371,0.945938,0.000315232,0.05240272,0.0005747615,0.0002529387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04031072,0.0000179461,0.9571578,0.0001489587,0.001582047,0.0002791027,0.0000385656,0.0003863272,0.0000785228],"genre_scores_gemma":[0.9908965,0.00002472146,0.008455926,0.00001532729,0.0002166254,0.000001340802,0.0001505313,0.00001421512,0.0002248648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9505857,"threshold_uncertainty_score":0.9449993,"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."}}