{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MUXPJLB7OAZTWJ6IAR6VWZP3OZ","short_pith_number":"pith:MUXPJLB7","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"},"canonical_sha256":"652ef4ac3f70333b27c8047d5b65fb767550998780bd5aed7f31e2aa92dcf5a7","source":{"kind":"arxiv","id":"1312.1254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1254","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1254v2","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1254","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"MUXPJLB7OAZT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MUXPJLB7OAZTWJ6I","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MUXPJLB7","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MUXPJLB7OAZTWJ6IAR6VWZP3OZ","target":"record","payload":{"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"},"canonical_sha256":"652ef4ac3f70333b27c8047d5b65fb767550998780bd5aed7f31e2aa92dcf5a7","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"},"source_kind":"arxiv","source_id":"1312.1254","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5a+s3EP9YjFGpMYa6S3M2XLe9WUHBw75cGD/gvVNRtEfad+csL9YIWOLTFPjFzZW1DgfRkWjG6pF9nysL/68Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:57:56.324911Z"},"content_sha256":"a8ee53a1eb2e2407cd8bbc5b91d9531d361ca77eefe001642f5ca3b556794977","schema_version":"1.0","event_id":"sha256:a8ee53a1eb2e2407cd8bbc5b91d9531d361ca77eefe001642f5ca3b556794977"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MUXPJLB7OAZTWJ6IAR6VWZP3OZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaTHZekKf5UCBABmnQohBnbCsv/OTeGlaxTtxsfnesTrSLm9u5NMjRHgiTtA/gzVOgYfWYjfmq1V1jiJBIFBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:57:56.325267Z"},"content_sha256":"5b847d88627ba4e9cb32f811c4a0e2b5cbfa83f4ed6d9cda89422dacd4a6d9e7","schema_version":"1.0","event_id":"sha256:5b847d88627ba4e9cb32f811c4a0e2b5cbfa83f4ed6d9cda89422dacd4a6d9e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/bundle.json","state_url":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T08:57:56Z","links":{"resolver":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ","bundle":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/bundle.json","state":"https://pith.science/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUXPJLB7OAZTWJ6IAR6VWZP3OZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MUXPJLB7OAZTWJ6IAR6VWZP3OZ","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":"9186bc741789516334deaeead37919da6b417805e8382ead73b2d59e5200b970","cross_cats_sorted":["math.NA","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-12-04T17:36:49Z","title_canon_sha256":"8fd3e11100046938b8baa119488f858280374285f79eaa0a0a1746e9d8cfe5f3"},"schema_version":"1.0","source":{"id":"1312.1254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1254","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1254v2","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1254","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"MUXPJLB7OAZT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MUXPJLB7OAZTWJ6I","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MUXPJLB7","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:5b847d88627ba4e9cb32f811c4a0e2b5cbfa83f4ed6d9cda89422dacd4a6d9e7","target":"graph","created_at":"2026-05-18T01:37:21Z","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":"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","authors_text":"Ruru Hao, Wotao Yin, Yangyang Xu, Zhixun Su","cross_cats":["math.NA","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-12-04T17:36:49Z","title":"Parallel matrix factorization for low-rank tensor completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1254","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:a8ee53a1eb2e2407cd8bbc5b91d9531d361ca77eefe001642f5ca3b556794977","target":"record","created_at":"2026-05-18T01:37:21Z","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":"9186bc741789516334deaeead37919da6b417805e8382ead73b2d59e5200b970","cross_cats_sorted":["math.NA","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-12-04T17:36:49Z","title_canon_sha256":"8fd3e11100046938b8baa119488f858280374285f79eaa0a0a1746e9d8cfe5f3"},"schema_version":"1.0","source":{"id":"1312.1254","kind":"arxiv","version":2}},"canonical_sha256":"652ef4ac3f70333b27c8047d5b65fb767550998780bd5aed7f31e2aa92dcf5a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"652ef4ac3f70333b27c8047d5b65fb767550998780bd5aed7f31e2aa92dcf5a7","first_computed_at":"2026-05-18T01:37:21.650096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:21.650096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sS6KgkkRMlieQ5C/9p9Qo0mhGBqW1DmM71vFuysCXtnltFsXu3OS2ERNl4FjZExCifhBDfZCGgpYQiHI3NtcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:21.650815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8ee53a1eb2e2407cd8bbc5b91d9531d361ca77eefe001642f5ca3b556794977","sha256:5b847d88627ba4e9cb32f811c4a0e2b5cbfa83f4ed6d9cda89422dacd4a6d9e7"],"state_sha256":"733499fecb9ec4e837530c7b423e87bba3d90fee944e9e70f3c968ea77ae7f4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WNIQRBaM27o54l7xJ+wUyok+8nwYAg+YH2DlMvvD28ILzSfOHHaP9aGywzeiYBE0CdsXe9dSpuxc5m1o2soSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:57:56.327832Z","bundle_sha256":"d653292acb5357c9a54a093a3cdbb26991df031dc69269bb4da390dc257f5b66"}}