{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D5PMEA6UPX7O67D4RRNYN6SPGA","short_pith_number":"pith:D5PMEA6U","schema_version":"1.0","canonical_sha256":"1f5ec203d47dfeef7c7c8c5b86fa4f303889d820c8b0f6d89b7d78776539f508","source":{"kind":"arxiv","id":"1609.00246","version":3},"attestation_state":"computed","paper":{"title":"Sparse approximation of multilinear problems with applications to kernel-based methods in UQ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Fabio Nobile, Raul Tempone, Soeren Wolfers","submitted_at":"2016-09-01T14:08:49Z","abstract_excerpt":"We provide a framework for the sparse approximation of multilinear problems and show that several problems in uncertainty quantification fit within this framework. In these problems, the value of a multilinear map has to be approximated using approximations of different accuracy and computational work of the arguments of this map. We propose and analyze a generalized version of Smolyak's algorithm, which provides sparse approximation formulas with convergence rates that mitigate the curse of dimension that appears in multilinear approximation problems with a large number of arguments. We apply"},"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":"1609.00246","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-01T14:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"1f90ac8734b12f373802d78c15dc30089e0cf829c93ac712d10de5a725ae988d","abstract_canon_sha256":"34202c9fc5508c48e05e98b77a76739bf17252eb26bc4e171b862b90e2a548aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.120296Z","signature_b64":"8imxWJDszu1qB5z2GU6IxkrTdbCTG+KiaGb13ZCzCW47H4JgBJePvDZJGIPZ/yZIZI+kb5uPrWKC15WGc/6rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f5ec203d47dfeef7c7c8c5b86fa4f303889d820c8b0f6d89b7d78776539f508","last_reissued_at":"2026-05-18T00:10:48.119640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.119640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse approximation of multilinear problems with applications to kernel-based methods in UQ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Fabio Nobile, Raul Tempone, Soeren Wolfers","submitted_at":"2016-09-01T14:08:49Z","abstract_excerpt":"We provide a framework for the sparse approximation of multilinear problems and show that several problems in uncertainty quantification fit within this framework. In these problems, the value of a multilinear map has to be approximated using approximations of different accuracy and computational work of the arguments of this map. We propose and analyze a generalized version of Smolyak's algorithm, which provides sparse approximation formulas with convergence rates that mitigate the curse of dimension that appears in multilinear approximation problems with a large number of arguments. We apply"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00246","kind":"arxiv","version":3},"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":"1609.00246","created_at":"2026-05-18T00:10:48.119732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00246v3","created_at":"2026-05-18T00:10:48.119732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00246","created_at":"2026-05-18T00:10:48.119732+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5PMEA6UPX7O","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5PMEA6UPX7O67D4","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5PMEA6U","created_at":"2026-05-18T12:30:09.641336+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/D5PMEA6UPX7O67D4RRNYN6SPGA","json":"https://pith.science/pith/D5PMEA6UPX7O67D4RRNYN6SPGA.json","graph_json":"https://pith.science/api/pith-number/D5PMEA6UPX7O67D4RRNYN6SPGA/graph.json","events_json":"https://pith.science/api/pith-number/D5PMEA6UPX7O67D4RRNYN6SPGA/events.json","paper":"https://pith.science/paper/D5PMEA6U"},"agent_actions":{"view_html":"https://pith.science/pith/D5PMEA6UPX7O67D4RRNYN6SPGA","download_json":"https://pith.science/pith/D5PMEA6UPX7O67D4RRNYN6SPGA.json","view_paper":"https://pith.science/paper/D5PMEA6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00246&json=true","fetch_graph":"https://pith.science/api/pith-number/D5PMEA6UPX7O67D4RRNYN6SPGA/graph.json","fetch_events":"https://pith.science/api/pith-number/D5PMEA6UPX7O67D4RRNYN6SPGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5PMEA6UPX7O67D4RRNYN6SPGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5PMEA6UPX7O67D4RRNYN6SPGA/action/storage_attestation","attest_author":"https://pith.science/pith/D5PMEA6UPX7O67D4RRNYN6SPGA/action/author_attestation","sign_citation":"https://pith.science/pith/D5PMEA6UPX7O67D4RRNYN6SPGA/action/citation_signature","submit_replication":"https://pith.science/pith/D5PMEA6UPX7O67D4RRNYN6SPGA/action/replication_record"}},"created_at":"2026-05-18T00:10:48.119732+00:00","updated_at":"2026-05-18T00:10:48.119732+00:00"}