{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BV6BQPG2PYHUZ77JUQSXR6Z6FO","short_pith_number":"pith:BV6BQPG2","canonical_record":{"source":{"id":"1809.02288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T03:05:08Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"a30bfbb098e02efaf810ae6bb09d3ef780c4ff45e4c03b904981f7b188420b3a","abstract_canon_sha256":"08d7434d9e6ef9b8e0d32828cce6bd99be8f31231e62cbbe0d35d3af9e9a6c49"},"schema_version":"1.0"},"canonical_sha256":"0d7c183cda7e0f4cffe9a42578fb3e2bb1fd652441c5dbe34f70eec2069f232f","source":{"kind":"arxiv","id":"1809.02288","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02288","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02288v2","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02288","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"BV6BQPG2PYHU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BV6BQPG2PYHUZ77J","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BV6BQPG2","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BV6BQPG2PYHUZ77JUQSXR6Z6FO","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T03:05:08Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"a30bfbb098e02efaf810ae6bb09d3ef780c4ff45e4c03b904981f7b188420b3a","abstract_canon_sha256":"08d7434d9e6ef9b8e0d32828cce6bd99be8f31231e62cbbe0d35d3af9e9a6c49"},"schema_version":"1.0"},"canonical_sha256":"0d7c183cda7e0f4cffe9a42578fb3e2bb1fd652441c5dbe34f70eec2069f232f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:32.236862Z","signature_b64":"N9HujpZ8uzqdGMYcFWCgMV9w8+diE9deUagFAE4D+CSwkoOj6SNQuk6+R9+OSTEmz5DZAdY2gQ3bmsmIbqKJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d7c183cda7e0f4cffe9a42578fb3e2bb1fd652441c5dbe34f70eec2069f232f","last_reissued_at":"2026-05-17T23:59:32.236169Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:32.236169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02288","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-17T23:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FN4XGRE5x325Vcq2I946MImGVy/eg4WtAd0yXM8nyLkbXLAqSRQEkVaPum7mVKyawmZ0pl02WCxWwtve/bl/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:54:12.331764Z"},"content_sha256":"2886efba6a20ab3cff5cfb9df53326c1e93a79f9ee4ce190d78a3ffa4eb98616","schema_version":"1.0","event_id":"sha256:2886efba6a20ab3cff5cfb9df53326c1e93a79f9ee4ce190d78a3ffa4eb98616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BV6BQPG2PYHUZ77JUQSXR6Z6FO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Li, Danilo Mandic, Jianting Cao, Longhao Yuan, Qibin Zhao","submitted_at":"2018-09-07T03:05:08Z","abstract_excerpt":"In tensor completion tasks, the traditional low-rank tensor decomposition models suffer from the laborious model selection problem due to their high model sensitivity. In particular, for tensor ring (TR) decomposition, the number of model possibilities grows exponentially with the tensor order, which makes it rather challenging to find the optimal TR decomposition. In this paper, by exploiting the low-rank structure of the TR latent space, we propose a novel tensor completion method which is robust to model selection. In contrast to imposing the low-rank constraint on the data space, we introd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02288","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-17T23:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYSms7p3hpvEnxqJ3tCRKhuy39SGqleBmanImi7EU6HtlLshT7bUxN3V0/q/DoSOFUWSFLUDARIuMyFnop/RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:54:12.332126Z"},"content_sha256":"04b2160fb6a092ceb86bb434700afdb12ef112687876ee36ccaee598cf4fd00e","schema_version":"1.0","event_id":"sha256:04b2160fb6a092ceb86bb434700afdb12ef112687876ee36ccaee598cf4fd00e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BV6BQPG2PYHUZ77JUQSXR6Z6FO/bundle.json","state_url":"https://pith.science/pith/BV6BQPG2PYHUZ77JUQSXR6Z6FO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BV6BQPG2PYHUZ77JUQSXR6Z6FO/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-06T00:54:12Z","links":{"resolver":"https://pith.science/pith/BV6BQPG2PYHUZ77JUQSXR6Z6FO","bundle":"https://pith.science/pith/BV6BQPG2PYHUZ77JUQSXR6Z6FO/bundle.json","state":"https://pith.science/pith/BV6BQPG2PYHUZ77JUQSXR6Z6FO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BV6BQPG2PYHUZ77JUQSXR6Z6FO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BV6BQPG2PYHUZ77JUQSXR6Z6FO","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":"08d7434d9e6ef9b8e0d32828cce6bd99be8f31231e62cbbe0d35d3af9e9a6c49","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T03:05:08Z","title_canon_sha256":"a30bfbb098e02efaf810ae6bb09d3ef780c4ff45e4c03b904981f7b188420b3a"},"schema_version":"1.0","source":{"id":"1809.02288","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02288","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02288v2","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02288","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"BV6BQPG2PYHU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BV6BQPG2PYHUZ77J","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BV6BQPG2","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:04b2160fb6a092ceb86bb434700afdb12ef112687876ee36ccaee598cf4fd00e","target":"graph","created_at":"2026-05-17T23:59:32Z","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":"In tensor completion tasks, the traditional low-rank tensor decomposition models suffer from the laborious model selection problem due to their high model sensitivity. In particular, for tensor ring (TR) decomposition, the number of model possibilities grows exponentially with the tensor order, which makes it rather challenging to find the optimal TR decomposition. In this paper, by exploiting the low-rank structure of the TR latent space, we propose a novel tensor completion method which is robust to model selection. In contrast to imposing the low-rank constraint on the data space, we introd","authors_text":"Chao Li, Danilo Mandic, Jianting Cao, Longhao Yuan, Qibin Zhao","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T03:05:08Z","title":"Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02288","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:2886efba6a20ab3cff5cfb9df53326c1e93a79f9ee4ce190d78a3ffa4eb98616","target":"record","created_at":"2026-05-17T23:59:32Z","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":"08d7434d9e6ef9b8e0d32828cce6bd99be8f31231e62cbbe0d35d3af9e9a6c49","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T03:05:08Z","title_canon_sha256":"a30bfbb098e02efaf810ae6bb09d3ef780c4ff45e4c03b904981f7b188420b3a"},"schema_version":"1.0","source":{"id":"1809.02288","kind":"arxiv","version":2}},"canonical_sha256":"0d7c183cda7e0f4cffe9a42578fb3e2bb1fd652441c5dbe34f70eec2069f232f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d7c183cda7e0f4cffe9a42578fb3e2bb1fd652441c5dbe34f70eec2069f232f","first_computed_at":"2026-05-17T23:59:32.236169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:32.236169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N9HujpZ8uzqdGMYcFWCgMV9w8+diE9deUagFAE4D+CSwkoOj6SNQuk6+R9+OSTEmz5DZAdY2gQ3bmsmIbqKJDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:32.236862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02288","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2886efba6a20ab3cff5cfb9df53326c1e93a79f9ee4ce190d78a3ffa4eb98616","sha256:04b2160fb6a092ceb86bb434700afdb12ef112687876ee36ccaee598cf4fd00e"],"state_sha256":"e6be099d7bbc4eb4ed7d501b820e95092d340a6a06512806e1ab1ebf60896373"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBP0b3YBxESu2NqGCWYaBHHfbSVQvpiIhEvzUEft7Ccy6we3mylm82xeEQyuS2iMocw44DOPTmD4ovRN/p8BDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:54:12.336603Z","bundle_sha256":"42a89dcddb4fcbbcb2bb19a306ff340b36e455efe4eca9754f2e9eb336c763c6"}}