{"id":"W4415351738","doi":"10.1080/10618600.2025.2574535","title":"Computationally Efficient Algorithms for Simulating Isotropic Gaussian Random Fields on Graphs with Euclidean Edges","year":2025,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"L'Alliance Boviteq","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Agencia Nacional de Investigación y Desarrollo","keywords":"Random field; Efficient algorithm; Euclidean geometry; Gaussian; Random graph; Isotropy; Gaussian random field","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.0004045495,0.0001500632,0.0003631347,0.0004000321,0.0002106264,0.00007760774,0.00009536546,0.00006072831,0.000008243856],"category_scores_gemma":[0.0007566792,0.0001045337,0.0000887967,0.0003965941,0.0001044173,0.00004290097,0.00001846961,0.0002040581,2.259372e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001664474,"about_ca_system_score_gemma":0.0001111782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002435902,"about_ca_topic_score_gemma":0.000003000945,"domain_scores_codex":[0.9985887,0.00005413912,0.0006281225,0.000135131,0.0004295159,0.0001643665],"domain_scores_gemma":[0.9915871,0.007143568,0.0003626365,0.00004815016,0.0007765362,0.00008199017],"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.0004659538,0.0001876523,0.0003268236,0.0002810207,0.0001865631,0.00001209816,0.0001759065,0.1149979,5.163193e-7,0.8701301,0.001133998,0.01210149],"study_design_scores_gemma":[0.002854344,0.0006704308,0.004359734,0.0001887513,0.00009162468,0.00002141846,0.0001075614,0.1279496,0.000005436218,0.8633763,0.0002595977,0.0001152562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07658404,0.0001107127,0.9217515,0.001032469,0.0001256153,0.0001598143,0.0001063094,0.00001034955,0.0001191882],"genre_scores_gemma":[0.7672181,0.00001337557,0.232244,0.0003603091,0.00007362085,0.000003836424,0.00001748143,0.000008395453,0.00006083262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6906341,"threshold_uncertainty_score":0.4262762,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03055376329313129,"score_gpt":0.3253870354204538,"score_spread":0.2948332721273225,"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."}}