{"id":"W1456458654","doi":"10.1007/978-3-540-89682-1_3","title":"Procedural Natural Phenomena from Least-Cost Paths in a Weighted Graph","year":2008,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Graph; Computer science; Lattice (music); Generator (circuit theory); Process (computing); Path (computing); Topology (electrical circuits); Algorithm; Theoretical computer science; Combinatorics; Mathematics; Physics; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004391365,0.0002499896,0.0002841687,0.001407925,0.0003552291,0.0006145099,0.003730088,0.0001051947,0.000008773615],"category_scores_gemma":[0.00003632167,0.0002455223,0.00004623795,0.0009769412,0.0006992158,0.007842627,0.00206529,0.0004942086,0.00006692177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001537286,"about_ca_system_score_gemma":0.0003718686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003999646,"about_ca_topic_score_gemma":0.00005523867,"domain_scores_codex":[0.998037,0.00003360452,0.0007992855,0.0003517603,0.0005108579,0.000267535],"domain_scores_gemma":[0.9973618,0.00011396,0.000342697,0.001749045,0.0003202442,0.0001122985],"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.000005144757,0.0000721164,0.0002486919,0.00003116174,0.00001162337,0.000003002344,0.008195121,0.0001593618,0.000003252494,0.6346223,0.002508513,0.3541397],"study_design_scores_gemma":[0.0004577296,0.0000216248,0.001869342,0.0002079883,0.000002935067,0.00001619311,0.00002944129,0.8139742,0.000004108934,0.004951251,0.1780909,0.0003742943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004019619,0.002480228,0.7600574,0.003459345,0.001358578,0.001678682,0.0002013963,0.0004062875,0.2299561],"genre_scores_gemma":[0.3959567,0.0533053,0.5155833,0.02229621,0.0003873122,0.000233579,0.004203235,0.0000860338,0.007948296],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8138149,"threshold_uncertainty_score":0.9999997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03366037246700519,"score_gpt":0.2894592462549842,"score_spread":0.255798873787979,"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."}}