{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WCCM3IQGDLSNMHAPRBPRNYRKGQ","short_pith_number":"pith:WCCM3IQG","schema_version":"1.0","canonical_sha256":"b084cda2061ae4d61c0f885f16e22a3407888a89c88fcf8e1eec6bf769986351","source":{"kind":"arxiv","id":"2011.09416","version":2},"attestation_state":"computed","paper":{"title":"Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.CO","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aaron Potechin, Bohdan Kivva","submitted_at":"2020-11-18T17:27:36Z","abstract_excerpt":"In this paper we show that simple semidefinite programs inspired by degree $4$ SOS can exactly solve the tensor nuclear norm, tensor decomposition, and tensor completion problems on tensors with random asymmetric components. More precisely, for tensor nuclear norm and tensor decomposition, we show that w.h.p. these semidefinite programs can exactly find the nuclear norm and components of an $(n\\times n\\times n)$-tensor $\\mathcal{T}$ with $m\\leq n^{3/2}/polylog(n)$ random asymmetric components. Unlike most of the previous algorithms, our algorithm provides a certificate for the decomposition, d"},"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":"2011.09416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-18T17:27:36Z","cross_cats_sorted":["cs.CC","cs.LG","math.CO","stat.ML"],"title_canon_sha256":"88c4b4f9bd2b16bf7966a9ad11b60d9814947aa8e897e860df8c0751faef4d4f","abstract_canon_sha256":"d35070aecfa0915d3fe28d5a88f58fb528ba210efa8ed9bae1d12e33c80ee3e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:37.985625Z","signature_b64":"J7+CZgT/ltRn1Iecskm6cSYRKihuRx12FSvoBQj2i6QpuSvI/zX2aOpJc1Ih61Wj92vFl9PY4Jen+Ccr6aqUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b084cda2061ae4d61c0f885f16e22a3407888a89c88fcf8e1eec6bf769986351","last_reissued_at":"2026-07-05T03:26:37.984990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:37.984990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.CO","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aaron Potechin, Bohdan Kivva","submitted_at":"2020-11-18T17:27:36Z","abstract_excerpt":"In this paper we show that simple semidefinite programs inspired by degree $4$ SOS can exactly solve the tensor nuclear norm, tensor decomposition, and tensor completion problems on tensors with random asymmetric components. More precisely, for tensor nuclear norm and tensor decomposition, we show that w.h.p. these semidefinite programs can exactly find the nuclear norm and components of an $(n\\times n\\times n)$-tensor $\\mathcal{T}$ with $m\\leq n^{3/2}/polylog(n)$ random asymmetric components. Unlike most of the previous algorithms, our algorithm provides a certificate for the decomposition, d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09416","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.09416/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.09416","created_at":"2026-07-05T03:26:37.985053+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.09416v2","created_at":"2026-07-05T03:26:37.985053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09416","created_at":"2026-07-05T03:26:37.985053+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCCM3IQGDLSN","created_at":"2026-07-05T03:26:37.985053+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCCM3IQGDLSNMHAP","created_at":"2026-07-05T03:26:37.985053+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCCM3IQG","created_at":"2026-07-05T03:26:37.985053+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07936","citing_title":"Simple Norm Bounds for Polynomial Random Matrices via Decoupling","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ","json":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ.json","graph_json":"https://pith.science/api/pith-number/WCCM3IQGDLSNMHAPRBPRNYRKGQ/graph.json","events_json":"https://pith.science/api/pith-number/WCCM3IQGDLSNMHAPRBPRNYRKGQ/events.json","paper":"https://pith.science/paper/WCCM3IQG"},"agent_actions":{"view_html":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ","download_json":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ.json","view_paper":"https://pith.science/paper/WCCM3IQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.09416&json=true","fetch_graph":"https://pith.science/api/pith-number/WCCM3IQGDLSNMHAPRBPRNYRKGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WCCM3IQGDLSNMHAPRBPRNYRKGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ/action/storage_attestation","attest_author":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ/action/author_attestation","sign_citation":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ/action/citation_signature","submit_replication":"https://pith.science/pith/WCCM3IQGDLSNMHAPRBPRNYRKGQ/action/replication_record"}},"created_at":"2026-07-05T03:26:37.985053+00:00","updated_at":"2026-07-05T03:26:37.985053+00:00"}