{"id":"W7043540244","doi":"","title":"Succinct Data Structures for Chordal Graphs","year":2019,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Waterloo","keywords":"Chordal graph; Interval graph; Neighbourhood (mathematics); Shortest path problem; Vertex (graph theory); Distance; Longest path problem; Graph; Induced path","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001978162,0.0002805903,0.0004618934,0.0003845907,0.0002810446,0.00008185491,0.004307103,0.0002614473,0.00006862078],"category_scores_gemma":[0.00001664561,0.0003202176,0.0002310659,0.0003234253,0.00007565381,0.0007107581,0.0005776713,0.0002552469,0.00001981505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002769224,"about_ca_system_score_gemma":0.000146184,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.009335289,"about_ca_topic_score_gemma":0.01792091,"domain_scores_codex":[0.998291,0.00004571048,0.0001412266,0.0008274085,0.0003548869,0.0003397545],"domain_scores_gemma":[0.9975696,0.00009719632,0.0002874759,0.001761007,0.0001954547,0.00008925379],"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.000996405,0.0005131256,0.001460912,0.004230816,0.001747744,0.0001251106,0.2229983,0.0002046731,0.003268826,0.439424,0.07496507,0.250065],"study_design_scores_gemma":[0.01464281,0.003080537,0.08291123,0.001771446,0.001827862,0.00006760724,0.244649,0.1964665,0.008190434,0.3455328,0.0921298,0.008729969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.9603493,0.0006434332,0.0274642,0.001539157,0.005427379,0.001732789,0.001350646,0.0003867994,0.001106314],"genre_scores_gemma":[0.08140492,0.0004183285,0.3752419,0.0001151623,0.0002509694,0.000002140494,0.0122056,0.000104568,0.5302564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8789443,"threshold_uncertainty_score":0.9999995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02565113104192915,"score_gpt":0.2386570289104132,"score_spread":0.2130058978684841,"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."}}