{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HAULIUJ3HLNHO6KSPCC7EI6ZR6","short_pith_number":"pith:HAULIUJ3","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"},"canonical_sha256":"3828b4513b3ada7779527885f223d98f96ed2d38767184c564c699a9b6ba1ff5","source":{"kind":"arxiv","id":"1711.03986","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03986","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03986v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03986","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"HAULIUJ3HLNH","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HAULIUJ3HLNHO6KS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HAULIUJ3","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HAULIUJ3HLNHO6KSPCC7EI6ZR6","target":"record","payload":{"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"},"canonical_sha256":"3828b4513b3ada7779527885f223d98f96ed2d38767184c564c699a9b6ba1ff5","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"},"source_kind":"arxiv","source_id":"1711.03986","source_version":2,"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-18T00:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajH82L6yLeqktaoQ9wLqnn3Fwx9L2VJJnWg3H4nhFJCIEAMeuuKfJ+6Xd8q1bK725xl8XgWFlce9HI27akz1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:48:11.915642Z"},"content_sha256":"d16b27de4ccac50f7d31c7aa73a9d5805d2cd16529acbc2e5ce0208cc68d24ad","schema_version":"1.0","event_id":"sha256:d16b27de4ccac50f7d31c7aa73a9d5805d2cd16529acbc2e5ce0208cc68d24ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HAULIUJ3HLNHO6KSPCC7EI6ZR6","target":"graph","payload":{"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"},"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-18T00:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/602BxcvYzSmviOEjDWVAD2cCoq5N+/6hJh2VwAz8E+thJaCX5xAQdnfGkIFpSevG7PHny0csQBPhARi7ijEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:48:11.916352Z"},"content_sha256":"16304feadb9a830c191f184c8c210c4f385b5e3d5365ec6516bf5fbc42d82721","schema_version":"1.0","event_id":"sha256:16304feadb9a830c191f184c8c210c4f385b5e3d5365ec6516bf5fbc42d82721"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/bundle.json","state_url":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/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-05-27T14:48:11Z","links":{"resolver":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6","bundle":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/bundle.json","state":"https://pith.science/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAULIUJ3HLNHO6KSPCC7EI6ZR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HAULIUJ3HLNHO6KSPCC7EI6ZR6","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":"09ec11bc7ac5953077db1e080e1717a8e194e2af178c4d7bbad0b713654d8f77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-10T19:08:56Z","title_canon_sha256":"42337788d7927b674fcdaf477cea42fa7ad87cb230e9f64ea07b3169a375bcb4"},"schema_version":"1.0","source":{"id":"1711.03986","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03986","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03986v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03986","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"HAULIUJ3HLNH","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HAULIUJ3HLNHO6KS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HAULIUJ3","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:16304feadb9a830c191f184c8c210c4f385b5e3d5365ec6516bf5fbc42d82721","target":"graph","created_at":"2026-05-18T00:07:50Z","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 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$.","authors_text":"Daniel Rudolf, David Krieg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-10T19:08:56Z","title":"Recovery algorithms for high-dimensional rank one tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03986","kind":"arxiv","version":2},"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:d16b27de4ccac50f7d31c7aa73a9d5805d2cd16529acbc2e5ce0208cc68d24ad","target":"record","created_at":"2026-05-18T00:07:50Z","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":"09ec11bc7ac5953077db1e080e1717a8e194e2af178c4d7bbad0b713654d8f77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-10T19:08:56Z","title_canon_sha256":"42337788d7927b674fcdaf477cea42fa7ad87cb230e9f64ea07b3169a375bcb4"},"schema_version":"1.0","source":{"id":"1711.03986","kind":"arxiv","version":2}},"canonical_sha256":"3828b4513b3ada7779527885f223d98f96ed2d38767184c564c699a9b6ba1ff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3828b4513b3ada7779527885f223d98f96ed2d38767184c564c699a9b6ba1ff5","first_computed_at":"2026-05-18T00:07:50.415340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:50.415340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTfKSx+T2EDDWTG9ZTi3m460zRfoU9XJo3Lj932dHdP1Kh3T3qUf7+vb6bFqNow/XvEzcV5cNWGMemyQLQhzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:50.415992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03986","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d16b27de4ccac50f7d31c7aa73a9d5805d2cd16529acbc2e5ce0208cc68d24ad","sha256:16304feadb9a830c191f184c8c210c4f385b5e3d5365ec6516bf5fbc42d82721"],"state_sha256":"aadd83d1a1128ed25b43ff0f351f097e9a31831d8e5ef184a044db7a6749f57a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89xGS8+fH01qF2cYUkczZ8vw67QS1gRGu4CvdaUm3mo3aK0DpMjjHB8loFCQqVm4yn+pRcHjeKsQXdaZtFD4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:48:11.920044Z","bundle_sha256":"1cd1974822cbd13fa3a4f716aed3dcc4ccf9cc0297a56996f762a044684f7ba7"}}