{"id":"W1738403920","doi":"10.1007/978-3-540-70918-3_30","title":"An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Combinatorics; Vertex (graph theory); Algorithm; Graph; Computer science; Mathematics; Discrete mathematics","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002341659,0.000930873,0.0008233348,0.001960017,0.0006289239,0.0007121364,0.007898924,0.0005401812,0.00002965679],"category_scores_gemma":[0.00009026869,0.0008938881,0.0003318977,0.001450474,0.002017526,0.001697653,0.001222962,0.001413159,0.00002577678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005381723,"about_ca_system_score_gemma":0.001010201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000730023,"about_ca_topic_score_gemma":0.0001304866,"domain_scores_codex":[0.9925973,0.0000710891,0.000790991,0.003027978,0.001743916,0.001768716],"domain_scores_gemma":[0.99439,0.001096712,0.0003558928,0.002899281,0.0007114467,0.0005466905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002864813,0.00006004255,0.000006410808,0.00003780876,0.00001795709,0.0002065026,0.0002339745,0.01097634,0.00004922795,0.03408115,0.00002084978,0.9542811],"study_design_scores_gemma":[0.0003894164,0.0006681685,0.00003433126,0.0001827642,0.000007854128,0.0001695755,5.516489e-7,0.6521794,0.0003648369,0.3430239,0.002103057,0.0008760648],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003647627,0.001431733,0.9931536,0.0002168064,0.002554761,0.001171535,0.00007824075,0.0003619432,0.000994891],"genre_scores_gemma":[0.00644455,0.00008586633,0.9915686,0.0007127245,0.0005210708,0.00003943691,0.00004402554,0.0001038167,0.0004799642],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.953405,"threshold_uncertainty_score":0.9993512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02100869454204046,"score_gpt":0.3043820339160814,"score_spread":0.2833733393740409,"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."}}