{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BQGTKVHWAAWQPLD6WBJ4G4LSOZ","short_pith_number":"pith:BQGTKVHW","canonical_record":{"source":{"id":"2309.08093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-09-15T01:19:54Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"abfc632334f092e71d1f401f9a7f87445c0a9f45f08376631835d2983e22e176","abstract_canon_sha256":"2df3388a38243028cd8498ad94630b9adadaad78c289159d7d62724ff21ac0c0"},"schema_version":"1.0"},"canonical_sha256":"0c0d3554f6002d07ac7eb053c3717276494b02f2269755bc148273515081da57","source":{"kind":"arxiv","id":"2309.08093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.08093","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"2309.08093v1","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08093","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"BQGTKVHWAAWQ","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"pith_short_16","alias_value":"BQGTKVHWAAWQPLD6","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"pith_short_8","alias_value":"BQGTKVHW","created_at":"2026-07-05T06:51:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BQGTKVHWAAWQPLD6WBJ4G4LSOZ","target":"record","payload":{"canonical_record":{"source":{"id":"2309.08093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-09-15T01:19:54Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"abfc632334f092e71d1f401f9a7f87445c0a9f45f08376631835d2983e22e176","abstract_canon_sha256":"2df3388a38243028cd8498ad94630b9adadaad78c289159d7d62724ff21ac0c0"},"schema_version":"1.0"},"canonical_sha256":"0c0d3554f6002d07ac7eb053c3717276494b02f2269755bc148273515081da57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:01.721855Z","signature_b64":"f9g7OE31MjlzB9CBrPJQknmwjCTcvyK9vtk97TxEP8IQp2aI7s/2fBl7NWz57xjGa92rEe6rv44OtxI5EeGDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c0d3554f6002d07ac7eb053c3717276494b02f2269755bc148273515081da57","last_reissued_at":"2026-07-05T06:51:01.721399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:01.721399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.08093","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-07-05T06:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsoYLiivi+M4JNPsigRet7DIwNP56MIOV2KSejt2GvaDUvB19Na0YWYQ56Kml5nnGMCSxWtdAVRfT7hD3v3TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:31:10.084146Z"},"content_sha256":"8a4e88c5695a1825eb810100c50518cfe69c27bf704de1ca848059b9a2c49b09","schema_version":"1.0","event_id":"sha256:8a4e88c5695a1825eb810100c50518cfe69c27bf704de1ca848059b9a2c49b09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BQGTKVHWAAWQPLD6WBJ4G4LSOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank Tensor Train Decomposition Using TensorSketch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Gaohang Yu, Huilin Jiang, Liqun Qi, Zhongming Chen","submitted_at":"2023-09-15T01:19:54Z","abstract_excerpt":"Tensor train decomposition is one of the most powerful approaches for processing high-dimensional data. For low-rank tensor train decomposition of large tensors, the alternating least squares (ALS) algorithm is widely used by updating each core tensor alternatively. However, it may suffer from the curse of dimensionality due to the large scale of subproblems. In this paper, a novel randomized proximal ALS algorithm is proposed for low-rank tensor train decomposition by using TensorSketch, which allows for efficient implementation via fast Fourier transform. The theoretical lower bounds of sket"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08093","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.08093/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"},"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-07-05T06:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4NlwwKbgEkn0f0SR16Vd2EVbp9x2+VWMlzM/8JpK6lXGxYMTZNse7Ie9V4mynRalNLCI7IlZkDNx7E9b2sZCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:31:10.085262Z"},"content_sha256":"f747cce02da1c793b32a7a810e2ebb311951d8d80aa84dcb5bda7ed6f64cb6db","schema_version":"1.0","event_id":"sha256:f747cce02da1c793b32a7a810e2ebb311951d8d80aa84dcb5bda7ed6f64cb6db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQGTKVHWAAWQPLD6WBJ4G4LSOZ/bundle.json","state_url":"https://pith.science/pith/BQGTKVHWAAWQPLD6WBJ4G4LSOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQGTKVHWAAWQPLD6WBJ4G4LSOZ/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-08-06T04:31:10Z","links":{"resolver":"https://pith.science/pith/BQGTKVHWAAWQPLD6WBJ4G4LSOZ","bundle":"https://pith.science/pith/BQGTKVHWAAWQPLD6WBJ4G4LSOZ/bundle.json","state":"https://pith.science/pith/BQGTKVHWAAWQPLD6WBJ4G4LSOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQGTKVHWAAWQPLD6WBJ4G4LSOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BQGTKVHWAAWQPLD6WBJ4G4LSOZ","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":"2df3388a38243028cd8498ad94630b9adadaad78c289159d7d62724ff21ac0c0","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-09-15T01:19:54Z","title_canon_sha256":"abfc632334f092e71d1f401f9a7f87445c0a9f45f08376631835d2983e22e176"},"schema_version":"1.0","source":{"id":"2309.08093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.08093","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"2309.08093v1","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08093","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"BQGTKVHWAAWQ","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"pith_short_16","alias_value":"BQGTKVHWAAWQPLD6","created_at":"2026-07-05T06:51:01Z"},{"alias_kind":"pith_short_8","alias_value":"BQGTKVHW","created_at":"2026-07-05T06:51:01Z"}],"graph_snapshots":[{"event_id":"sha256:f747cce02da1c793b32a7a810e2ebb311951d8d80aa84dcb5bda7ed6f64cb6db","target":"graph","created_at":"2026-07-05T06:51:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.08093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Tensor train decomposition is one of the most powerful approaches for processing high-dimensional data. For low-rank tensor train decomposition of large tensors, the alternating least squares (ALS) algorithm is widely used by updating each core tensor alternatively. However, it may suffer from the curse of dimensionality due to the large scale of subproblems. In this paper, a novel randomized proximal ALS algorithm is proposed for low-rank tensor train decomposition by using TensorSketch, which allows for efficient implementation via fast Fourier transform. The theoretical lower bounds of sket","authors_text":"Gaohang Yu, Huilin Jiang, Liqun Qi, Zhongming Chen","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-09-15T01:19:54Z","title":"Low-rank Tensor Train Decomposition Using TensorSketch"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08093","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:8a4e88c5695a1825eb810100c50518cfe69c27bf704de1ca848059b9a2c49b09","target":"record","created_at":"2026-07-05T06:51:01Z","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":"2df3388a38243028cd8498ad94630b9adadaad78c289159d7d62724ff21ac0c0","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-09-15T01:19:54Z","title_canon_sha256":"abfc632334f092e71d1f401f9a7f87445c0a9f45f08376631835d2983e22e176"},"schema_version":"1.0","source":{"id":"2309.08093","kind":"arxiv","version":1}},"canonical_sha256":"0c0d3554f6002d07ac7eb053c3717276494b02f2269755bc148273515081da57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c0d3554f6002d07ac7eb053c3717276494b02f2269755bc148273515081da57","first_computed_at":"2026-07-05T06:51:01.721399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:51:01.721399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f9g7OE31MjlzB9CBrPJQknmwjCTcvyK9vtk97TxEP8IQp2aI7s/2fBl7NWz57xjGa92rEe6rv44OtxI5EeGDBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:51:01.721855Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.08093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a4e88c5695a1825eb810100c50518cfe69c27bf704de1ca848059b9a2c49b09","sha256:f747cce02da1c793b32a7a810e2ebb311951d8d80aa84dcb5bda7ed6f64cb6db"],"state_sha256":"d940632332dcc6503dc24b76302b0fca09e0aff9033f1f0cf4e2a57abc80251d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGs5mFAhhVFxWotVBklnDbxrlyK/So63OwiRDUs7AsdNeU+XCPCqDfUZ6jEVrquj0sU0H+6NAsjYpW3mCQlZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T04:31:10.092190Z","bundle_sha256":"d79040cae905eefdce0396a72b4e04671735f33d03dfdcab538cbf6d71ccb90a"}}