{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H632NTESPKFTV7KG526LTTKKHC","short_pith_number":"pith:H632NTES","canonical_record":{"source":{"id":"1406.7026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-06-26T20:57:09Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"9b1bb00ca96ad49be005c1c1f7981f118fb53e974511d90ce50edd587a795443","abstract_canon_sha256":"3e581773700f0d419ed427b26e337867ef3ffc41dbc6646231505fec20943562"},"schema_version":"1.0"},"canonical_sha256":"3fb7a6cc927a8b3afd46eebcb9cd4a3886534c16c98649618f8cbc454dd7c985","source":{"kind":"arxiv","id":"1406.7026","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7026","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7026v3","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7026","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"H632NTESPKFT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H632NTESPKFTV7KG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H632NTES","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H632NTESPKFTV7KG526LTTKKHC","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-06-26T20:57:09Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"9b1bb00ca96ad49be005c1c1f7981f118fb53e974511d90ce50edd587a795443","abstract_canon_sha256":"3e581773700f0d419ed427b26e337867ef3ffc41dbc6646231505fec20943562"},"schema_version":"1.0"},"canonical_sha256":"3fb7a6cc927a8b3afd46eebcb9cd4a3886534c16c98649618f8cbc454dd7c985","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:16.865307Z","signature_b64":"9kp/PiKyLytbP4IzDv74lRLalC+piHRD3DVrdzx+7tJGX84p6/LJYTjJlzYvOHBQhngxLqYUSS2aLk8XN+6mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb7a6cc927a8b3afd46eebcb9cd4a3886534c16c98649618f8cbc454dd7c985","last_reissued_at":"2026-05-18T01:23:16.864535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:16.864535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7026","source_version":3,"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-18T01:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ge0FJoyFHtmKgaI/1IyiGWZUGJ37WYAE02tlth1UL0nyCm8LXhxfCoCZkg2CBmGxUK4B0lSxuiNKWk132ukNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:31:42.881455Z"},"content_sha256":"d6d34a62a5ab1d53f932fdd7c69defc0324d45afbac9663804dd9727362b8ade","schema_version":"1.0","event_id":"sha256:d6d34a62a5ab1d53f932fdd7c69defc0324d45afbac9663804dd9727362b8ade"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H632NTESPKFTV7KG526LTTKKHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.NA","authors_text":"Andr\\'e Uschmajew, Daniel Kressner","submitted_at":"2014-06-26T20:57:09Z","abstract_excerpt":"Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems and eigenvalue problems on Hilbert spaces. Although this question is central to the success of all existing solvers based on low-rank tensor techniques, very few of the results available so far allow to draw meaningful conclusions for higher dimensions. In this work, we develop a constructive framework to study low-rank approximability. One major assumption "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7026","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"},"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-18T01:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gFbXhHBVoWg98KhzHjnfA/n4qJbCjAABWO8HpqLQfB5XadhFA8THl/bo/9DMf5aZm6CxKzZ41JvgUn0NiKb+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:31:42.882243Z"},"content_sha256":"58df58afb6320276640e16f9592cd55e3982df3c781bd8aaa59e2582414e2db8","schema_version":"1.0","event_id":"sha256:58df58afb6320276640e16f9592cd55e3982df3c781bd8aaa59e2582414e2db8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H632NTESPKFTV7KG526LTTKKHC/bundle.json","state_url":"https://pith.science/pith/H632NTESPKFTV7KG526LTTKKHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H632NTESPKFTV7KG526LTTKKHC/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-31T13:31:42Z","links":{"resolver":"https://pith.science/pith/H632NTESPKFTV7KG526LTTKKHC","bundle":"https://pith.science/pith/H632NTESPKFTV7KG526LTTKKHC/bundle.json","state":"https://pith.science/pith/H632NTESPKFTV7KG526LTTKKHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H632NTESPKFTV7KG526LTTKKHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H632NTESPKFTV7KG526LTTKKHC","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":"3e581773700f0d419ed427b26e337867ef3ffc41dbc6646231505fec20943562","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-06-26T20:57:09Z","title_canon_sha256":"9b1bb00ca96ad49be005c1c1f7981f118fb53e974511d90ce50edd587a795443"},"schema_version":"1.0","source":{"id":"1406.7026","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7026","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7026v3","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7026","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"H632NTESPKFT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H632NTESPKFTV7KG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H632NTES","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:58df58afb6320276640e16f9592cd55e3982df3c781bd8aaa59e2582414e2db8","target":"graph","created_at":"2026-05-18T01:23:16Z","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":"Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems and eigenvalue problems on Hilbert spaces. Although this question is central to the success of all existing solvers based on low-rank tensor techniques, very few of the results available so far allow to draw meaningful conclusions for higher dimensions. In this work, we develop a constructive framework to study low-rank approximability. One major assumption ","authors_text":"Andr\\'e Uschmajew, Daniel Kressner","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-06-26T20:57:09Z","title":"On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7026","kind":"arxiv","version":3},"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:d6d34a62a5ab1d53f932fdd7c69defc0324d45afbac9663804dd9727362b8ade","target":"record","created_at":"2026-05-18T01:23:16Z","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":"3e581773700f0d419ed427b26e337867ef3ffc41dbc6646231505fec20943562","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-06-26T20:57:09Z","title_canon_sha256":"9b1bb00ca96ad49be005c1c1f7981f118fb53e974511d90ce50edd587a795443"},"schema_version":"1.0","source":{"id":"1406.7026","kind":"arxiv","version":3}},"canonical_sha256":"3fb7a6cc927a8b3afd46eebcb9cd4a3886534c16c98649618f8cbc454dd7c985","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fb7a6cc927a8b3afd46eebcb9cd4a3886534c16c98649618f8cbc454dd7c985","first_computed_at":"2026-05-18T01:23:16.864535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:16.864535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kp/PiKyLytbP4IzDv74lRLalC+piHRD3DVrdzx+7tJGX84p6/LJYTjJlzYvOHBQhngxLqYUSS2aLk8XN+6mBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:16.865307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7026","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6d34a62a5ab1d53f932fdd7c69defc0324d45afbac9663804dd9727362b8ade","sha256:58df58afb6320276640e16f9592cd55e3982df3c781bd8aaa59e2582414e2db8"],"state_sha256":"0fb0e1bc0c4cf49dec461c299b8dd54e7c376d485a55a8cf774dbe8c58e9a81f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXLKySt0w6OApjhcW8NM6ZnRk2wZ1a/w66G1PYzmwyV1LlPUxW/3siGl+w5ZT4I1pSbUkhjfULQWDUaKZHuxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:31:42.884517Z","bundle_sha256":"91da62dc68eb393e856af7b8e89110afcfbe64fe807c0d215e378f83a7d47579"}}