{"id":"W2557683753","doi":"10.55630/sjc.2013.7.115-134","title":"Programming and Testing a Two-Tree Algorithm","year":2013,"lang":"en","type":"article","venue":"Serdica Journal of Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; GRASP; Algorithm; Path (computing); Tree (set theory); Architecture; Markov chain; Theoretical computer science; Mathematics; Machine learning; Programming language","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.003467849,0.001126088,0.0008829172,0.00100865,0.0009969505,0.001814399,0.002898577,0.001804195,0.01137825],"category_scores_gemma":[0.02168947,0.0006380411,0.001526983,0.001272785,0.001662203,0.004604646,0.002557551,0.001959304,0.001699686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061933,"about_ca_system_score_gemma":0.002017983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001747979,"about_ca_topic_score_gemma":0.001709501,"domain_scores_codex":[0.993534,0.002655746,0.0003737542,0.001141609,0.001562619,0.0007321825],"domain_scores_gemma":[0.9842243,0.01185394,0.0005193941,0.001524788,0.001457212,0.0004203359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002022649,0.001678208,0.008341537,0.0008140444,0.0002030288,0.0008927374,0.0007390382,0.1893423,0.01451714,0.2606903,0.02265944,0.4980995],"study_design_scores_gemma":[0.0003600625,0.0005430569,0.0006416006,0.00007385985,0.00005327196,0.0003488784,0.0001572796,0.7588983,0.007607402,0.2224985,0.008775074,0.00004265493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04755821,0.0001840442,0.93268,0.001577191,0.0001500361,0.0003841219,0.0003664166,0.002910875,0.01418903],"genre_scores_gemma":[0.2464346,0.00009105855,0.7462325,0.0004870698,0.00009292823,0.0005106656,0.0006600715,0.0003681178,0.005122996],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01137825,"threshold_uncertainty_score":0.03806406,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02005756980288629,"score_gpt":0.2934285997169636,"score_spread":0.2733710299140772,"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."}}