{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001394167,0.00004682481,0.00005293142,0.00001981386,0.0001325956,0.0001033739,0.000105545,0.00002429286,0.0000261436],"category_scores_gemma":[0.000003966779,0.00002604928,0.00002149119,0.0001012912,0.00001401296,0.0001451558,0.00001988314,0.00005291203,0.000011297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006859475,"about_ca_system_score_gemma":0.000003818351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002956716,"about_ca_topic_score_gemma":0.00005574351,"domain_scores_codex":[0.9994892,0.00008465561,0.00009180764,0.0001515734,0.0001028947,0.00007981034],"domain_scores_gemma":[0.9996082,0.0001532949,0.00002654621,0.0001642018,0.00003457949,0.0000132416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007047303,0.000018969,0.0002489911,0.000002280566,0.000004056343,0.000002996702,0.0003408368,0.001581988,0.0006623907,0.9525319,0.04295973,0.00163883],"study_design_scores_gemma":[0.000647712,0.0001821352,0.01450668,0.00008935359,0.00000567525,0.00005420205,0.0005851038,0.9182413,0.01130204,0.04529396,0.008854915,0.0002369298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1014726,0.00005836201,0.8168203,0.002838711,0.000380073,0.0001763205,6.142166e-7,0.00008463972,0.07816833],"genre_scores_gemma":[0.9967089,0.000002091645,0.0003078119,0.0003455725,0.00007034957,0.000006852141,8.813702e-7,0.000001994984,0.002555505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9166593,"threshold_uncertainty_score":0.1062259,"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."}}