{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OQIPUKUNWT26XYB4OEWJJ4ASTI","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":"983bb47ce43a21efd8741e6197fa9919a29bb04d4deed1c69875c73a57fd01e4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-30T21:25:54Z","title_canon_sha256":"8cb31a02bd2843d0f068b4f4395c1be87413df4407262cfecbf0a6a143572b27"},"schema_version":"1.0","source":{"id":"1305.0030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0030","created_at":"2026-05-18T01:25:08Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0030v2","created_at":"2026-05-18T01:25:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0030","created_at":"2026-05-18T01:25:08Z"},{"alias_kind":"pith_short_12","alias_value":"OQIPUKUNWT26","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OQIPUKUNWT26XYB4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OQIPUKUN","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:ba3fd2ca68a2e2107e28e5058f7bcbe4f2d0d74071a39f21e936d7b7b7f3d8a3","target":"graph","created_at":"2026-05-18T01:25:08Z","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 low-rank approximation method based on discrete least-squares for the approximation of a multivariate function from random, noisy-free observations. Sparsity inducing regularization techniques are used within classical algorithms for low-rank approximation in order to exploit the possible sparsity of low-rank approximations. Sparse low-rank approximations are constructed with a robust updated greedy algorithm which includes an optimal selection of regularization parameters and approximation ranks using cross validation techniques. Numerical examples demonstrate the ","authors_text":"Anthony Nouy, Mathilde Chevreuil, Prashant Rai, R\\'egis Lebrun","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-30T21:25:54Z","title":"A least-squares method for sparse low rank approximation of multivariate functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0030","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:2c2e04275b7ebc2199501ca2b106271367116002056cc4d28ba3f38a177d87ff","target":"record","created_at":"2026-05-18T01:25:08Z","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":"983bb47ce43a21efd8741e6197fa9919a29bb04d4deed1c69875c73a57fd01e4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-30T21:25:54Z","title_canon_sha256":"8cb31a02bd2843d0f068b4f4395c1be87413df4407262cfecbf0a6a143572b27"},"schema_version":"1.0","source":{"id":"1305.0030","kind":"arxiv","version":2}},"canonical_sha256":"7410fa2a8db4f5ebe03c712c94f0129a2b6c2011c459c5896e64a77a271d7345","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7410fa2a8db4f5ebe03c712c94f0129a2b6c2011c459c5896e64a77a271d7345","first_computed_at":"2026-05-18T01:25:08.938954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:08.938954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n4BWVC3JYG9Lj1od4vx0qsFZwcM2X7d8O5GFDRYuxIG4hTvwngDzV0jzS8YnvlRPvAtYOQzSzPjTq1ygQIFDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:08.939442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c2e04275b7ebc2199501ca2b106271367116002056cc4d28ba3f38a177d87ff","sha256:ba3fd2ca68a2e2107e28e5058f7bcbe4f2d0d74071a39f21e936d7b7b7f3d8a3"],"state_sha256":"32426c27084eb4c6bd779d55a40ddd8df1b6674d89a48663b2c0f211351eb478"}