{"id":"W2048808499","doi":"10.1145/1370256.1370293","title":"A new method for generating compressed representation of transitive closure","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Transitive closure; Combinatorics; Reachability; Digraph; Mathematics; Directed graph; Path (computing); Discrete mathematics; Transitive reduction; Node (physics); Bounded function; Transitive relation; Closure (psychology); Graph; Computer science; Physics; 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.0004750793,0.0008964835,0.0009010831,0.002081752,0.000661281,0.001474814,0.001604613,0.0005926591,0.006328523],"category_scores_gemma":[0.005810868,0.0006088176,0.0008317672,0.003183237,0.0006627628,0.0037985,0.001785429,0.001173749,0.00153645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008139194,"about_ca_system_score_gemma":0.001604211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002152897,"about_ca_topic_score_gemma":0.002759515,"domain_scores_codex":[0.9988419,0.0001296455,0.0001129039,0.0002092547,0.000604218,0.0001020814],"domain_scores_gemma":[0.996592,0.001103599,0.0002805199,0.00138569,0.0005349923,0.0001032834],"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.001128805,0.0003283915,0.001803174,0.0005447245,0.00009798045,0.0006208956,0.0007355718,0.03418656,0.07963555,0.05387669,0.03161227,0.7954293],"study_design_scores_gemma":[0.0004528144,0.0006152557,0.001177764,0.0001414731,0.000107091,0.001497457,0.0004236797,0.6794708,0.1526527,0.08481764,0.07847971,0.0001636418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03484972,0.0003018661,0.9422986,0.0003594853,0.0002116511,0.0003831168,0.003537895,0.01431398,0.003743701],"genre_scores_gemma":[0.1720093,0.0002241946,0.8131104,0.0002070611,0.0001329584,0.001041511,0.008384989,0.001108783,0.003780822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006328523,"threshold_uncertainty_score":0.02117103,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05089064937077532,"score_gpt":0.3230154300042722,"score_spread":0.2721247806334969,"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."}}