{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001607675,0.00005340431,0.0001428278,0.00003579617,0.00007955547,0.00001929024,0.0001479884,0.00003343356,0.00001228065],"category_scores_gemma":[0.00001460049,0.00004521963,0.00008644798,0.0001582058,0.000006256564,0.0001687669,0.00001383792,0.00003046637,0.000001046911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006874887,"about_ca_system_score_gemma":0.00003416324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003231922,"about_ca_topic_score_gemma":0.0000351065,"domain_scores_codex":[0.9993313,0.00008541403,0.0002180594,0.0001758874,0.0001002519,0.00008911973],"domain_scores_gemma":[0.9994149,0.0001828425,0.00007562344,0.0001626056,0.0001319501,0.00003210971],"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.0001213497,0.0001277766,0.001122028,0.0000933169,0.000264063,0.00001532534,0.0342856,0.1255986,0.1865404,0.4199967,0.1146668,0.117168],"study_design_scores_gemma":[0.0004202219,0.00007436193,0.0001487911,0.00001000184,0.000002917387,0.00002947448,0.00008518413,0.9488352,0.0491873,0.0004645534,0.0006814018,0.00006061673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00264501,0.00002568897,0.9945299,0.0002341478,0.000284629,0.0002014976,0.000001012498,0.0000466026,0.002031522],"genre_scores_gemma":[0.3871732,0.000001478381,0.6114492,0.0001087104,0.0001368291,0.000009648857,0.000001474276,0.000002959902,0.001116527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8232366,"threshold_uncertainty_score":0.1844003,"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."}}