{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4MWPJZF5CWT5PQBDM6VHTZPKTF","short_pith_number":"pith:4MWPJZF5","schema_version":"1.0","canonical_sha256":"e32cf4e4bd15a7d7c02367aa79e5ea995dd1428c42d170f467c17cf714672106","source":{"kind":"arxiv","id":"1409.5423","version":1},"attestation_state":"computed","paper":{"title":"A trivariate interpolation algorithm using a cube-partition searching procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alessandra De Rossi, Roberto Cavoretto","submitted_at":"2014-09-18T19:46:16Z","abstract_excerpt":"In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported weight functions. The partition of unity algorithm is efficiently implemented and optimized by connecting the method with an effective cube-partition searching procedure. More precisely, we construct a cube structure, which partitions the domain and strictly depends on the size of its subdomains, so that the new searching procedure and, accordingly, the resul"},"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":"1409.5423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-09-18T19:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"81f998c84c5528fb41d68892d949ef24768b7b229a1e9f1531f9d9015a9e62a9","abstract_canon_sha256":"d31cb7ec3962f240151120d73f0da9ac0595b146973d68cdfbc624c6f4aca9c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:59.358021Z","signature_b64":"zRD5ZmwiWr4TSca11gkXJj9mIRLExxm5uDlOg2vBOJm7sJZBDq+1iywMAomtTEyLpErvCyMn2npnmJN0w9tVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e32cf4e4bd15a7d7c02367aa79e5ea995dd1428c42d170f467c17cf714672106","last_reissued_at":"2026-05-18T01:29:59.357415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:59.357415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A trivariate interpolation algorithm using a cube-partition searching procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alessandra De Rossi, Roberto Cavoretto","submitted_at":"2014-09-18T19:46:16Z","abstract_excerpt":"In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported weight functions. The partition of unity algorithm is efficiently implemented and optimized by connecting the method with an effective cube-partition searching procedure. More precisely, we construct a cube structure, which partitions the domain and strictly depends on the size of its subdomains, so that the new searching procedure and, accordingly, the resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5423","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.5423","created_at":"2026-05-18T01:29:59.357514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5423v1","created_at":"2026-05-18T01:29:59.357514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5423","created_at":"2026-05-18T01:29:59.357514+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MWPJZF5CWT5","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MWPJZF5CWT5PQBD","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MWPJZF5","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF","json":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF.json","graph_json":"https://pith.science/api/pith-number/4MWPJZF5CWT5PQBDM6VHTZPKTF/graph.json","events_json":"https://pith.science/api/pith-number/4MWPJZF5CWT5PQBDM6VHTZPKTF/events.json","paper":"https://pith.science/paper/4MWPJZF5"},"agent_actions":{"view_html":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF","download_json":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF.json","view_paper":"https://pith.science/paper/4MWPJZF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5423&json=true","fetch_graph":"https://pith.science/api/pith-number/4MWPJZF5CWT5PQBDM6VHTZPKTF/graph.json","fetch_events":"https://pith.science/api/pith-number/4MWPJZF5CWT5PQBDM6VHTZPKTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF/action/storage_attestation","attest_author":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF/action/author_attestation","sign_citation":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF/action/citation_signature","submit_replication":"https://pith.science/pith/4MWPJZF5CWT5PQBDM6VHTZPKTF/action/replication_record"}},"created_at":"2026-05-18T01:29:59.357514+00:00","updated_at":"2026-05-18T01:29:59.357514+00:00"}