{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DRQPYUF5WJBLJX5D27BNKR4EO2","short_pith_number":"pith:DRQPYUF5","canonical_record":{"source":{"id":"1708.00132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-01T02:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"d35aac6cb5839c818a69452e75b0f90f7d872067003008637ed3ce12bc3bc9f7","abstract_canon_sha256":"f172117b2ff93603ecfd9ce61268ea2639462d0c211b5b95d413eb9d21019582"},"schema_version":"1.0"},"canonical_sha256":"1c60fc50bdb242b4dfa3d7c2d5478476a741d140f30c5fbc19e4987f56b429b2","source":{"kind":"arxiv","id":"1708.00132","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00132","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00132v2","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00132","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"DRQPYUF5WJBL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRQPYUF5WJBLJX5D","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRQPYUF5","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DRQPYUF5WJBLJX5D27BNKR4EO2","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-01T02:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"d35aac6cb5839c818a69452e75b0f90f7d872067003008637ed3ce12bc3bc9f7","abstract_canon_sha256":"f172117b2ff93603ecfd9ce61268ea2639462d0c211b5b95d413eb9d21019582"},"schema_version":"1.0"},"canonical_sha256":"1c60fc50bdb242b4dfa3d7c2d5478476a741d140f30c5fbc19e4987f56b429b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:45.688174Z","signature_b64":"48uG7NsXpy1xfIFSddblKv54w5ucTH0boGl236e04q3bBjdtU8tIyklEfSQ2nEKfw6iFsPsvDPIZHt77IUgeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c60fc50bdb242b4dfa3d7c2d5478476a741d140f30c5fbc19e4987f56b429b2","last_reissued_at":"2026-05-18T00:38:45.687587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:45.687587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00132","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-18T00:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sj67Akx/FzRhkEuzXsljNOq7nq7QEFGhQQly7PTbwcpp4ezaJ57Y6SaVdyvS76VfoemzJZ150Ct+8tdpGSaoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:19:45.914441Z"},"content_sha256":"8b66f6cbf79ac07f2d8b34772625ee885f6f85c2f24c7123bf050987aba79a0f","schema_version":"1.0","event_id":"sha256:8b66f6cbf79ac07f2d8b34772625ee885f6f85c2f24c7123bf050987aba79a0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DRQPYUF5WJBLJX5D27BNKR4EO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Kohei Hayashi, Masaaki Imaizumi, Takanori Maehara","submitted_at":"2017-08-01T02:18:41Z","abstract_excerpt":"Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of statistical theory and of scalable algorithms. In this paper, we address the limitations. First, we introduce a convex relaxation of the TT decomposition problem and derive its error bound for the tensor completion task. Next, we develop an alternating optimization method with a randomization technique, in which the time complexity is as efficient as the space compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00132","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-18T00:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTy9X1h/LWqApNU2lkQdUelikIAe0ycODVCiAo4MWOigBvznkEVa4U1N4ycP8ykhMm0qcI0n0gKZQKzP9RcSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:19:45.915058Z"},"content_sha256":"235deab15b58640416621317106ae2aef30b1b940241722de0f4f4a83b32bad2","schema_version":"1.0","event_id":"sha256:235deab15b58640416621317106ae2aef30b1b940241722de0f4f4a83b32bad2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRQPYUF5WJBLJX5D27BNKR4EO2/bundle.json","state_url":"https://pith.science/pith/DRQPYUF5WJBLJX5D27BNKR4EO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRQPYUF5WJBLJX5D27BNKR4EO2/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-06T02:19:45Z","links":{"resolver":"https://pith.science/pith/DRQPYUF5WJBLJX5D27BNKR4EO2","bundle":"https://pith.science/pith/DRQPYUF5WJBLJX5D27BNKR4EO2/bundle.json","state":"https://pith.science/pith/DRQPYUF5WJBLJX5D27BNKR4EO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRQPYUF5WJBLJX5D27BNKR4EO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DRQPYUF5WJBLJX5D27BNKR4EO2","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":"f172117b2ff93603ecfd9ce61268ea2639462d0c211b5b95d413eb9d21019582","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-01T02:18:41Z","title_canon_sha256":"d35aac6cb5839c818a69452e75b0f90f7d872067003008637ed3ce12bc3bc9f7"},"schema_version":"1.0","source":{"id":"1708.00132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00132","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00132v2","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00132","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"DRQPYUF5WJBL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRQPYUF5WJBLJX5D","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRQPYUF5","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:235deab15b58640416621317106ae2aef30b1b940241722de0f4f4a83b32bad2","target":"graph","created_at":"2026-05-18T00:38:45Z","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":"Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of statistical theory and of scalable algorithms. In this paper, we address the limitations. First, we introduce a convex relaxation of the TT decomposition problem and derive its error bound for the tensor completion task. Next, we develop an alternating optimization method with a randomization technique, in which the time complexity is as efficient as the space compl","authors_text":"Kohei Hayashi, Masaaki Imaizumi, Takanori Maehara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-01T02:18:41Z","title":"On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00132","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:8b66f6cbf79ac07f2d8b34772625ee885f6f85c2f24c7123bf050987aba79a0f","target":"record","created_at":"2026-05-18T00:38:45Z","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":"f172117b2ff93603ecfd9ce61268ea2639462d0c211b5b95d413eb9d21019582","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-01T02:18:41Z","title_canon_sha256":"d35aac6cb5839c818a69452e75b0f90f7d872067003008637ed3ce12bc3bc9f7"},"schema_version":"1.0","source":{"id":"1708.00132","kind":"arxiv","version":2}},"canonical_sha256":"1c60fc50bdb242b4dfa3d7c2d5478476a741d140f30c5fbc19e4987f56b429b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c60fc50bdb242b4dfa3d7c2d5478476a741d140f30c5fbc19e4987f56b429b2","first_computed_at":"2026-05-18T00:38:45.687587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:45.687587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"48uG7NsXpy1xfIFSddblKv54w5ucTH0boGl236e04q3bBjdtU8tIyklEfSQ2nEKfw6iFsPsvDPIZHt77IUgeDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:45.688174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b66f6cbf79ac07f2d8b34772625ee885f6f85c2f24c7123bf050987aba79a0f","sha256:235deab15b58640416621317106ae2aef30b1b940241722de0f4f4a83b32bad2"],"state_sha256":"464ade3df03a540edbc0b49862a0282ff66fc80a2d699c55abdbd0639e3f3a4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ByglhfiT0dkjhgZEP6HrJQ++QBNM5BxnMp5o/BOi0QCZP4oq+TjtNgi4StKZd2sVVMSWZSF4yIpq1Y4OzzvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:19:45.921615Z","bundle_sha256":"81b3c2744ab101c98e79064108326c29fc47967008b0bd214953a0288981ccef"}}