{"id":"W3204812806","doi":"10.1145/3477542","title":"Adjacency Labelling for Planar Graphs (and Beyond)","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Adjacency list; Planar graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Pathwidth; Bounded function; Chordal graph; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.000442851,0.00005614756,0.0001142443,0.00005021474,0.0001355219,0.00007327971,0.00104476,0.00002858778,0.000001867176],"category_scores_gemma":[0.0004797918,0.00003456344,0.000113069,0.0002067477,0.00002162741,0.0001435322,0.000252805,0.0001248019,0.000001046018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005389327,"about_ca_system_score_gemma":0.0000647468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001127302,"about_ca_topic_score_gemma":0.000001306874,"domain_scores_codex":[0.9993542,0.00003907019,0.0002172661,0.00009720707,0.0001744809,0.0001177144],"domain_scores_gemma":[0.9988095,0.0001596894,0.0001829653,0.0005807488,0.0002078871,0.00005927393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004181439,0.000221848,0.004984572,0.00008767762,0.0002344799,0.00009197432,0.002270524,0.0006005298,0.1039519,0.7865722,0.07722705,0.02371545],"study_design_scores_gemma":[0.0004551399,0.00006762652,0.0003770554,0.00006148644,0.00002120935,0.0002740352,0.00003863789,0.0007378879,0.01475211,0.9798019,0.003349387,0.00006351408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8731633,0.01517284,0.03089944,0.07596566,0.00403836,0.0001634935,0.000004684497,0.00004705456,0.0005452152],"genre_scores_gemma":[0.5361359,0.0005886453,0.4590572,0.003594862,0.00004325194,0.000001741265,3.290231e-7,0.00001260677,0.0005654777],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4281578,"threshold_uncertainty_score":0.1941442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02032145312571858,"score_gpt":0.2416427083824907,"score_spread":0.2213212552567721,"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."}}