{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M2UNT6BW2DANBFKVK3TU4V4ANW","short_pith_number":"pith:M2UNT6BW","schema_version":"1.0","canonical_sha256":"66a8d9f836d0c0d0955556e74e57806db4ac4ab2f75255831d491084bc83ac6e","source":{"kind":"arxiv","id":"1402.5011","version":2},"attestation_state":"computed","paper":{"title":"Tractability of the approximation of high-dimensional rank one tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Rudolf, Erich Novak","submitted_at":"2014-02-20T14:37:49Z","abstract_excerpt":"We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this problem is intractable while for other parameters the problem is tractable and the complexity is only polynomial in the dimension for every fixed $\\varepsilon>0$. For randomized algorithms we completely characterize the set of parameters that lead to easy or difficult problems, respectively. In the \"difficult\" case we modify the class to obtain a tractable prob"},"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":"1402.5011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-20T14:37:49Z","cross_cats_sorted":[],"title_canon_sha256":"46ae1988a33dcf71b4c02a12f7c16750ee40d9102aa717149a5dbd7d6438fe3c","abstract_canon_sha256":"0584b7c88d8ee3ec551d7a2e403c62afd0e04cd56119d5fc416f17c4e4a939f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:22.376677Z","signature_b64":"Q6nqEUVYfnf8MP41vRN23C0xpw7/2u6s4YD4bWLQn/jj/1ld0a7V61hvt+ynNDQIXbs/ITLZiPeA/kW5CYLNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66a8d9f836d0c0d0955556e74e57806db4ac4ab2f75255831d491084bc83ac6e","last_reissued_at":"2026-05-18T02:32:22.376269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:22.376269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractability of the approximation of high-dimensional rank one tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Rudolf, Erich Novak","submitted_at":"2014-02-20T14:37:49Z","abstract_excerpt":"We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this problem is intractable while for other parameters the problem is tractable and the complexity is only polynomial in the dimension for every fixed $\\varepsilon>0$. For randomized algorithms we completely characterize the set of parameters that lead to easy or difficult problems, respectively. In the \"difficult\" case we modify the class to obtain a tractable prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5011","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.5011","created_at":"2026-05-18T02:32:22.376333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5011v2","created_at":"2026-05-18T02:32:22.376333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5011","created_at":"2026-05-18T02:32:22.376333+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2UNT6BW2DAN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2UNT6BW2DANBFKV","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2UNT6BW","created_at":"2026-05-18T12:28:38.356838+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/M2UNT6BW2DANBFKVK3TU4V4ANW","json":"https://pith.science/pith/M2UNT6BW2DANBFKVK3TU4V4ANW.json","graph_json":"https://pith.science/api/pith-number/M2UNT6BW2DANBFKVK3TU4V4ANW/graph.json","events_json":"https://pith.science/api/pith-number/M2UNT6BW2DANBFKVK3TU4V4ANW/events.json","paper":"https://pith.science/paper/M2UNT6BW"},"agent_actions":{"view_html":"https://pith.science/pith/M2UNT6BW2DANBFKVK3TU4V4ANW","download_json":"https://pith.science/pith/M2UNT6BW2DANBFKVK3TU4V4ANW.json","view_paper":"https://pith.science/paper/M2UNT6BW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5011&json=true","fetch_graph":"https://pith.science/api/pith-number/M2UNT6BW2DANBFKVK3TU4V4ANW/graph.json","fetch_events":"https://pith.science/api/pith-number/M2UNT6BW2DANBFKVK3TU4V4ANW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2UNT6BW2DANBFKVK3TU4V4ANW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2UNT6BW2DANBFKVK3TU4V4ANW/action/storage_attestation","attest_author":"https://pith.science/pith/M2UNT6BW2DANBFKVK3TU4V4ANW/action/author_attestation","sign_citation":"https://pith.science/pith/M2UNT6BW2DANBFKVK3TU4V4ANW/action/citation_signature","submit_replication":"https://pith.science/pith/M2UNT6BW2DANBFKVK3TU4V4ANW/action/replication_record"}},"created_at":"2026-05-18T02:32:22.376333+00:00","updated_at":"2026-05-18T02:32:22.376333+00:00"}