{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:2ZFSYB3SXAJEFEUIC6BVHVIEOS","short_pith_number":"pith:2ZFSYB3S","canonical_record":{"source":{"id":"0909.5413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2009-09-29T19:27:51Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"11bef1ab8448ae1cc28532db67e794f5f73e3385c6ab01a974b2ad654b068130","abstract_canon_sha256":"2115ce6398183a1f0143ea910db5ebf8fba274147488a6144013efef509c09ea"},"schema_version":"1.0"},"canonical_sha256":"d64b2c0772b812429288178353d50474bab642f01f3f1e75d4e4ddf0f5ecc82f","source":{"kind":"arxiv","id":"0909.5413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.5413","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"0909.5413v1","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.5413","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"2ZFSYB3SXAJE","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2ZFSYB3SXAJEFEUI","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2ZFSYB3S","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:2ZFSYB3SXAJEFEUIC6BVHVIEOS","target":"record","payload":{"canonical_record":{"source":{"id":"0909.5413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2009-09-29T19:27:51Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"11bef1ab8448ae1cc28532db67e794f5f73e3385c6ab01a974b2ad654b068130","abstract_canon_sha256":"2115ce6398183a1f0143ea910db5ebf8fba274147488a6144013efef509c09ea"},"schema_version":"1.0"},"canonical_sha256":"d64b2c0772b812429288178353d50474bab642f01f3f1e75d4e4ddf0f5ecc82f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:44.965806Z","signature_b64":"VAHZxVSfJT7UnuyjE0sxdefG5Z+Z+K31PjWBcEy7RSDAu8BT1LQo2rwCczGR6GTN58q2vp13fGqVDKWjbkXmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d64b2c0772b812429288178353d50474bab642f01f3f1e75d4e4ddf0f5ecc82f","last_reissued_at":"2026-05-18T04:12:44.965094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:44.965094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.5413","source_version":1,"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-18T04:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BneHJLbGzPfdT8iIoCsnVzhQHiwS5sr1osH8cTZFIZua77BjR3bCRzbA+gQzfJI62dmV0h6WrE+6xNx2vP4DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:22:18.426888Z"},"content_sha256":"37ce4f8a95057254192f01165c3b61645d4d2044a74e9ce654aab5f2e2da4ef4","schema_version":"1.0","event_id":"sha256:37ce4f8a95057254192f01165c3b61645d4d2044a74e9ce654aab5f2e2da4ef4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:2ZFSYB3SXAJEFEUIC6BVHVIEOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PetRBF--A parallel O(N) algorithm for radial basis function interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA"],"primary_cat":"cs.MS","authors_text":"L. A. Barba, Matthew G. Knepley, Rio Yokota","submitted_at":"2009-09-29T19:27:51Z","abstract_excerpt":"We have developed a parallel algorithm for radial basis function (RBF) interpolation that exhibits O(N) complexity,requires O(N) storage, and scales excellently up to a thousand processes. The algorithm uses a GMRES iterative solver with a restricted additive Schwarz method (RASM) as a preconditioner and a fast matrix-vector algorithm. Previous fast RBF methods, --,achieving at most O(NlogN) complexity,--, were developed using multiquadric and polyharmonic basis functions. In contrast, the present method uses Gaussians with a small variance (a common choice in particle methods for fluid simula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.5413","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":""},"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-18T04:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JI9nDCMAjf3Auty6sNz+3t12pB8TENWV84dkDRMadAPlP8cW9hcfnT47HCYd1rHrH8bPw1Tt8rcfiEqJTMqvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:22:18.427238Z"},"content_sha256":"194c53602fb247886153e7602ddb1962d5bc1a45378e649b00883558a0b24d77","schema_version":"1.0","event_id":"sha256:194c53602fb247886153e7602ddb1962d5bc1a45378e649b00883558a0b24d77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZFSYB3SXAJEFEUIC6BVHVIEOS/bundle.json","state_url":"https://pith.science/pith/2ZFSYB3SXAJEFEUIC6BVHVIEOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZFSYB3SXAJEFEUIC6BVHVIEOS/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-06-01T08:22:18Z","links":{"resolver":"https://pith.science/pith/2ZFSYB3SXAJEFEUIC6BVHVIEOS","bundle":"https://pith.science/pith/2ZFSYB3SXAJEFEUIC6BVHVIEOS/bundle.json","state":"https://pith.science/pith/2ZFSYB3SXAJEFEUIC6BVHVIEOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZFSYB3SXAJEFEUIC6BVHVIEOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:2ZFSYB3SXAJEFEUIC6BVHVIEOS","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":"2115ce6398183a1f0143ea910db5ebf8fba274147488a6144013efef509c09ea","cross_cats_sorted":["cs.DC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2009-09-29T19:27:51Z","title_canon_sha256":"11bef1ab8448ae1cc28532db67e794f5f73e3385c6ab01a974b2ad654b068130"},"schema_version":"1.0","source":{"id":"0909.5413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.5413","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"0909.5413v1","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.5413","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"2ZFSYB3SXAJE","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2ZFSYB3SXAJEFEUI","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2ZFSYB3S","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:194c53602fb247886153e7602ddb1962d5bc1a45378e649b00883558a0b24d77","target":"graph","created_at":"2026-05-18T04:12:44Z","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":"We have developed a parallel algorithm for radial basis function (RBF) interpolation that exhibits O(N) complexity,requires O(N) storage, and scales excellently up to a thousand processes. The algorithm uses a GMRES iterative solver with a restricted additive Schwarz method (RASM) as a preconditioner and a fast matrix-vector algorithm. Previous fast RBF methods, --,achieving at most O(NlogN) complexity,--, were developed using multiquadric and polyharmonic basis functions. In contrast, the present method uses Gaussians with a small variance (a common choice in particle methods for fluid simula","authors_text":"L. A. Barba, Matthew G. Knepley, Rio Yokota","cross_cats":["cs.DC","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2009-09-29T19:27:51Z","title":"PetRBF--A parallel O(N) algorithm for radial basis function interpolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.5413","kind":"arxiv","version":1},"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:37ce4f8a95057254192f01165c3b61645d4d2044a74e9ce654aab5f2e2da4ef4","target":"record","created_at":"2026-05-18T04:12:44Z","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":"2115ce6398183a1f0143ea910db5ebf8fba274147488a6144013efef509c09ea","cross_cats_sorted":["cs.DC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2009-09-29T19:27:51Z","title_canon_sha256":"11bef1ab8448ae1cc28532db67e794f5f73e3385c6ab01a974b2ad654b068130"},"schema_version":"1.0","source":{"id":"0909.5413","kind":"arxiv","version":1}},"canonical_sha256":"d64b2c0772b812429288178353d50474bab642f01f3f1e75d4e4ddf0f5ecc82f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d64b2c0772b812429288178353d50474bab642f01f3f1e75d4e4ddf0f5ecc82f","first_computed_at":"2026-05-18T04:12:44.965094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:44.965094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VAHZxVSfJT7UnuyjE0sxdefG5Z+Z+K31PjWBcEy7RSDAu8BT1LQo2rwCczGR6GTN58q2vp13fGqVDKWjbkXmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:44.965806Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.5413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37ce4f8a95057254192f01165c3b61645d4d2044a74e9ce654aab5f2e2da4ef4","sha256:194c53602fb247886153e7602ddb1962d5bc1a45378e649b00883558a0b24d77"],"state_sha256":"3ce038ed74aaec5cb577738bfb0657e67d62532453949e13773ed64668fbfea1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5lJUzPYst8/0gHhHtIu8COs0c60irkk7cE4jjkO3vb8qHUwQMPu82KavSkt5RBHc6bE5jrdIu3KuDnJkJnkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:22:18.429331Z","bundle_sha256":"366d1f743bc894494143e175912341a3bf600d674becd4e9e353e1b7ec0877ef"}}