{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BYVXTOVEDMZNPXP7MIFIVRQ6RV","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":"00471e769f6bba383b30d15a924eea6e5df269521922273ff2f7ba6ed9eea8fe","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-01T20:06:39Z","title_canon_sha256":"aa8a915c89ca34327e0c2b08e2c6ed9b07f4e447dc86e098ecfc2bc9893d375f"},"schema_version":"1.0","source":{"id":"1412.0620","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0620","created_at":"2026-05-18T01:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0620v6","created_at":"2026-05-18T01:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0620","created_at":"2026-05-18T01:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"BYVXTOVEDMZN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BYVXTOVEDMZNPXP7","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BYVXTOVE","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:6a5d44cbf14d07cd1e1da41cc18c2c124f9375da55963279ecd6b3ece625f651","target":"graph","created_at":"2026-05-18T01:04:45Z","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":"Unlike the matrix case, computing low-rank approximations of tensors is NP-hard and numerically ill-posed in general. Even the best rank-1 approximation of a tensor is NP-hard. In this paper, we use convex optimization to develop polynomial-time algorithms for low-rank approximation and completion of positive tensors. Our approach is to use algebraic topology to define a new (numerically well-posed) decomposition for positive tensors, which we show is equivalent to the standard tensor decomposition in important cases. Though computing this decomposition is a nonconvex optimization problem, we ","authors_text":"Anil Aswani","cross_cats":["cs.LG","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-01T20:06:39Z","title":"Low-Rank Approximation and Completion of Positive Tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0620","kind":"arxiv","version":6},"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:c9346f0d81d436cfddb7c7f783b9ed37baaac1242c55a4cecbe083596a2ce128","target":"record","created_at":"2026-05-18T01:04:45Z","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":"00471e769f6bba383b30d15a924eea6e5df269521922273ff2f7ba6ed9eea8fe","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-01T20:06:39Z","title_canon_sha256":"aa8a915c89ca34327e0c2b08e2c6ed9b07f4e447dc86e098ecfc2bc9893d375f"},"schema_version":"1.0","source":{"id":"1412.0620","kind":"arxiv","version":6}},"canonical_sha256":"0e2b79baa41b32d7ddff620a8ac61e8d4de205b93c1ec2233e9686ded473f898","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e2b79baa41b32d7ddff620a8ac61e8d4de205b93c1ec2233e9686ded473f898","first_computed_at":"2026-05-18T01:04:45.981566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:45.981566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XouR+iVHvtDV7vy6I1vpvNXuYzLlp0wle157CgSnFon2yeFepgvNzE6PQxQ/LUXX1ZaiMXDUqeiKCBiI3ebpCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:45.982089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0620","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9346f0d81d436cfddb7c7f783b9ed37baaac1242c55a4cecbe083596a2ce128","sha256:6a5d44cbf14d07cd1e1da41cc18c2c124f9375da55963279ecd6b3ece625f651"],"state_sha256":"a011a1dfdee891088e4bc92de5268f0b5eb82bfe1d018dfa2f0be90853acb3a9"}