{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6NGCIKSUJVHJU2UVFTZJ7PQLMH","short_pith_number":"pith:6NGCIKSU","schema_version":"1.0","canonical_sha256":"f34c242a544d4e9a6a952cf29fbe0b61f7d055db606f16bedd82f7350d7a8ed8","source":{"kind":"arxiv","id":"2412.07929","version":1},"attestation_state":"computed","paper":{"title":"Dirichlet-Neumann Averaging: The DNA of Efficient Gaussian Process Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR","stat.ME"],"primary_cat":"stat.CO","authors_text":"2), 2) ((1) Institute for Mathematics, (2) Interdisciplinary Center for Scientific Computing (IWR), Heidelberg, Heidelberg), Robert Kutri (1, Robert Scheichl (1","submitted_at":"2024-12-10T21:18:08Z","abstract_excerpt":"Gaussian processes (GPs) and Gaussian random fields (GRFs) are essential for modelling spatially varying stochastic phenomena. Yet, the efficient generation of corresponding realisations on high-resolution grids remains challenging, particularly when a large number of realisations are required. This paper presents two novel contributions. First, we propose a new methodology based on Dirichlet-Neumann averaging (DNA) to generate GPs and GRFs with isotropic covariance on regularly spaced grids. The combination of discrete cosine and sine transforms in the DNA sampling approach allows for rapid e"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.07929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2024-12-10T21:18:08Z","cross_cats_sorted":["cs.NA","math.NA","math.PR","stat.ME"],"title_canon_sha256":"5f4c4167267759fac730960ee18d6eb3b3d2980697a50eda8edddfd6ffab1fd5","abstract_canon_sha256":"b3fdf3e078c87f64074944a01f44dc6b0676152edc036b9c3c42a03920e98ddf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:41.291960Z","signature_b64":"dfnfvPqwSElSAJbb85jd0bx8/sT4/+dMWF6PsDqS0jkbUaKTtByjzopGeg+cuNn/TKhYZ8OScQOVPk/YlDDNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f34c242a544d4e9a6a952cf29fbe0b61f7d055db606f16bedd82f7350d7a8ed8","last_reissued_at":"2026-07-05T09:47:41.291495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:41.291495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dirichlet-Neumann Averaging: The DNA of Efficient Gaussian Process Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR","stat.ME"],"primary_cat":"stat.CO","authors_text":"2), 2) ((1) Institute for Mathematics, (2) Interdisciplinary Center for Scientific Computing (IWR), Heidelberg, Heidelberg), Robert Kutri (1, Robert Scheichl (1","submitted_at":"2024-12-10T21:18:08Z","abstract_excerpt":"Gaussian processes (GPs) and Gaussian random fields (GRFs) are essential for modelling spatially varying stochastic phenomena. Yet, the efficient generation of corresponding realisations on high-resolution grids remains challenging, particularly when a large number of realisations are required. This paper presents two novel contributions. First, we propose a new methodology based on Dirichlet-Neumann averaging (DNA) to generate GPs and GRFs with isotropic covariance on regularly spaced grids. The combination of discrete cosine and sine transforms in the DNA sampling approach allows for rapid e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07929","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.07929/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.07929","created_at":"2026-07-05T09:47:41.291554+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07929v1","created_at":"2026-07-05T09:47:41.291554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07929","created_at":"2026-07-05T09:47:41.291554+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NGCIKSUJVHJ","created_at":"2026-07-05T09:47:41.291554+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NGCIKSUJVHJU2UV","created_at":"2026-07-05T09:47:41.291554+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NGCIKSU","created_at":"2026-07-05T09:47:41.291554+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02647","citing_title":"Multilevel Stochastic Gradient Descent for Optimal Control Under Uncertainty","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH","json":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH.json","graph_json":"https://pith.science/api/pith-number/6NGCIKSUJVHJU2UVFTZJ7PQLMH/graph.json","events_json":"https://pith.science/api/pith-number/6NGCIKSUJVHJU2UVFTZJ7PQLMH/events.json","paper":"https://pith.science/paper/6NGCIKSU"},"agent_actions":{"view_html":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH","download_json":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH.json","view_paper":"https://pith.science/paper/6NGCIKSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07929&json=true","fetch_graph":"https://pith.science/api/pith-number/6NGCIKSUJVHJU2UVFTZJ7PQLMH/graph.json","fetch_events":"https://pith.science/api/pith-number/6NGCIKSUJVHJU2UVFTZJ7PQLMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH/action/storage_attestation","attest_author":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH/action/author_attestation","sign_citation":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH/action/citation_signature","submit_replication":"https://pith.science/pith/6NGCIKSUJVHJU2UVFTZJ7PQLMH/action/replication_record"}},"created_at":"2026-07-05T09:47:41.291554+00:00","updated_at":"2026-07-05T09:47:41.291554+00:00"}