{"id":"W2949522840","doi":"10.1109/icdcs.2019.00031","title":"Local Graph Edge Partitioning with a Two-Stage Heuristic Method","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Strength of a graph; Graph; Theoretical computer science; Partition (number theory); Voltage graph; Algorithm; Line graph; Mathematics; Combinatorics","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.0004015045,0.0001151585,0.0001341363,0.00008540075,0.00009611753,0.0001138095,0.0004124387,0.00002461593,0.00018634],"category_scores_gemma":[0.000005722174,0.00008342947,0.00005179627,0.0004457218,0.00005277238,0.0003487132,0.00009695786,0.0001172961,0.000276885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008462592,"about_ca_system_score_gemma":0.00002867067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002698904,"about_ca_topic_score_gemma":0.000009496342,"domain_scores_codex":[0.9989944,0.0001111264,0.0001207725,0.0003410752,0.0001735878,0.0002590597],"domain_scores_gemma":[0.999248,0.0001331708,0.00004264632,0.0004418182,0.00004331604,0.00009099281],"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.00000834243,0.0000358352,0.0008003269,0.000009702558,0.00001707057,0.00002544044,0.0002088699,0.002999122,0.0002100828,0.9863597,0.00005607956,0.009269464],"study_design_scores_gemma":[0.002358153,0.0007471397,0.002366234,0.0000971103,0.00002524991,0.0001573868,0.0004151842,0.7397344,0.01788536,0.2307366,0.004563457,0.0009138081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01124399,0.00002049462,0.9733182,0.0001156769,0.000170882,0.0001095696,0.000001107201,0.0001971973,0.01482291],"genre_scores_gemma":[0.7656191,6.558609e-7,0.2317003,0.0003797169,0.00001592397,0.000009104506,0.000001226856,0.000006510551,0.002267438],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7556231,"threshold_uncertainty_score":0.3558889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009210953413602176,"score_gpt":0.2514652177922099,"score_spread":0.2422542643786077,"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."}}