{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2JIW3I6UUHYCVU6LDPLOHGGNDR","short_pith_number":"pith:2JIW3I6U","canonical_record":{"source":{"id":"1707.08184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-23T06:46:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3fa194a5a3986aac0e218df59551ab34857dd7415e4a91c5f0739f5a1510ab05","abstract_canon_sha256":"1b09bc378c45fedf876e3b7d607a56a034611ae009bda5e96e001db8a9f27c90"},"schema_version":"1.0"},"canonical_sha256":"d2516da3d4a1f02ad3cb1bd6e398cd1c50a7c352730d3f6c850abd1f75888761","source":{"kind":"arxiv","id":"1707.08184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08184","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08184v1","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08184","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"2JIW3I6UUHYC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2JIW3I6UUHYCVU6L","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2JIW3I6U","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2JIW3I6UUHYCVU6LDPLOHGGNDR","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-23T06:46:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3fa194a5a3986aac0e218df59551ab34857dd7415e4a91c5f0739f5a1510ab05","abstract_canon_sha256":"1b09bc378c45fedf876e3b7d607a56a034611ae009bda5e96e001db8a9f27c90"},"schema_version":"1.0"},"canonical_sha256":"d2516da3d4a1f02ad3cb1bd6e398cd1c50a7c352730d3f6c850abd1f75888761","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:25.074865Z","signature_b64":"oa6z/I64rrvTJAA8XT/CZppW3ZtEAPByTAfB6nJbCZoXAInO2HaEsD+NgCmJy5GQvgL8jfONoLOCXmltf99jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2516da3d4a1f02ad3cb1bd6e398cd1c50a7c352730d3f6c850abd1f75888761","last_reissued_at":"2026-05-18T00:39:25.074096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:25.074096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08184","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-18T00:39:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pk0oU6ypcgrnG7KvSWqotNUFOQKF3xdqryvfkoCjC2DGsOFZPGeFG/mRW1cGxcpGCnF9ocqzbcxKPPz764KtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:03:53.632287Z"},"content_sha256":"6f45b5ad80fc473c9a4cd42814ccdc34c5a6ec77b9be3a820234d02e7703b84c","schema_version":"1.0","event_id":"sha256:6f45b5ad80fc473c9a4cd42814ccdc34c5a6ec77b9be3a820234d02e7703b84c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2JIW3I6UUHYCVU6LDPLOHGGNDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Low Rank Tensor Ring Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Shuchin Aeron, Vaneet Aggarwal, Wenqi Wang","submitted_at":"2017-07-23T06:46:08Z","abstract_excerpt":"Using the matrix product state (MPS) representation of the recently proposed tensor ring decompositions, in this paper we propose a tensor completion algorithm, which is an alternating minimization algorithm that alternates over the factors in the MPS representation. This development is motivated in part by the success of matrix completion algorithms that alternate over the (low-rank) factors. In this paper, we propose a spectral initialization for the tensor ring completion algorithm and analyze the computational complexity of the proposed algorithm. We numerically compare it with existing me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08184","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-18T00:39:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjvbHCk4hszCnCC/3qIG2BThsOcyzmiS/EQuZCK7njoJqokzetZUzhDhkiFu9mnDtcQESFFWYBbD2tgqJN8HAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:03:53.633004Z"},"content_sha256":"11e17b59f94a14a2e83b38c797222b6a4f68cfc953056c9a73aa259b0975a44e","schema_version":"1.0","event_id":"sha256:11e17b59f94a14a2e83b38c797222b6a4f68cfc953056c9a73aa259b0975a44e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JIW3I6UUHYCVU6LDPLOHGGNDR/bundle.json","state_url":"https://pith.science/pith/2JIW3I6UUHYCVU6LDPLOHGGNDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JIW3I6UUHYCVU6LDPLOHGGNDR/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-07T17:03:53Z","links":{"resolver":"https://pith.science/pith/2JIW3I6UUHYCVU6LDPLOHGGNDR","bundle":"https://pith.science/pith/2JIW3I6UUHYCVU6LDPLOHGGNDR/bundle.json","state":"https://pith.science/pith/2JIW3I6UUHYCVU6LDPLOHGGNDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JIW3I6UUHYCVU6LDPLOHGGNDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2JIW3I6UUHYCVU6LDPLOHGGNDR","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":"1b09bc378c45fedf876e3b7d607a56a034611ae009bda5e96e001db8a9f27c90","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-23T06:46:08Z","title_canon_sha256":"3fa194a5a3986aac0e218df59551ab34857dd7415e4a91c5f0739f5a1510ab05"},"schema_version":"1.0","source":{"id":"1707.08184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08184","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08184v1","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08184","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"2JIW3I6UUHYC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2JIW3I6UUHYCVU6L","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2JIW3I6U","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:11e17b59f94a14a2e83b38c797222b6a4f68cfc953056c9a73aa259b0975a44e","target":"graph","created_at":"2026-05-18T00:39:25Z","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":"Using the matrix product state (MPS) representation of the recently proposed tensor ring decompositions, in this paper we propose a tensor completion algorithm, which is an alternating minimization algorithm that alternates over the factors in the MPS representation. This development is motivated in part by the success of matrix completion algorithms that alternate over the (low-rank) factors. In this paper, we propose a spectral initialization for the tensor ring completion algorithm and analyze the computational complexity of the proposed algorithm. We numerically compare it with existing me","authors_text":"Shuchin Aeron, Vaneet Aggarwal, Wenqi Wang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-23T06:46:08Z","title":"Efficient Low Rank Tensor Ring Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08184","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:6f45b5ad80fc473c9a4cd42814ccdc34c5a6ec77b9be3a820234d02e7703b84c","target":"record","created_at":"2026-05-18T00:39:25Z","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":"1b09bc378c45fedf876e3b7d607a56a034611ae009bda5e96e001db8a9f27c90","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-23T06:46:08Z","title_canon_sha256":"3fa194a5a3986aac0e218df59551ab34857dd7415e4a91c5f0739f5a1510ab05"},"schema_version":"1.0","source":{"id":"1707.08184","kind":"arxiv","version":1}},"canonical_sha256":"d2516da3d4a1f02ad3cb1bd6e398cd1c50a7c352730d3f6c850abd1f75888761","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2516da3d4a1f02ad3cb1bd6e398cd1c50a7c352730d3f6c850abd1f75888761","first_computed_at":"2026-05-18T00:39:25.074096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:25.074096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oa6z/I64rrvTJAA8XT/CZppW3ZtEAPByTAfB6nJbCZoXAInO2HaEsD+NgCmJy5GQvgL8jfONoLOCXmltf99jBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:25.074865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f45b5ad80fc473c9a4cd42814ccdc34c5a6ec77b9be3a820234d02e7703b84c","sha256:11e17b59f94a14a2e83b38c797222b6a4f68cfc953056c9a73aa259b0975a44e"],"state_sha256":"8a046ef6f678e1ce96cbf501f880ce60a7bd2385a7c42560743bc0a6499577cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3hUEEG0MA4mvWhqUTNHvJHwHUXgYvi4f3AP4JYq/Am6zFO8N+05vCQkge+0cCfkdvMqpuLaXQOnhkzdqwVODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:03:53.637223Z","bundle_sha256":"df644193bb2889035758ac947f2052ca9adf4ed1a4ea83e6da07323c69d804fd"}}