{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QYLGF6ZQ257BU67BS2SF5TI6TC","short_pith_number":"pith:QYLGF6ZQ","canonical_record":{"source":{"id":"1304.6126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-22T22:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"739c5a3b2b00533a693f7aa93a082349e13332226101dd8db0fcce2b53e93c31","abstract_canon_sha256":"666052b97e37168a4dba8afc4b34318080abb6836786b3d647a519d3d0c222e3"},"schema_version":"1.0"},"canonical_sha256":"861662fb30d77e1a7be196a45ecd1e9899b70434d3fdb9841dfbb8e3cb12af68","source":{"kind":"arxiv","id":"1304.6126","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6126","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6126v2","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6126","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"pith_short_12","alias_value":"QYLGF6ZQ257B","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QYLGF6ZQ257BU67B","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QYLGF6ZQ","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QYLGF6ZQ257BU67BS2SF5TI6TC","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-22T22:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"739c5a3b2b00533a693f7aa93a082349e13332226101dd8db0fcce2b53e93c31","abstract_canon_sha256":"666052b97e37168a4dba8afc4b34318080abb6836786b3d647a519d3d0c222e3"},"schema_version":"1.0"},"canonical_sha256":"861662fb30d77e1a7be196a45ecd1e9899b70434d3fdb9841dfbb8e3cb12af68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:19.099023Z","signature_b64":"XtsQ8XV4skd8B3OUqQVvdVf1VV4v28eq6UAITFXJ2w1AKAbaIufrJvJnpFDd37pXjafdoeShpX+Dj11ga4BXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"861662fb30d77e1a7be196a45ecd1e9899b70434d3fdb9841dfbb8e3cb12af68","last_reissued_at":"2026-05-18T02:27:19.098175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:19.098175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6126","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:27:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74MI3h3232QpK0JlprG9xjwv/D0NkPd7YLLjcX8iBs6jCjmM3WjF52G7DIUkYevaX2UDq6rvfwSnXcSl3iKEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:26:10.998019Z"},"content_sha256":"1f2a8e41c654dc2a4067cd0fc02411145bdfea8444575dbf6ecd4d35719dc063","schema_version":"1.0","event_id":"sha256:1f2a8e41c654dc2a4067cd0fc02411145bdfea8444575dbf6ecd4d35719dc063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QYLGF6ZQ257BU67BS2SF5TI6TC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anthony Nouy, Marie Billaud-Friess, Olivier Zahm","submitted_at":"2013-04-22T22:50:12Z","abstract_excerpt":"In this paper, we propose a method for the approximation of the solution of high-dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation formats. The method can be seen as a perturbation of a minimal residual method with residual norm corresponding to the error in a specified solution norm. We introduce and analyze an iterative algorithm that is able to provide a controlled approximation of the optimal approximation of the solution in a given low-rank subset, without any a priori information on this solution. We also introduce a weak greedy algorithm which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6126","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:27:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xn0UCcSGQ7XFk8ywUtgUt1TxTEvZJP5bMDjPIllgJjBNdN2AQninCfDETDSYVcAz2o5+Ih5Jpoh25vd6TBQOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:26:10.998400Z"},"content_sha256":"f7a6c08d1b3d76cf4b2ce93e3041ef64b708d3a0f1ac9aeac521981f3c7bc7ca","schema_version":"1.0","event_id":"sha256:f7a6c08d1b3d76cf4b2ce93e3041ef64b708d3a0f1ac9aeac521981f3c7bc7ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/bundle.json","state_url":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/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-06-02T17:26:10Z","links":{"resolver":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC","bundle":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/bundle.json","state":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QYLGF6ZQ257BU67BS2SF5TI6TC","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":"666052b97e37168a4dba8afc4b34318080abb6836786b3d647a519d3d0c222e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-22T22:50:12Z","title_canon_sha256":"739c5a3b2b00533a693f7aa93a082349e13332226101dd8db0fcce2b53e93c31"},"schema_version":"1.0","source":{"id":"1304.6126","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6126","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6126v2","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6126","created_at":"2026-05-18T02:27:19Z"},{"alias_kind":"pith_short_12","alias_value":"QYLGF6ZQ257B","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QYLGF6ZQ257BU67B","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QYLGF6ZQ","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:f7a6c08d1b3d76cf4b2ce93e3041ef64b708d3a0f1ac9aeac521981f3c7bc7ca","target":"graph","created_at":"2026-05-18T02:27:19Z","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":"In this paper, we propose a method for the approximation of the solution of high-dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation formats. The method can be seen as a perturbation of a minimal residual method with residual norm corresponding to the error in a specified solution norm. We introduce and analyze an iterative algorithm that is able to provide a controlled approximation of the optimal approximation of the solution in a given low-rank subset, without any a priori information on this solution. We also introduce a weak greedy algorithm which","authors_text":"Anthony Nouy, Marie Billaud-Friess, Olivier Zahm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-22T22:50:12Z","title":"A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6126","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:1f2a8e41c654dc2a4067cd0fc02411145bdfea8444575dbf6ecd4d35719dc063","target":"record","created_at":"2026-05-18T02:27:19Z","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":"666052b97e37168a4dba8afc4b34318080abb6836786b3d647a519d3d0c222e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-22T22:50:12Z","title_canon_sha256":"739c5a3b2b00533a693f7aa93a082349e13332226101dd8db0fcce2b53e93c31"},"schema_version":"1.0","source":{"id":"1304.6126","kind":"arxiv","version":2}},"canonical_sha256":"861662fb30d77e1a7be196a45ecd1e9899b70434d3fdb9841dfbb8e3cb12af68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"861662fb30d77e1a7be196a45ecd1e9899b70434d3fdb9841dfbb8e3cb12af68","first_computed_at":"2026-05-18T02:27:19.098175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:19.098175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XtsQ8XV4skd8B3OUqQVvdVf1VV4v28eq6UAITFXJ2w1AKAbaIufrJvJnpFDd37pXjafdoeShpX+Dj11ga4BXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:19.099023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6126","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f2a8e41c654dc2a4067cd0fc02411145bdfea8444575dbf6ecd4d35719dc063","sha256:f7a6c08d1b3d76cf4b2ce93e3041ef64b708d3a0f1ac9aeac521981f3c7bc7ca"],"state_sha256":"7c74144f20a561bcc61f3ad1b73a1d2d068f187fc4101cdb7adacefed1db9e85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVM7P7Nof0oT6BwwoPr1Oa4ncqBEF7RDoKvlYgG5ItLu2xVHzvutGYlKgvgcbmvz7taWi3mPSZhUW1/Y/RIUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:26:11.000410Z","bundle_sha256":"6fbb3c054d959480f9be121566bf2a12774330f0013e7a78107e0990d94f76cf"}}