{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XESVC3REGAQ6T6VZDKLYNISHU6","short_pith_number":"pith:XESVC3RE","canonical_record":{"source":{"id":"1601.01083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-01-06T05:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"d02410489572beb0f07f1fb8d9656c0533f3c068920330b3a0d71da4a8eb6949","abstract_canon_sha256":"74d8cc618b72094b92db05b8e184a6e7457db36d76770d4dda46c41f99ac71f4"},"schema_version":"1.0"},"canonical_sha256":"b925516e243021e9fab91a9786a247a7961cc37424d10f2bf71413f97fef46e5","source":{"kind":"arxiv","id":"1601.01083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01083","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01083v1","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01083","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"pith_short_12","alias_value":"XESVC3REGAQ6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XESVC3REGAQ6T6VZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XESVC3RE","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XESVC3REGAQ6T6VZDKLYNISHU6","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-01-06T05:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"d02410489572beb0f07f1fb8d9656c0533f3c068920330b3a0d71da4a8eb6949","abstract_canon_sha256":"74d8cc618b72094b92db05b8e184a6e7457db36d76770d4dda46c41f99ac71f4"},"schema_version":"1.0"},"canonical_sha256":"b925516e243021e9fab91a9786a247a7961cc37424d10f2bf71413f97fef46e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:17.999934Z","signature_b64":"IFqsz8c5Dgp5yzJJvBJ0h55heSBsZf0b+1aiuQMLofh74rWhmarCZ2nsBmxj21zW8RrDMx+YkLb7fwAVqs1VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b925516e243021e9fab91a9786a247a7961cc37424d10f2bf71413f97fef46e5","last_reissued_at":"2026-05-18T01:23:17.999124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:17.999124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01083","source_version":1,"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:23:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mTxH9eDSjy6qJLKrqCEy1AadKaWInSRlKf5pwngOgh3jAFu3Qq8Pby984xgNp1V2UwFek9N43NseKcV/7yaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:55:14.946671Z"},"content_sha256":"c4f26aa88e7329cb2f71fb7c222dcac3200043057e5c77b075b6a8bf920b90b5","schema_version":"1.0","event_id":"sha256:c4f26aa88e7329cb2f71fb7c222dcac3200043057e5c77b075b6a8bf920b90b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XESVC3REGAQ6T6VZDKLYNISHU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient tensor completion: Low-rank tensor train","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Hoang D. Tuan, Ho N. Phien, Johann A. Bengua, Minh N. Do","submitted_at":"2016-01-06T05:48:21Z","abstract_excerpt":"This paper proposes a novel formulation of the tensor completion problem to impute missing entries of data represented by tensors. The formulation is introduced in terms of tensor train (TT) rank which can effectively capture global information of tensors thanks to its construction by a well-balanced matricization scheme. Two algorithms are proposed to solve the corresponding tensor completion problem. The first one called simple low-rank tensor completion via tensor train (SiLRTC-TT) is intimately related to minimizing the TT nuclear norm. The second one is based on a multilinear matrix facto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01083","kind":"arxiv","version":1},"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:23:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNp6P0jjNUJ+B8TnnQUj5tbnWGOLUftWcQcbpPKmH3tKE5A/6uYqPUZrFxMr5As7JjiZocapTlOoEQIw2BkhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:55:14.947019Z"},"content_sha256":"8c43cd2236591633f938947f0f9bc7cb8610d6db4e7445e869a07e9f45620fb8","schema_version":"1.0","event_id":"sha256:8c43cd2236591633f938947f0f9bc7cb8610d6db4e7445e869a07e9f45620fb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XESVC3REGAQ6T6VZDKLYNISHU6/bundle.json","state_url":"https://pith.science/pith/XESVC3REGAQ6T6VZDKLYNISHU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XESVC3REGAQ6T6VZDKLYNISHU6/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-06-03T10:55:14Z","links":{"resolver":"https://pith.science/pith/XESVC3REGAQ6T6VZDKLYNISHU6","bundle":"https://pith.science/pith/XESVC3REGAQ6T6VZDKLYNISHU6/bundle.json","state":"https://pith.science/pith/XESVC3REGAQ6T6VZDKLYNISHU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XESVC3REGAQ6T6VZDKLYNISHU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XESVC3REGAQ6T6VZDKLYNISHU6","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":"74d8cc618b72094b92db05b8e184a6e7457db36d76770d4dda46c41f99ac71f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-01-06T05:48:21Z","title_canon_sha256":"d02410489572beb0f07f1fb8d9656c0533f3c068920330b3a0d71da4a8eb6949"},"schema_version":"1.0","source":{"id":"1601.01083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01083","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01083v1","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01083","created_at":"2026-05-18T01:23:17Z"},{"alias_kind":"pith_short_12","alias_value":"XESVC3REGAQ6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XESVC3REGAQ6T6VZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XESVC3RE","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:8c43cd2236591633f938947f0f9bc7cb8610d6db4e7445e869a07e9f45620fb8","target":"graph","created_at":"2026-05-18T01:23:17Z","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":"This paper proposes a novel formulation of the tensor completion problem to impute missing entries of data represented by tensors. The formulation is introduced in terms of tensor train (TT) rank which can effectively capture global information of tensors thanks to its construction by a well-balanced matricization scheme. Two algorithms are proposed to solve the corresponding tensor completion problem. The first one called simple low-rank tensor completion via tensor train (SiLRTC-TT) is intimately related to minimizing the TT nuclear norm. The second one is based on a multilinear matrix facto","authors_text":"Hoang D. Tuan, Ho N. Phien, Johann A. Bengua, Minh N. Do","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-01-06T05:48:21Z","title":"Efficient tensor completion: Low-rank tensor train"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01083","kind":"arxiv","version":1},"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:c4f26aa88e7329cb2f71fb7c222dcac3200043057e5c77b075b6a8bf920b90b5","target":"record","created_at":"2026-05-18T01:23:17Z","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":"74d8cc618b72094b92db05b8e184a6e7457db36d76770d4dda46c41f99ac71f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-01-06T05:48:21Z","title_canon_sha256":"d02410489572beb0f07f1fb8d9656c0533f3c068920330b3a0d71da4a8eb6949"},"schema_version":"1.0","source":{"id":"1601.01083","kind":"arxiv","version":1}},"canonical_sha256":"b925516e243021e9fab91a9786a247a7961cc37424d10f2bf71413f97fef46e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b925516e243021e9fab91a9786a247a7961cc37424d10f2bf71413f97fef46e5","first_computed_at":"2026-05-18T01:23:17.999124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:17.999124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IFqsz8c5Dgp5yzJJvBJ0h55heSBsZf0b+1aiuQMLofh74rWhmarCZ2nsBmxj21zW8RrDMx+YkLb7fwAVqs1VCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:17.999934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4f26aa88e7329cb2f71fb7c222dcac3200043057e5c77b075b6a8bf920b90b5","sha256:8c43cd2236591633f938947f0f9bc7cb8610d6db4e7445e869a07e9f45620fb8"],"state_sha256":"16f1eafc19c0f502a9a3fb4c995b9f34190ebe406aa7b7bcce1d7b35580c4ef0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+p+igpvvdEWDDN4Pt4h/9wvP4r9BTOREcEnAqZwuGB+AiQxy7ZePCGHVhNIYlO1TIkjLIlqmRHl8iHBHIpPhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:55:14.949204Z","bundle_sha256":"6eca6031856e61dccd6b2853a77caecd998affe5e96c9b5fd6285dc39a96c563"}}