{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VPFZREW3WIWAZN2DRTNBAK3QK6","short_pith_number":"pith:VPFZREW3","canonical_record":{"source":{"id":"1304.7796","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-29T20:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"0f37598f0952ddf90dc861cf76c567db232da913ddb73d60fcee85f5b664441d","abstract_canon_sha256":"9e2ff8d12c69ea8a70b83c46b20bccc80802f290641a95b5321e3d743fa543e0"},"schema_version":"1.0"},"canonical_sha256":"abcb9892dbb22c0cb7438cda102b705790b1effde7515348edd2392c0944a3b4","source":{"kind":"arxiv","id":"1304.7796","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7796","created_at":"2026-05-18T02:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7796v2","created_at":"2026-05-18T02:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7796","created_at":"2026-05-18T02:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"VPFZREW3WIWA","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VPFZREW3WIWAZN2D","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VPFZREW3","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VPFZREW3WIWAZN2DRTNBAK3QK6","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7796","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-29T20:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"0f37598f0952ddf90dc861cf76c567db232da913ddb73d60fcee85f5b664441d","abstract_canon_sha256":"9e2ff8d12c69ea8a70b83c46b20bccc80802f290641a95b5321e3d743fa543e0"},"schema_version":"1.0"},"canonical_sha256":"abcb9892dbb22c0cb7438cda102b705790b1effde7515348edd2392c0944a3b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:21.303117Z","signature_b64":"wbLVkG1qdFfq34HCSdkle28c6cgyJw9np0hj0FReZUer6Jifyr1Yb8FhhrydC9tH9ISd4TuK3gQEN8op4Nf4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abcb9892dbb22c0cb7438cda102b705790b1effde7515348edd2392c0944a3b4","last_reissued_at":"2026-05-18T02:56:21.302531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:21.302531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7796","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-18T02:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTa1s5y/Yuzgt7C2WYVpQTivjNOYtvtf/2S/tKmTYEPSxAGGziT8ZqDZt6F+AQGeOcuwu/8mj0mR9hyRE+fzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:22:03.032337Z"},"content_sha256":"d394968d1759e2dfb8244f77929f42481ecfe2751bf0bbec6ffabe13d02abc50","schema_version":"1.0","event_id":"sha256:d394968d1759e2dfb8244f77929f42481ecfe2751bf0bbec6ffabe13d02abc50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VPFZREW3WIWAZN2DRTNBAK3QK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Near-Optimal Rank Tensor Approximation for High-Dimensional Operator Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"2) ((1) IGPM, (2) AICES, Markus Bachmayr (1), RWTH Aachen, RWTH Aachen), Wolfgang Dahmen (1","submitted_at":"2013-04-29T20:34:05Z","abstract_excerpt":"We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous convergence analysis, where all parameters required for the execution of the methods depend only on the underlying infinite-dimensional problem, but not on a concrete discretization. Under certain assumptions on the rates for the involved low-rank approximations and basis expansions, we can also give bounds on the computational complexity of the iteration as a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7796","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-18T02:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPq56joY+/3Oca9GbfCrPP43ofl5nABp35kb5/OOyTcGzMfFdIjzFCJOg+XfxwknZ7pjjgcHxCgbTf/7086xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:22:03.032999Z"},"content_sha256":"09e45cf2da62881e1adbe5a919bed03b499ec4456c2cb862b177625d3da11d2a","schema_version":"1.0","event_id":"sha256:09e45cf2da62881e1adbe5a919bed03b499ec4456c2cb862b177625d3da11d2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPFZREW3WIWAZN2DRTNBAK3QK6/bundle.json","state_url":"https://pith.science/pith/VPFZREW3WIWAZN2DRTNBAK3QK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPFZREW3WIWAZN2DRTNBAK3QK6/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-27T04:22:03Z","links":{"resolver":"https://pith.science/pith/VPFZREW3WIWAZN2DRTNBAK3QK6","bundle":"https://pith.science/pith/VPFZREW3WIWAZN2DRTNBAK3QK6/bundle.json","state":"https://pith.science/pith/VPFZREW3WIWAZN2DRTNBAK3QK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPFZREW3WIWAZN2DRTNBAK3QK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VPFZREW3WIWAZN2DRTNBAK3QK6","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":"9e2ff8d12c69ea8a70b83c46b20bccc80802f290641a95b5321e3d743fa543e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-29T20:34:05Z","title_canon_sha256":"0f37598f0952ddf90dc861cf76c567db232da913ddb73d60fcee85f5b664441d"},"schema_version":"1.0","source":{"id":"1304.7796","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7796","created_at":"2026-05-18T02:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7796v2","created_at":"2026-05-18T02:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7796","created_at":"2026-05-18T02:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"VPFZREW3WIWA","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VPFZREW3WIWAZN2D","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VPFZREW3","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:09e45cf2da62881e1adbe5a919bed03b499ec4456c2cb862b177625d3da11d2a","target":"graph","created_at":"2026-05-18T02:56:21Z","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 consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous convergence analysis, where all parameters required for the execution of the methods depend only on the underlying infinite-dimensional problem, but not on a concrete discretization. Under certain assumptions on the rates for the involved low-rank approximations and basis expansions, we can also give bounds on the computational complexity of the iteration as a ","authors_text":"2) ((1) IGPM, (2) AICES, Markus Bachmayr (1), RWTH Aachen, RWTH Aachen), Wolfgang Dahmen (1","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-29T20:34:05Z","title":"Adaptive Near-Optimal Rank Tensor Approximation for High-Dimensional Operator Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7796","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:d394968d1759e2dfb8244f77929f42481ecfe2751bf0bbec6ffabe13d02abc50","target":"record","created_at":"2026-05-18T02:56:21Z","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":"9e2ff8d12c69ea8a70b83c46b20bccc80802f290641a95b5321e3d743fa543e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-29T20:34:05Z","title_canon_sha256":"0f37598f0952ddf90dc861cf76c567db232da913ddb73d60fcee85f5b664441d"},"schema_version":"1.0","source":{"id":"1304.7796","kind":"arxiv","version":2}},"canonical_sha256":"abcb9892dbb22c0cb7438cda102b705790b1effde7515348edd2392c0944a3b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abcb9892dbb22c0cb7438cda102b705790b1effde7515348edd2392c0944a3b4","first_computed_at":"2026-05-18T02:56:21.302531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:21.302531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbLVkG1qdFfq34HCSdkle28c6cgyJw9np0hj0FReZUer6Jifyr1Yb8FhhrydC9tH9ISd4TuK3gQEN8op4Nf4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:21.303117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7796","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d394968d1759e2dfb8244f77929f42481ecfe2751bf0bbec6ffabe13d02abc50","sha256:09e45cf2da62881e1adbe5a919bed03b499ec4456c2cb862b177625d3da11d2a"],"state_sha256":"debf65e03d734d46b8b54f8c7c3d05d952569fea5a5383be5131e7f2fb2c9dc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emWAFgz6PNvyOtsaoXRdZW6qGoTqCPjj1HOeMU70OC8NdkUG4GDV1Q9B8fply/CHwMhwqAH5i8YQPuliLo39DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:22:03.036642Z","bundle_sha256":"f699cfed96f71089b133432d37816610d994c911f4eec1d9476df690fae7e765"}}