{"id":"W1601919219","doi":"10.1007/3-540-44679-6_30","title":"A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Computer science; Closure (psychology); Algorithm; Path (computing); Shortest path problem; Space (punctuation); Transitive relation; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Graph; Computer network","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"],"consensus_categories":[],"category_scores_codex":[0.0007077187,0.0004891267,0.0004940965,0.0008155384,0.0003646502,0.0004959454,0.0009827379,0.0002751317,0.000005493575],"category_scores_gemma":[0.0001017048,0.0004759498,0.0001322649,0.000938673,0.0002934618,0.0005424811,0.0003143512,0.000452006,0.000003561457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002253885,"about_ca_system_score_gemma":0.0004342899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001244246,"about_ca_topic_score_gemma":0.00009979818,"domain_scores_codex":[0.996801,0.00003822364,0.0004302585,0.001524027,0.0006670532,0.0005394125],"domain_scores_gemma":[0.997836,0.0008487591,0.0002093142,0.0005304413,0.0003992713,0.0001761915],"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.0000143222,0.00003923849,0.00002962249,0.00003485204,0.00002226528,0.00006209515,0.0009875263,0.04325216,0.0004036958,0.008413007,0.00002156935,0.9467196],"study_design_scores_gemma":[0.0004421814,0.0002612653,0.000533877,0.0002097778,0.00001767808,0.0001380917,3.499627e-7,0.9372351,0.0002506755,0.05875982,0.001583513,0.0005677153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003423386,0.001048538,0.9951379,0.0009236846,0.001010237,0.0007370924,0.00002559085,0.0001978346,0.0005767501],"genre_scores_gemma":[0.2138111,0.0001951105,0.7839403,0.0007406311,0.0005430813,0.00003548309,0.00005413652,0.00004476236,0.000635359],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9461519,"threshold_uncertainty_score":0.9997692,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01245145183433207,"score_gpt":0.2454966569590938,"score_spread":0.2330452051247617,"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."}}