{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2YF4OMFWZPM562HDTU2T6HTBOG","short_pith_number":"pith:2YF4OMFW","schema_version":"1.0","canonical_sha256":"d60bc730b6cbd9df68e39d353f1e617180a358f2fd8c8072a0481231fb381b97","source":{"kind":"arxiv","id":"1807.02513","version":3},"attestation_state":"computed","paper":{"title":"On Algorithms for and Computing with the Tensor Ring Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Oscar Mickelin, Sertac Karaman","submitted_at":"2018-07-06T17:58:45Z","abstract_excerpt":"Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension instead of exponential scaling. In this paper, we investigate even lower storage-cost representations in the tensor ring format, which is an extension of the tensor train format with variable end-ranks. Firstly, we introduce two algorithms for converting a tensor in full format to tensor ring format with low storage cost. Secondly, we detail a rounding operation "},"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":"1807.02513","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-06T17:58:45Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"fc4540c5510a660af6d6384813469ff8ff8e3873b403773bff7719a834742f27","abstract_canon_sha256":"4cac7bb8a5ce2c86a59bec18bbd22634ba3ebd35f248ea970f2027708ba22d62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:08.880155Z","signature_b64":"vYaa3n5nm8Apd5Ajacub2n6NkQdzUWPnuI3RmSWLLG/3tRL6iG4dIY+78Tmb3PZ9SeT5seFgUQxQI+RoOwYNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d60bc730b6cbd9df68e39d353f1e617180a358f2fd8c8072a0481231fb381b97","last_reissued_at":"2026-07-05T00:39:08.879653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:08.879653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Algorithms for and Computing with the Tensor Ring Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Oscar Mickelin, Sertac Karaman","submitted_at":"2018-07-06T17:58:45Z","abstract_excerpt":"Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension instead of exponential scaling. In this paper, we investigate even lower storage-cost representations in the tensor ring format, which is an extension of the tensor train format with variable end-ranks. Firstly, we introduce two algorithms for converting a tensor in full format to tensor ring format with low storage cost. Secondly, we detail a rounding operation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02513","kind":"arxiv","version":3},"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/1807.02513/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.02513","created_at":"2026-07-05T00:39:08.879718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02513v3","created_at":"2026-07-05T00:39:08.879718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02513","created_at":"2026-07-05T00:39:08.879718+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YF4OMFWZPM5","created_at":"2026-07-05T00:39:08.879718+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YF4OMFWZPM562HD","created_at":"2026-07-05T00:39:08.879718+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YF4OMFW","created_at":"2026-07-05T00:39:08.879718+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG","json":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG.json","graph_json":"https://pith.science/api/pith-number/2YF4OMFWZPM562HDTU2T6HTBOG/graph.json","events_json":"https://pith.science/api/pith-number/2YF4OMFWZPM562HDTU2T6HTBOG/events.json","paper":"https://pith.science/paper/2YF4OMFW"},"agent_actions":{"view_html":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG","download_json":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG.json","view_paper":"https://pith.science/paper/2YF4OMFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02513&json=true","fetch_graph":"https://pith.science/api/pith-number/2YF4OMFWZPM562HDTU2T6HTBOG/graph.json","fetch_events":"https://pith.science/api/pith-number/2YF4OMFWZPM562HDTU2T6HTBOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG/action/storage_attestation","attest_author":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG/action/author_attestation","sign_citation":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG/action/citation_signature","submit_replication":"https://pith.science/pith/2YF4OMFWZPM562HDTU2T6HTBOG/action/replication_record"}},"created_at":"2026-07-05T00:39:08.879718+00:00","updated_at":"2026-07-05T00:39:08.879718+00:00"}