{"id":"W2127114148","doi":"10.1109/icde.2011.5767832","title":"Decomposing DAGs into spanning trees: A new way to compress transitive closures","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Reachability; Digraph; Transitive closure; Combinatorics; Computer science; Transitive relation; Spanning tree; Graph; Transitive reduction; Mathematics; Directed acyclic graph; Theoretical computer science; Discrete mathematics; Line graph; Voltage graph","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.0001621145,0.0001540857,0.0001605572,0.0001538452,0.000121951,0.0002699711,0.00117577,0.00002697556,0.00007882166],"category_scores_gemma":[0.000006722058,0.0001343932,0.00005508411,0.0003386035,0.00002237551,0.001118326,0.0004146862,0.00007327987,0.0001521881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001729931,"about_ca_system_score_gemma":0.00001640887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001340027,"about_ca_topic_score_gemma":0.000274938,"domain_scores_codex":[0.9988396,0.00003437712,0.0001880444,0.0004332126,0.0002079613,0.0002968752],"domain_scores_gemma":[0.9992285,0.00003370199,0.00003545426,0.0004796911,0.00003174253,0.0001908518],"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.00002742003,0.0001385377,0.0006080153,0.00001679695,0.00008717683,0.00008679746,0.03404684,0.0000896497,0.001468155,0.09241893,0.02014695,0.8508647],"study_design_scores_gemma":[0.005711886,0.002132798,0.116048,0.0007689535,0.0001882301,0.00005237347,0.005151189,0.4709543,0.1079299,0.05395009,0.2323349,0.004777396],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005372026,0.00003921638,0.9576268,0.0006543483,0.0002777189,0.0001705978,0.000001243065,0.0002610437,0.03559702],"genre_scores_gemma":[0.3355274,0.00000369845,0.6615216,0.001097562,0.00009350492,0.00000579074,0.000005136778,0.00001107931,0.001734232],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8460873,"threshold_uncertainty_score":0.5480394,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04140842396028783,"score_gpt":0.2618704271201109,"score_spread":0.2204620031598231,"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."}}