{"id":"W4398163643","doi":"10.1109/dcc58796.2024.00057","title":"Succinct Data Structures for Path Graphs and Chordal Graphs Revisited","year":2024,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Combinatorics; Binary logarithm; Neighbourhood (mathematics); Mathematics; Data structure; Chordal graph; Vertex (graph theory); Longest path problem; Adjacency list; Shortest path problem; Path (computing); Log-log plot; Intersection (aeronautics); Induced path; Discrete mathematics; Graph; Computer science","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.00219955,0.001185822,0.001435822,0.002477259,0.001123227,0.003689765,0.004246683,0.001361815,0.01182368],"category_scores_gemma":[0.01992805,0.001085258,0.001207389,0.006087603,0.002001242,0.01605756,0.004836214,0.004352138,0.003405845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002474515,"about_ca_system_score_gemma":0.003218546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003275225,"about_ca_topic_score_gemma":0.004646448,"domain_scores_codex":[0.9947231,0.0008392963,0.0008012219,0.0007613982,0.002380199,0.0004948439],"domain_scores_gemma":[0.9792367,0.004237566,0.001519704,0.01161981,0.003007648,0.0003784731],"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.001787769,0.0004557165,0.003621768,0.001045989,0.0001117745,0.000330732,0.0009056493,0.04603089,0.02449447,0.3690211,0.05677122,0.495423],"study_design_scores_gemma":[0.0004974878,0.001054401,0.001433389,0.0005215866,0.0001598767,0.001175365,0.0007846215,0.2286599,0.07341711,0.5316147,0.1603411,0.000340515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0300709,0.001358415,0.9428669,0.002844024,0.0004970455,0.0004637192,0.006460932,0.009179063,0.006258956],"genre_scores_gemma":[0.299192,0.001299678,0.6729271,0.001863302,0.0003491659,0.001086153,0.01288825,0.001539995,0.008854313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01182368,"threshold_uncertainty_score":0.03955418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02761929996222112,"score_gpt":0.2909809107088401,"score_spread":0.263361610746619,"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."}}