{"id":"W2035616518","doi":"10.1109/bdcloud.2014.118","title":"On the Graph Decomposition","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Directed acyclic graph; Disjoint sets; Node (physics); Graph; Path (computing); Decomposition; Directed graph; Combinatorics; Algorithm; Theoretical computer science; Mathematics; Computer network; Chemistry","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.0004175164,0.00004436685,0.00003512005,0.00005564375,0.0001347547,0.00006254837,0.0006676143,0.00001272576,0.00004957612],"category_scores_gemma":[0.0000526331,0.00002461983,0.00002986762,0.0002557511,0.00004147737,0.0001288525,0.0000938092,0.00008184258,0.0002954224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006291502,"about_ca_system_score_gemma":0.00000403285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001591738,"about_ca_topic_score_gemma":0.000001627689,"domain_scores_codex":[0.9993644,0.0001250601,0.00005002266,0.0001456946,0.0001748836,0.0001398876],"domain_scores_gemma":[0.9989157,0.000524667,0.00001275935,0.0004849473,0.00002654724,0.00003540307],"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.000001901765,0.000009335202,0.00001274257,3.553048e-7,0.000001332084,2.756763e-7,0.00001857903,0.00005942289,0.000554692,0.9883344,0.0008247362,0.01018223],"study_design_scores_gemma":[0.00005782549,0.00007251721,0.0003574777,0.000002571865,2.366735e-7,0.00000202366,0.000003077007,0.01822258,0.006250899,0.9736944,0.001292608,0.00004377461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01534906,0.00000325245,0.9273031,0.003280727,0.00006007142,0.0000630994,7.764254e-8,0.00009840426,0.05384219],"genre_scores_gemma":[0.9866898,0.000001254953,0.01124216,0.001672404,0.0000150937,0.000009725019,1.990804e-7,0.000002783178,0.0003665574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9713408,"threshold_uncertainty_score":0.3797155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01674793590351749,"score_gpt":0.3018606251403391,"score_spread":0.2851126892368216,"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."}}