{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7ZE2N5ERYNSIE7PA2RHCHMNEZY","short_pith_number":"pith:7ZE2N5ER","schema_version":"1.0","canonical_sha256":"fe49a6f491c364827de0d44e23b1a4ce1d7c988cb8b535f9ff9538e9c1368d94","source":{"kind":"arxiv","id":"1606.05535","version":1},"attestation_state":"computed","paper":{"title":"Tensor Ring Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS"],"primary_cat":"cs.NA","authors_text":"Andrzej Cichocki, Guoxu Zhou, Liqing Zhang, Qibin Zhao, Shengli Xie","submitted_at":"2016-06-17T14:40:18Z","abstract_excerpt":"Tensor networks have in recent years emerged as the powerful tools for solving the large-scale optimization problems. One of the most popular tensor network is tensor train (TT) decomposition that acts as the building blocks for the complicated tensor networks. However, the TT decomposition highly depends on permutations of tensor dimensions, due to its strictly sequential multilinear products over latent cores, which leads to difficulties in finding the optimal TT representation. In this paper, we introduce a fundamental tensor decomposition model to represent a large dimensional tensor by a "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.05535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-06-17T14:40:18Z","cross_cats_sorted":["cs.CV","cs.DS"],"title_canon_sha256":"cb12a0429432d60c8516cdf288c23f493643080a81aa17844dd411a30cf76d75","abstract_canon_sha256":"a701eae97121e230b5b1272b328b5c712a0452b1a639a0241c3a5cc624d98868"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:19.446814Z","signature_b64":"LvXb8xQn0hy9wNaSG3hHRQeIgTXjBzpDGOLVQf6aHnAuO2UNDnIT1OI0hdkblUpeVLdALHO3SP3wl7lc9WyeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe49a6f491c364827de0d44e23b1a4ce1d7c988cb8b535f9ff9538e9c1368d94","last_reissued_at":"2026-05-18T01:12:19.446467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:19.446467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Ring Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DS"],"primary_cat":"cs.NA","authors_text":"Andrzej Cichocki, Guoxu Zhou, Liqing Zhang, Qibin Zhao, Shengli Xie","submitted_at":"2016-06-17T14:40:18Z","abstract_excerpt":"Tensor networks have in recent years emerged as the powerful tools for solving the large-scale optimization problems. One of the most popular tensor network is tensor train (TT) decomposition that acts as the building blocks for the complicated tensor networks. However, the TT decomposition highly depends on permutations of tensor dimensions, due to its strictly sequential multilinear products over latent cores, which leads to difficulties in finding the optimal TT representation. In this paper, we introduce a fundamental tensor decomposition model to represent a large dimensional tensor by a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05535","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.05535","created_at":"2026-05-18T01:12:19.446530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05535v1","created_at":"2026-05-18T01:12:19.446530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05535","created_at":"2026-05-18T01:12:19.446530+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZE2N5ERYNSI","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZE2N5ERYNSIE7PA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZE2N5ER","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2605.16610","citing_title":"Tensor Cookbook: Mastering Tensors through Diagrams","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2511.01196","citing_title":"An Interdisciplinary and Cross-Task Review on Missing Data Imputation","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2511.16358","citing_title":"iFCTN: an intra-block Fully-Connected Tensor Network Decomposition for Tensor Completion","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2603.25132","citing_title":"Robust Principal Component Completion","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09438","citing_title":"fmxcoders: Factorized Masked Crosscoders for Cross-Layer Feature Discovery","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY","json":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY.json","graph_json":"https://pith.science/api/pith-number/7ZE2N5ERYNSIE7PA2RHCHMNEZY/graph.json","events_json":"https://pith.science/api/pith-number/7ZE2N5ERYNSIE7PA2RHCHMNEZY/events.json","paper":"https://pith.science/paper/7ZE2N5ER"},"agent_actions":{"view_html":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY","download_json":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY.json","view_paper":"https://pith.science/paper/7ZE2N5ER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05535&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZE2N5ERYNSIE7PA2RHCHMNEZY/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZE2N5ERYNSIE7PA2RHCHMNEZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY/action/storage_attestation","attest_author":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY/action/author_attestation","sign_citation":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY/action/citation_signature","submit_replication":"https://pith.science/pith/7ZE2N5ERYNSIE7PA2RHCHMNEZY/action/replication_record"}},"created_at":"2026-05-18T01:12:19.446530+00:00","updated_at":"2026-05-18T01:12:19.446530+00:00"}