{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001223922,0.001134639,0.001418827,0.006229186,0.0009375379,0.00226317,0.001374653,0.0007164041,0.003190875],"category_scores_gemma":[0.009526111,0.0006219625,0.001461534,0.007638642,0.000778465,0.006972153,0.002578586,0.001619992,0.001021813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001027935,"about_ca_system_score_gemma":0.001809553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004814468,"about_ca_topic_score_gemma":0.007211939,"domain_scores_codex":[0.9984339,0.0002546387,0.0002303749,0.0003041407,0.0005892262,0.0001875524],"domain_scores_gemma":[0.9947601,0.001715539,0.000527388,0.002042193,0.0007091768,0.0002456637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004332865,0.0003045943,0.004736696,0.0006358988,0.0001840606,0.0005931447,0.001371541,0.09276487,0.01754951,0.09239253,0.01615615,0.7728778],"study_design_scores_gemma":[0.0001161563,0.0003547204,0.002055928,0.0002031536,0.0001692085,0.0009512912,0.001027184,0.6023072,0.01568196,0.3235526,0.05347012,0.0001104557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0466661,0.00123554,0.9416853,0.0005502479,0.0001908187,0.0003869003,0.00320525,0.003058468,0.00302129],"genre_scores_gemma":[0.1933756,0.001160939,0.7958642,0.0001740832,0.0001659331,0.0003405524,0.005636835,0.0005652719,0.002716543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006229186,"threshold_uncertainty_score":0.01067454,"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."}}