{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QYLGF6ZQ257BU67BS2SF5TI6TC","short_pith_number":"pith:QYLGF6ZQ","schema_version":"1.0","canonical_sha256":"861662fb30d77e1a7be196a45ecd1e9899b70434d3fdb9841dfbb8e3cb12af68","source":{"kind":"arxiv","id":"1304.6126","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.6126","created_at":"2026-05-18T02:27:19.098311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6126v2","created_at":"2026-05-18T02:27:19.098311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6126","created_at":"2026-05-18T02:27:19.098311+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYLGF6ZQ257B","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYLGF6ZQ257BU67B","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYLGF6ZQ","created_at":"2026-05-18T12:27:57.521954+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/QYLGF6ZQ257BU67BS2SF5TI6TC","json":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC.json","graph_json":"https://pith.science/api/pith-number/QYLGF6ZQ257BU67BS2SF5TI6TC/graph.json","events_json":"https://pith.science/api/pith-number/QYLGF6ZQ257BU67BS2SF5TI6TC/events.json","paper":"https://pith.science/paper/QYLGF6ZQ"},"agent_actions":{"view_html":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC","download_json":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC.json","view_paper":"https://pith.science/paper/QYLGF6ZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6126&json=true","fetch_graph":"https://pith.science/api/pith-number/QYLGF6ZQ257BU67BS2SF5TI6TC/graph.json","fetch_events":"https://pith.science/api/pith-number/QYLGF6ZQ257BU67BS2SF5TI6TC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/action/storage_attestation","attest_author":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/action/author_attestation","sign_citation":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/action/citation_signature","submit_replication":"https://pith.science/pith/QYLGF6ZQ257BU67BS2SF5TI6TC/action/replication_record"}},"created_at":"2026-05-18T02:27:19.098311+00:00","updated_at":"2026-05-18T02:27:19.098311+00:00"}