{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343724,0.001902891,0.001274908,0.002065282,0.001150005,0.0022039,0.001580488,0.001277006,0.009101721],"category_scores_gemma":[0.004786158,0.0009031486,0.001806138,0.002772636,0.002055129,0.005913406,0.003751172,0.003509537,0.004286588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001470449,"about_ca_system_score_gemma":0.001335384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002936378,"about_ca_topic_score_gemma":0.002679459,"domain_scores_codex":[0.9981272,0.0006499968,0.00009097267,0.0005248202,0.0004255279,0.0001815023],"domain_scores_gemma":[0.9984056,0.0006905079,0.00009494063,0.000483391,0.0002369234,0.00008859632],"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.0001630924,0.0001050724,0.0005097645,0.0007368492,0.0001248963,0.0002241443,0.0002992929,0.07093725,0.004139016,0.5629239,0.03629348,0.3235432],"study_design_scores_gemma":[0.00003676805,0.00005037277,0.0002090968,0.0001744472,0.00005285,0.0002907167,0.00009234149,0.1151671,0.001404579,0.8040248,0.07846992,0.00002705517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003231046,0.002874361,0.9782605,0.001188885,0.0003953941,0.0001076023,0.000223452,0.0005131235,0.01320571],"genre_scores_gemma":[0.05578192,0.005598812,0.9221986,0.001052058,0.0006748203,0.0002461848,0.001292521,0.0005736519,0.01258144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009101721,"threshold_uncertainty_score":0.03044826,"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."}}