{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MUXPJLB7OAZTWJ6IAR6VWZP3OZ","short_pith_number":"pith:MUXPJLB7","schema_version":"1.0","canonical_sha256":"652ef4ac3f70333b27c8047d5b65fb767550998780bd5aed7f31e2aa92dcf5a7","source":{"kind":"arxiv","id":"1312.1254","version":2},"attestation_state":"computed","paper":{"title":"Parallel matrix factorization for low-rank tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.CO"],"primary_cat":"cs.NA","authors_text":"Ruru Hao, Wotao Yin, Yangyang Xu, Zhixun Su","submitted_at":"2013-12-04T17:36:49Z","abstract_excerpt":"Higher-order low-rank tensors naturally arise in many applications including hyperspectral data recovery, video inpainting, seismic data recon- struction, and so on. We propose a new model to recover a low-rank tensor by simultaneously performing low-rank matrix factorizations to the all-mode ma- tricizations of the underlying tensor. An alternating minimization algorithm is applied to solve the model, along with two adaptive rank-adjusting strategies when the exact rank is not known.\n  Phase transition plots reveal that our algorithm can recover a variety of synthetic low-rank tensors from si"},"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":"1312.1254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-12-04T17:36:49Z","cross_cats_sorted":["math.NA","stat.CO"],"title_canon_sha256":"8fd3e11100046938b8baa119488f858280374285f79eaa0a0a1746e9d8cfe5f3","abstract_canon_sha256":"9186bc741789516334deaeead37919da6b417805e8382ead73b2d59e5200b970"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:21.650815Z","signature_b64":"sS6KgkkRMlieQ5C/9p9Qo0mhGBqW1DmM71vFuysCXtnltFsXu3OS2ERNl4FjZExCifhBDfZCGgpYQiHI3NtcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"652ef4ac3f70333b27c8047d5b65fb767550998780bd5aed7f31e2aa92dcf5a7","last_reissued_at":"2026-05-18T01:37:21.650096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:21.650096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel matrix factorization for low-rank tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.CO"],"primary_cat":"cs.NA","authors_text":"Ruru Hao, Wotao Yin, Yangyang Xu, Zhixun Su","submitted_at":"2013-12-04T17:36:49Z","abstract_excerpt":"Higher-order low-rank tensors naturally arise in many applications including hyperspectral data recovery, video inpainting, seismic data recon- struction, and so on. We propose a new model to recover a low-rank tensor by simultaneously performing low-rank matrix factorizations to the all-mode ma- tricizations of the underlying tensor. An alternating minimization algorithm is applied to solve the model, along with two adaptive rank-adjusting strategies when the exact rank is not known.\n  Phase transition plots reveal that our algorithm can recover a variety of synthetic low-rank tensors from si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1254","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":"1312.1254","created_at":"2026-05-18T01:37:21.650201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1254v2","created_at":"2026-05-18T01:37:21.650201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1254","created_at":"2026-05-18T01:37:21.650201+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUXPJLB7OAZT","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUXPJLB7OAZTWJ6I","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUXPJLB7","created_at":"2026-05-18T12:27:52.871228+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/MUXPJLB7OAZTWJ6IAR6VWZP3OZ","json":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ.json","graph_json":"https://pith.science/api/pith-number/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/graph.json","events_json":"https://pith.science/api/pith-number/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/events.json","paper":"https://pith.science/paper/MUXPJLB7"},"agent_actions":{"view_html":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ","download_json":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ.json","view_paper":"https://pith.science/paper/MUXPJLB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1254&json=true","fetch_graph":"https://pith.science/api/pith-number/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/action/storage_attestation","attest_author":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/action/author_attestation","sign_citation":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/action/citation_signature","submit_replication":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/action/replication_record"}},"created_at":"2026-05-18T01:37:21.650201+00:00","updated_at":"2026-05-18T01:37:21.650201+00:00"}