{"id":"W1990976277","doi":"10.1145/1141277.1141385","title":"On the transitive closure representation and adjustable compression","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Transitive closure; Digraph; Transitive reduction; Directed graph; Computer science; Theoretical computer science; Transitive relation; Directed acyclic graph; Graph; Dependency graph; Discrete mathematics; Mathematics; Algorithm; Combinatorics; Voltage graph; Line 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.0007702565,0.0007735927,0.0006245819,0.001709426,0.0006726448,0.001883704,0.001115836,0.0007049167,0.005030659],"category_scores_gemma":[0.005582861,0.0003694549,0.0007555384,0.002937374,0.001297694,0.00442664,0.001835827,0.001578091,0.001359082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107318,"about_ca_system_score_gemma":0.001150134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00185013,"about_ca_topic_score_gemma":0.001562059,"domain_scores_codex":[0.9985228,0.000337138,0.0001361807,0.0002726048,0.0005679628,0.0001633717],"domain_scores_gemma":[0.9974328,0.001202547,0.0001950715,0.0008147996,0.0002926159,0.00006220345],"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.0004121421,0.0001386341,0.0004634676,0.0002076279,0.00002501982,0.0004262649,0.0004557606,0.04779955,0.02207888,0.3515273,0.009912503,0.5665529],"study_design_scores_gemma":[0.0001320059,0.0003241765,0.0004799486,0.0001623159,0.00006025739,0.001177414,0.0002754498,0.550033,0.05160122,0.3509966,0.04464707,0.0001106444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02401208,0.0006810388,0.9606963,0.0004450406,0.0001396716,0.0001438228,0.0002953184,0.001941807,0.01164484],"genre_scores_gemma":[0.2890818,0.001184739,0.6989501,0.0003747737,0.0002809322,0.000461846,0.001428836,0.0005530151,0.00768393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005030659,"threshold_uncertainty_score":0.01682925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01200556966119021,"score_gpt":0.2162163773886526,"score_spread":0.2042108077274624,"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."}}