{"id":"W4288374872","doi":"10.48550/arxiv.1904.03723","title":"Linear-Time and Efficient Distributed Algorithms for List Coloring\\n Graphs on Surfaces","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Algorithm; Time complexity; Vertex (graph theory); Discrete mathematics; Edge coloring; Graph; Line graph; Graph power","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313663,0.001969021,0.001709309,0.001154433,0.002462993,0.003040475,0.004525829,0.002034082,0.01067835],"category_scores_gemma":[0.00611312,0.0009250168,0.001780881,0.002953175,0.001699967,0.006262797,0.004282653,0.002646356,0.003984924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004223037,"about_ca_system_score_gemma":0.003599069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007708847,"about_ca_topic_score_gemma":0.01196821,"domain_scores_codex":[0.9968554,0.0004308951,0.0001919326,0.0009756589,0.0007660737,0.0007800479],"domain_scores_gemma":[0.9944915,0.002463422,0.0003498711,0.001827093,0.0005636098,0.0003045617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003091878,0.0008189255,0.003874633,0.001141228,0.0002818481,0.0003463751,0.001358158,0.2901937,0.03011648,0.1326304,0.05714683,0.4789996],"study_design_scores_gemma":[0.0005817986,0.0002228603,0.0007841151,0.00005168841,0.0001101661,0.0001549154,0.0003246012,0.8154997,0.01231053,0.1559515,0.01393485,0.00007326799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0899705,0.0021023,0.8585926,0.002444786,0.000299463,0.00058528,0.001295865,0.01931993,0.02538931],"genre_scores_gemma":[0.501614,0.0007089633,0.4760776,0.0005802031,0.0001905535,0.0007545605,0.004055706,0.001233778,0.01478451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01067835,"threshold_uncertainty_score":0.03572261,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07860142928739612,"score_gpt":0.2365674104703093,"score_spread":0.1579659811829132,"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."}}