{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HAULIUJ3HLNHO6KSPCC7EI6ZR6","short_pith_number":"pith:HAULIUJ3","schema_version":"1.0","canonical_sha256":"3828b4513b3ada7779527885f223d98f96ed2d38767184c564c699a9b6ba1ff5","source":{"kind":"arxiv","id":"1711.03986","version":2},"attestation_state":"computed","paper":{"title":"Recovery algorithms for 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, David Krieg","submitted_at":"2017-11-10T19:08:56Z","abstract_excerpt":"We present deterministic algorithms for the uniform recovery of $d$-variate rank one tensors from function values. These tensors are given as product of $d$ univariate functions whose $r$th weak derivative is bounded by $M$. The recovery problem is known to suffer from the curse of dimensionality for $M\\geq 2^r r!$. For smaller $M$, a randomized algorithm is known which breaks the curse. We construct a deterministic algorithm which is even less costly. In fact, we completely characterize the tractability of this problem by three different ranges of the parameter $M$."},"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":"1711.03986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-10T19:08:56Z","cross_cats_sorted":[],"title_canon_sha256":"42337788d7927b674fcdaf477cea42fa7ad87cb230e9f64ea07b3169a375bcb4","abstract_canon_sha256":"09ec11bc7ac5953077db1e080e1717a8e194e2af178c4d7bbad0b713654d8f77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:50.415992Z","signature_b64":"PTfKSx+T2EDDWTG9ZTi3m460zRfoU9XJo3Lj932dHdP1Kh3T3qUf7+vb6bFqNow/XvEzcV5cNWGMemyQLQhzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3828b4513b3ada7779527885f223d98f96ed2d38767184c564c699a9b6ba1ff5","last_reissued_at":"2026-05-18T00:07:50.415340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:50.415340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovery algorithms for 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, David Krieg","submitted_at":"2017-11-10T19:08:56Z","abstract_excerpt":"We present deterministic algorithms for the uniform recovery of $d$-variate rank one tensors from function values. These tensors are given as product of $d$ univariate functions whose $r$th weak derivative is bounded by $M$. The recovery problem is known to suffer from the curse of dimensionality for $M\\geq 2^r r!$. For smaller $M$, a randomized algorithm is known which breaks the curse. We construct a deterministic algorithm which is even less costly. In fact, we completely characterize the tractability of this problem by three different ranges of the parameter $M$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03986","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":"1711.03986","created_at":"2026-05-18T00:07:50.415458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03986v2","created_at":"2026-05-18T00:07:50.415458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03986","created_at":"2026-05-18T00:07:50.415458+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAULIUJ3HLNH","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAULIUJ3HLNHO6KS","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAULIUJ3","created_at":"2026-05-18T12:31:18.294218+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/HAULIUJ3HLNHO6KSPCC7EI6ZR6","json":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6.json","graph_json":"https://pith.science/api/pith-number/HAULIUJ3HLNHO6KSPCC7EI6ZR6/graph.json","events_json":"https://pith.science/api/pith-number/HAULIUJ3HLNHO6KSPCC7EI6ZR6/events.json","paper":"https://pith.science/paper/HAULIUJ3"},"agent_actions":{"view_html":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6","download_json":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6.json","view_paper":"https://pith.science/paper/HAULIUJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03986&json=true","fetch_graph":"https://pith.science/api/pith-number/HAULIUJ3HLNHO6KSPCC7EI6ZR6/graph.json","fetch_events":"https://pith.science/api/pith-number/HAULIUJ3HLNHO6KSPCC7EI6ZR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/action/storage_attestation","attest_author":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/action/author_attestation","sign_citation":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/action/citation_signature","submit_replication":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/action/replication_record"}},"created_at":"2026-05-18T00:07:50.415458+00:00","updated_at":"2026-05-18T00:07:50.415458+00:00"}