{"id":"W2775079186","doi":"10.4018/978-1-60566-026-4.ch267","title":"Graph Encoding and Transitive Closure Representation","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","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; Reachability; Digraph; Computer science; Theoretical computer science; Directed graph; Graph; Combinatorics; Discrete mathematics; Mathematics; Algorithm","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.0005559503,0.0007746757,0.0006315311,0.002113858,0.0006093424,0.003401119,0.001183671,0.0008876337,0.006879375],"category_scores_gemma":[0.003689125,0.0004603853,0.001066209,0.003163432,0.0008788795,0.004854581,0.001010196,0.001365597,0.001936037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001397818,"about_ca_system_score_gemma":0.001310266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003971261,"about_ca_topic_score_gemma":0.003263155,"domain_scores_codex":[0.9989562,0.0002320225,0.0001302176,0.0002759732,0.0003168771,0.00008875481],"domain_scores_gemma":[0.9980419,0.000769525,0.0002578429,0.0005255462,0.0003362392,0.0000689952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001756288,0.0001626771,0.0004200964,0.000422377,0.00003277548,0.0005346706,0.0007618525,0.04327453,0.00807593,0.6319845,0.0204653,0.2936897],"study_design_scores_gemma":[0.00006756996,0.00009130635,0.0002731458,0.0001794954,0.00006201267,0.0006507364,0.000356624,0.2632414,0.01315944,0.6115627,0.1102826,0.00007291717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009548563,0.0004425095,0.9699737,0.000571602,0.0001812114,0.0001765427,0.002958972,0.004470058,0.01167693],"genre_scores_gemma":[0.1821644,0.001329172,0.795615,0.0002686348,0.0001866108,0.0004612397,0.008635223,0.0009437997,0.01039596],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006879375,"threshold_uncertainty_score":0.02301383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02050279621371809,"score_gpt":0.2478238497773983,"score_spread":0.2273210535636802,"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."}}