{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:O35CB7KF5MHLVQP6YXTKGQJ4E2","short_pith_number":"pith:O35CB7KF","schema_version":"1.0","canonical_sha256":"76fa20fd45eb0ebac1fec5e6a3413c26b74d91fac14446d933b746198032b5aa","source":{"kind":"arxiv","id":"1307.5870","version":2},"attestation_state":"computed","paper":{"title":"Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bo Huang, Cun Mu, Donald Goldfarb, John Wright","submitted_at":"2013-07-22T20:23:29Z","abstract_excerpt":"Recovering a low-rank tensor from incomplete information is a recurring problem in signal processing and machine learning. The most popular convex relaxation of this problem minimizes the sum of the nuclear norms of the unfoldings of the tensor. We show that this approach can be substantially suboptimal: reliably recovering a $K$-way tensor of length $n$ and Tucker rank $r$ from Gaussian measurements requires $\\Omega(r n^{K-1})$ observations. In contrast, a certain (intractable) nonconvex formulation needs only $O(r^K + nrK)$ observations. We introduce a very simple, new convex relaxation, whi"},"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":"1307.5870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-22T20:23:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"48920d17e0d2f1f41162cec694d88e2c00ebc957492f516c0bdd28d364d134f9","abstract_canon_sha256":"c3900b9dacb3754e00fd4fa56c97ef05fdf2f866885078920ceb0c78fd47cbaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:55.474268Z","signature_b64":"jP7Eo83cb9wc4YdFzpp+xg8F6sXUDZKk/gfDjcTAgVczXoTmZVGqfIIgTsXVX3X/W8w0ClgxJN5OouvKdqv3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76fa20fd45eb0ebac1fec5e6a3413c26b74d91fac14446d933b746198032b5aa","last_reissued_at":"2026-05-18T03:15:55.473457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:55.473457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bo Huang, Cun Mu, Donald Goldfarb, John Wright","submitted_at":"2013-07-22T20:23:29Z","abstract_excerpt":"Recovering a low-rank tensor from incomplete information is a recurring problem in signal processing and machine learning. The most popular convex relaxation of this problem minimizes the sum of the nuclear norms of the unfoldings of the tensor. We show that this approach can be substantially suboptimal: reliably recovering a $K$-way tensor of length $n$ and Tucker rank $r$ from Gaussian measurements requires $\\Omega(r n^{K-1})$ observations. In contrast, a certain (intractable) nonconvex formulation needs only $O(r^K + nrK)$ observations. We introduce a very simple, new convex relaxation, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5870","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":"1307.5870","created_at":"2026-05-18T03:15:55.473580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5870v2","created_at":"2026-05-18T03:15:55.473580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5870","created_at":"2026-05-18T03:15:55.473580+00:00"},{"alias_kind":"pith_short_12","alias_value":"O35CB7KF5MHL","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"O35CB7KF5MHLVQP6","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"O35CB7KF","created_at":"2026-05-18T12:27:54.935989+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/O35CB7KF5MHLVQP6YXTKGQJ4E2","json":"https://pith.science/pith/O35CB7KF5MHLVQP6YXTKGQJ4E2.json","graph_json":"https://pith.science/api/pith-number/O35CB7KF5MHLVQP6YXTKGQJ4E2/graph.json","events_json":"https://pith.science/api/pith-number/O35CB7KF5MHLVQP6YXTKGQJ4E2/events.json","paper":"https://pith.science/paper/O35CB7KF"},"agent_actions":{"view_html":"https://pith.science/pith/O35CB7KF5MHLVQP6YXTKGQJ4E2","download_json":"https://pith.science/pith/O35CB7KF5MHLVQP6YXTKGQJ4E2.json","view_paper":"https://pith.science/paper/O35CB7KF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5870&json=true","fetch_graph":"https://pith.science/api/pith-number/O35CB7KF5MHLVQP6YXTKGQJ4E2/graph.json","fetch_events":"https://pith.science/api/pith-number/O35CB7KF5MHLVQP6YXTKGQJ4E2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O35CB7KF5MHLVQP6YXTKGQJ4E2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O35CB7KF5MHLVQP6YXTKGQJ4E2/action/storage_attestation","attest_author":"https://pith.science/pith/O35CB7KF5MHLVQP6YXTKGQJ4E2/action/author_attestation","sign_citation":"https://pith.science/pith/O35CB7KF5MHLVQP6YXTKGQJ4E2/action/citation_signature","submit_replication":"https://pith.science/pith/O35CB7KF5MHLVQP6YXTKGQJ4E2/action/replication_record"}},"created_at":"2026-05-18T03:15:55.473580+00:00","updated_at":"2026-05-18T03:15:55.473580+00:00"}