{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DV7EHCCAKKNPPT3I32V3CPEHTD","short_pith_number":"pith:DV7EHCCA","canonical_record":{"source":{"id":"1905.00141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-04-30T23:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"4cbe3e8b950afd0e28ee10426a0d179789e60a40c169f6b0cdc74904d90821c1","abstract_canon_sha256":"88546e9007679c06193b9a63f773a45f2e0869517b39d46949b065329de45582"},"schema_version":"1.0"},"canonical_sha256":"1d7e438840529af7cf68deabb13c8798ca2dfb20be5608a1f6cc673e75cfc4a5","source":{"kind":"arxiv","id":"1905.00141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00141","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00141v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00141","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"DV7EHCCAKKNP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DV7EHCCAKKNPPT3I","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DV7EHCCA","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DV7EHCCAKKNPPT3I32V3CPEHTD","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-04-30T23:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"4cbe3e8b950afd0e28ee10426a0d179789e60a40c169f6b0cdc74904d90821c1","abstract_canon_sha256":"88546e9007679c06193b9a63f773a45f2e0869517b39d46949b065329de45582"},"schema_version":"1.0"},"canonical_sha256":"1d7e438840529af7cf68deabb13c8798ca2dfb20be5608a1f6cc673e75cfc4a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:01.197604Z","signature_b64":"JRK4BZpCczxxVxf/LHfE2jbVy4F8nWTCI1X3qsKKgo0kaohN+EXrghBRCdLOZdU1ASRBb++HygZxP++G4xBrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7e438840529af7cf68deabb13c8798ca2dfb20be5608a1f6cc673e75cfc4a5","last_reissued_at":"2026-05-17T23:47:01.197066Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:01.197066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00141","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEcphj41OAOexdsSLqqgZw/QIbBm38KG+tpUexSE+5VERPSQ1qlVdsFuCB5qpQdkrniFnD+CEiRO/gIPb3HuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:31.234061Z"},"content_sha256":"466556a1c8754d1a87681627a2784f60ac4e0e93c375a318bb2d677c57fe7df6","schema_version":"1.0","event_id":"sha256:466556a1c8754d1a87681627a2784f60ac4e0e93c375a318bb2d677c57fe7df6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DV7EHCCAKKNPPT3I32V3CPEHTD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pushing the Limit: A Hybrid Parallel Implementation of the Multi-resolution Approximation for Massive Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Dorit M. Hammerling, Huang Huang, Lewis R. Blake","submitted_at":"2019-04-30T23:52:54Z","abstract_excerpt":"The multi-resolution approximation (MRA) of Gaussian processes was recently proposed to conduct likelihood-based inference for massive spatial data sets. An advantage of the methodology is that it can be parallelized. We implemented the MRA in C++ for both serial and parallel versions. In the parallel implementation, we use a hybrid parallelism that employs both distributed and shared memory computing for communications between and within nodes by using the Message Passing Interface (MPI) and OpenMP, respectively. The performance of the serial code is compared between the C++ and MATLAB implem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00141","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VS94Z8OkVOkXApryvfUXLAYsNkkLvuzhjFRoMx90nZ7XSeC+tXuez7lA4EVSXrKR6UfX6ScDApeiN8NvZE7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:31.234744Z"},"content_sha256":"b1a715f29c426cb6d99cd667434696afb08258cff911dea8dd65272a3e525fe5","schema_version":"1.0","event_id":"sha256:b1a715f29c426cb6d99cd667434696afb08258cff911dea8dd65272a3e525fe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DV7EHCCAKKNPPT3I32V3CPEHTD/bundle.json","state_url":"https://pith.science/pith/DV7EHCCAKKNPPT3I32V3CPEHTD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DV7EHCCAKKNPPT3I32V3CPEHTD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T08:53:31Z","links":{"resolver":"https://pith.science/pith/DV7EHCCAKKNPPT3I32V3CPEHTD","bundle":"https://pith.science/pith/DV7EHCCAKKNPPT3I32V3CPEHTD/bundle.json","state":"https://pith.science/pith/DV7EHCCAKKNPPT3I32V3CPEHTD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DV7EHCCAKKNPPT3I32V3CPEHTD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DV7EHCCAKKNPPT3I32V3CPEHTD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"88546e9007679c06193b9a63f773a45f2e0869517b39d46949b065329de45582","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-04-30T23:52:54Z","title_canon_sha256":"4cbe3e8b950afd0e28ee10426a0d179789e60a40c169f6b0cdc74904d90821c1"},"schema_version":"1.0","source":{"id":"1905.00141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00141","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00141v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00141","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"DV7EHCCAKKNP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DV7EHCCAKKNPPT3I","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DV7EHCCA","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:b1a715f29c426cb6d99cd667434696afb08258cff911dea8dd65272a3e525fe5","target":"graph","created_at":"2026-05-17T23:47:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The multi-resolution approximation (MRA) of Gaussian processes was recently proposed to conduct likelihood-based inference for massive spatial data sets. An advantage of the methodology is that it can be parallelized. We implemented the MRA in C++ for both serial and parallel versions. In the parallel implementation, we use a hybrid parallelism that employs both distributed and shared memory computing for communications between and within nodes by using the Message Passing Interface (MPI) and OpenMP, respectively. The performance of the serial code is compared between the C++ and MATLAB implem","authors_text":"Dorit M. Hammerling, Huang Huang, Lewis R. Blake","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-04-30T23:52:54Z","title":"Pushing the Limit: A Hybrid Parallel Implementation of the Multi-resolution Approximation for Massive Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00141","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:466556a1c8754d1a87681627a2784f60ac4e0e93c375a318bb2d677c57fe7df6","target":"record","created_at":"2026-05-17T23:47:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"88546e9007679c06193b9a63f773a45f2e0869517b39d46949b065329de45582","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-04-30T23:52:54Z","title_canon_sha256":"4cbe3e8b950afd0e28ee10426a0d179789e60a40c169f6b0cdc74904d90821c1"},"schema_version":"1.0","source":{"id":"1905.00141","kind":"arxiv","version":2}},"canonical_sha256":"1d7e438840529af7cf68deabb13c8798ca2dfb20be5608a1f6cc673e75cfc4a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d7e438840529af7cf68deabb13c8798ca2dfb20be5608a1f6cc673e75cfc4a5","first_computed_at":"2026-05-17T23:47:01.197066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:01.197066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JRK4BZpCczxxVxf/LHfE2jbVy4F8nWTCI1X3qsKKgo0kaohN+EXrghBRCdLOZdU1ASRBb++HygZxP++G4xBrAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:01.197604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:466556a1c8754d1a87681627a2784f60ac4e0e93c375a318bb2d677c57fe7df6","sha256:b1a715f29c426cb6d99cd667434696afb08258cff911dea8dd65272a3e525fe5"],"state_sha256":"6f61f97171bdc970f6942d25fd66d4fbc3782a766a8a9f0c14a7931d823e095b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SqriqGmkWNVumiv6BeOUk0kH9VwVPLjt4isAYLBeiVzTKzcI4vLUcs4hkUHlKLzTsFd5Xr4PMo6TX+kGubDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:53:31.238158Z","bundle_sha256":"cb735c2dad8a285cfd24bd9dcd1c0cd863e7cdb5a4c9a8de2999ddead7585e7d"}}