{"id":"W2127431051","doi":"10.1109/ipdps.2008.4536467","title":"A linear solver for benchmarking partitioners","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Graph partition; Benchmarking; Partition (number theory); Parallel computing; Solver; Workload; Benchmark (surveying); Graph; Theoretical computer science; Mathematics; Programming language","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.0002464094,0.0002124084,0.0002104968,0.0001185895,0.0005537026,0.0003647823,0.000456829,0.0001111313,0.000006901702],"category_scores_gemma":[0.00003513037,0.0001970611,0.00009657541,0.0002224749,0.00008634397,0.001127474,0.00008029259,0.0001387729,0.00000674295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007328265,"about_ca_system_score_gemma":0.00006740392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001251646,"about_ca_topic_score_gemma":0.000001307333,"domain_scores_codex":[0.9983958,0.000006925727,0.0004085742,0.0005233464,0.0003233168,0.0003420427],"domain_scores_gemma":[0.9988326,0.0000471596,0.0002398928,0.00008102159,0.0006692804,0.0001300893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001703003,0.002063002,0.07244319,0.002203446,0.001342602,0.0001414237,0.02367007,0.05113991,0.04336031,0.3822592,0.397567,0.02210685],"study_design_scores_gemma":[0.001147928,0.0001474884,0.0006451869,0.0001867174,0.00001703868,0.00039575,0.0001095052,0.9552539,0.0007808993,0.003033116,0.03782574,0.0004567063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02724083,0.00012051,0.96503,0.003125797,0.001294803,0.0002752677,0.00003282223,0.0002523226,0.002627613],"genre_scores_gemma":[0.9822032,0.00007308672,0.01563142,0.0003814049,0.0009416853,0.0001735152,0.0000655792,0.00001508491,0.0005150642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9549623,"threshold_uncertainty_score":0.8035917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03285077255578916,"score_gpt":0.2692368145060563,"score_spread":0.2363860419502671,"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."}}