{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002396993,0.0001278237,0.0001284819,0.0001140371,0.0001285465,0.0005706185,0.001033751,0.00004473657,0.00002554464],"category_scores_gemma":[0.00002443455,0.00008552481,0.0000348769,0.0003071041,0.00002762339,0.001002209,0.0009848399,0.00008721573,0.00000377693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004254714,"about_ca_system_score_gemma":0.00002845401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004938532,"about_ca_topic_score_gemma":0.00000572212,"domain_scores_codex":[0.9988229,0.00002155477,0.0001519867,0.0006501944,0.0001603913,0.000192928],"domain_scores_gemma":[0.9986929,0.0001217815,0.00002214678,0.001045701,0.00003113169,0.00008638007],"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.000005570746,0.0000101086,0.0002190887,0.00009041051,0.00002669393,0.00001582017,0.00006900849,9.933119e-7,0.0002737089,0.6867927,0.09476852,0.2177274],"study_design_scores_gemma":[0.000356111,0.0001181335,0.005088088,0.0001009356,0.00002374089,0.00005557899,0.00001633942,0.5492188,0.0002522933,0.2840787,0.1603516,0.0003395826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004901294,0.004509873,0.9879165,0.0005501248,0.0005900083,0.0002998354,0.0003486864,0.0004579221,0.0004257863],"genre_scores_gemma":[0.3623475,0.0007532751,0.6346681,0.0007565003,0.0001951376,0.00002277787,0.0008057158,0.00003124678,0.0004198184],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5492179,"threshold_uncertainty_score":0.5502487,"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."}}