{"id":"W4206998859","doi":"10.1016/j.ic.2022.104867","title":"Compact representation of graphs with bounded bandwidth or treedepth","year":2022,"lang":"en","type":"article","venue":"Information and Computation","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Bounded function; Combinatorics; Bandwidth (computing); Adjacency list; Constant (computer programming); Binary logarithm; Discrete mathematics; Mathematics; Complement (music); Computer science; Graph; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002107257,0.0005307989,0.0005821824,0.001295284,0.0003072687,0.001638729,0.0008759137,0.000745089,0.005774547],"category_scores_gemma":[0.002773433,0.0002631866,0.0003060394,0.002067512,0.0004343097,0.002726011,0.0008767429,0.0009909931,0.001113473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00056891,"about_ca_system_score_gemma":0.0004074055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001166143,"about_ca_topic_score_gemma":0.00179461,"domain_scores_codex":[0.9997713,0.00004545461,0.0000154675,0.00004937732,0.00007976733,0.00003861558],"domain_scores_gemma":[0.9989461,0.0003505381,0.0001176643,0.0003544546,0.000169071,0.00006218979],"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.0006326727,0.0001350788,0.0008786849,0.0005463717,0.00003801245,0.0003782909,0.0005434279,0.1602789,0.02866254,0.4267205,0.01740088,0.3637846],"study_design_scores_gemma":[0.00004778603,0.00009282817,0.0004713215,0.0001061249,0.00003184888,0.0003220363,0.0001913779,0.5315364,0.009151731,0.4390841,0.01893634,0.00002809507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06957833,0.0008789836,0.9173163,0.0005423494,0.0001289607,0.00007782265,0.001817862,0.001740085,0.007919314],"genre_scores_gemma":[0.6200582,0.001349268,0.3659703,0.0002501588,0.0001162038,0.0002009,0.003444659,0.0005350149,0.008075311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005774547,"threshold_uncertainty_score":0.01931781,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01989807263903853,"score_gpt":0.269261255060104,"score_spread":0.2493631824210654,"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."}}