{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LP5HTRNHZR4YNANWZLFJ5M3XBT","short_pith_number":"pith:LP5HTRNH","canonical_record":{"source":{"id":"2003.08537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-03-19T01:49:07Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"title_canon_sha256":"7d4a6fe41cb7825b9ed0ad97691dab689fb76f956ddfb315edeeb6ab3ecb61cf","abstract_canon_sha256":"da954de4d69af0c0447cf3f41e6904285e680245eafa93a27572029608b9079e"},"schema_version":"1.0"},"canonical_sha256":"5bfa79c5a7cc798681b6caca9eb3770cf5835a33359e6095ffafc5973e35d594","source":{"kind":"arxiv","id":"2003.08537","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.08537","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"2003.08537v2","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.08537","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"LP5HTRNHZR4Y","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"pith_short_16","alias_value":"LP5HTRNHZR4YNANW","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"pith_short_8","alias_value":"LP5HTRNH","created_at":"2026-07-05T02:55:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LP5HTRNHZR4YNANWZLFJ5M3XBT","target":"record","payload":{"canonical_record":{"source":{"id":"2003.08537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-03-19T01:49:07Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"title_canon_sha256":"7d4a6fe41cb7825b9ed0ad97691dab689fb76f956ddfb315edeeb6ab3ecb61cf","abstract_canon_sha256":"da954de4d69af0c0447cf3f41e6904285e680245eafa93a27572029608b9079e"},"schema_version":"1.0"},"canonical_sha256":"5bfa79c5a7cc798681b6caca9eb3770cf5835a33359e6095ffafc5973e35d594","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:05.974526Z","signature_b64":"JQdm5z1t41aFnZh+XEbwlZ8pVfdWKfaQ4S2i+fwgpC5PW8ncX9FHNx9vC05v+X83Ux+62dRBvS/eKSZBAgYqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bfa79c5a7cc798681b6caca9eb3770cf5835a33359e6095ffafc5973e35d594","last_reissued_at":"2026-07-05T02:55:05.973977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:05.973977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.08537","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-07-05T02:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P44bjOJlWXTSpZipmb3TQLhzQGtoQMR7gwmVnZpRNRkHkHMgFFELFASPhFePdQJCLl4d0sQ1mnFksZKeT1ZpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:58:58.642642Z"},"content_sha256":"7129a9b1eea7c1f18f4e830b687030e1c75ae510f3a2f17504edc259cf538edd","schema_version":"1.0","event_id":"sha256:7129a9b1eea7c1f18f4e830b687030e1c75ae510f3a2f17504edc259cf538edd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LP5HTRNHZR4YNANWZLFJ5M3XBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HOSVD-Based Algorithm for Weighted Tensor Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT"],"primary_cat":"math.NA","authors_text":"Deanna Needell, Longxiu Huang, Zehan Chao","submitted_at":"2020-03-19T01:49:07Z","abstract_excerpt":"Matrix completion, the problem of completing missing entries in a data matrix with low dimensional structure (such as rank), has seen many fruitful approaches and analyses. Tensor completion is the tensor analog, that attempts to impute missing tensor entries from similar low-rank type assumptions. In this paper, we study the tensor completion problem when the sampling pattern is deterministic and possibly non-uniform. We first propose an efficient weighted HOSVD algorithm for recovery of the underlying low-rank tensor from noisy observations and then derive the error bounds under a properly w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.08537","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/2003.08537/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"},"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-07-05T02:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCjQ5jGxmxg0L9kNI0Gg90dFUqARjHTP/38fI1a5aVSsEp6/M6eXWF3LVMqnPXFYiv/aU2Sf6rE6hZu8J3fGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:58:58.643149Z"},"content_sha256":"2911274379bda0634bd50af6b1f9042a0fb1e8e3fb51e14b1665949e580ae9ad","schema_version":"1.0","event_id":"sha256:2911274379bda0634bd50af6b1f9042a0fb1e8e3fb51e14b1665949e580ae9ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LP5HTRNHZR4YNANWZLFJ5M3XBT/bundle.json","state_url":"https://pith.science/pith/LP5HTRNHZR4YNANWZLFJ5M3XBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LP5HTRNHZR4YNANWZLFJ5M3XBT/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-08-06T03:58:58Z","links":{"resolver":"https://pith.science/pith/LP5HTRNHZR4YNANWZLFJ5M3XBT","bundle":"https://pith.science/pith/LP5HTRNHZR4YNANWZLFJ5M3XBT/bundle.json","state":"https://pith.science/pith/LP5HTRNHZR4YNANWZLFJ5M3XBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LP5HTRNHZR4YNANWZLFJ5M3XBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LP5HTRNHZR4YNANWZLFJ5M3XBT","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":"da954de4d69af0c0447cf3f41e6904285e680245eafa93a27572029608b9079e","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-03-19T01:49:07Z","title_canon_sha256":"7d4a6fe41cb7825b9ed0ad97691dab689fb76f956ddfb315edeeb6ab3ecb61cf"},"schema_version":"1.0","source":{"id":"2003.08537","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.08537","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"2003.08537v2","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.08537","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"LP5HTRNHZR4Y","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"pith_short_16","alias_value":"LP5HTRNHZR4YNANW","created_at":"2026-07-05T02:55:05Z"},{"alias_kind":"pith_short_8","alias_value":"LP5HTRNH","created_at":"2026-07-05T02:55:05Z"}],"graph_snapshots":[{"event_id":"sha256:2911274379bda0634bd50af6b1f9042a0fb1e8e3fb51e14b1665949e580ae9ad","target":"graph","created_at":"2026-07-05T02:55:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.08537/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Matrix completion, the problem of completing missing entries in a data matrix with low dimensional structure (such as rank), has seen many fruitful approaches and analyses. Tensor completion is the tensor analog, that attempts to impute missing tensor entries from similar low-rank type assumptions. In this paper, we study the tensor completion problem when the sampling pattern is deterministic and possibly non-uniform. We first propose an efficient weighted HOSVD algorithm for recovery of the underlying low-rank tensor from noisy observations and then derive the error bounds under a properly w","authors_text":"Deanna Needell, Longxiu Huang, Zehan Chao","cross_cats":["cs.IT","cs.NA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-03-19T01:49:07Z","title":"HOSVD-Based Algorithm for Weighted Tensor Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.08537","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:7129a9b1eea7c1f18f4e830b687030e1c75ae510f3a2f17504edc259cf538edd","target":"record","created_at":"2026-07-05T02:55:05Z","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":"da954de4d69af0c0447cf3f41e6904285e680245eafa93a27572029608b9079e","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-03-19T01:49:07Z","title_canon_sha256":"7d4a6fe41cb7825b9ed0ad97691dab689fb76f956ddfb315edeeb6ab3ecb61cf"},"schema_version":"1.0","source":{"id":"2003.08537","kind":"arxiv","version":2}},"canonical_sha256":"5bfa79c5a7cc798681b6caca9eb3770cf5835a33359e6095ffafc5973e35d594","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bfa79c5a7cc798681b6caca9eb3770cf5835a33359e6095ffafc5973e35d594","first_computed_at":"2026-07-05T02:55:05.973977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:55:05.973977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JQdm5z1t41aFnZh+XEbwlZ8pVfdWKfaQ4S2i+fwgpC5PW8ncX9FHNx9vC05v+X83Ux+62dRBvS/eKSZBAgYqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:55:05.974526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.08537","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7129a9b1eea7c1f18f4e830b687030e1c75ae510f3a2f17504edc259cf538edd","sha256:2911274379bda0634bd50af6b1f9042a0fb1e8e3fb51e14b1665949e580ae9ad"],"state_sha256":"1ce2c5411eb8559f7c04aef9d582d34259c6d9050f688454a9b7ec5580205bdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7+866lO2HMxsD6QDSVzspEorrvlLeqsfMKqjQWW+1dFRqtnbINQ2tvRSoR+h6k6FibctS8b4EzXkd0vMxQ9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:58:58.648559Z","bundle_sha256":"c202f2d45c202818cf1531ea5d026336c39c29b39e65e48140eb1babcabf4425"}}