{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WWXL6OV2P3OXEOUTRQBLKMKZMG","short_pith_number":"pith:WWXL6OV2","schema_version":"1.0","canonical_sha256":"b5aebf3aba7edd723a938c02b5315961863bb0bc2c77ad4b760292d144ae822a","source":{"kind":"arxiv","id":"2501.13385","version":1},"attestation_state":"computed","paper":{"title":"Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Fengmiao Bian, Jian-Feng Cai, Xiaoqun Zhang, Yuanwei Zhang","submitted_at":"2025-01-23T05:03:50Z","abstract_excerpt":"Low-rank tensor completion aims to recover a tensor from partially observed entries, and it is widely applicable in fields such as quantum computing and image processing. Due to the significant advantages of the tensor train (TT) format in handling structured high-order tensors, this paper investigates the low-rank tensor completion problem based on the TT-format. We proposed a preconditioned Riemannian gradient descent algorithm (PRGD) to solve low TT-rank tensor completion and establish its linear convergence. Experimental results on both simulated and real datasets demonstrate the effective"},"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":"2501.13385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-23T05:03:50Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"6c736bd6d40386937c1062a43b4ff11bf0979e88e83a1cda1c02390ea9cfb6fb","abstract_canon_sha256":"3f363cf04ae11450aa993ee3069fddc1da59ed771c7e24486f3cbb036a59dbad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:27.696116Z","signature_b64":"ThuBeWhcxjYw5SUiIhsoR8laY8qR/qT7JY+jXm0jTI+UvTJsgRn7LHpnzowYpsrQx0WlNgryZfP7yPHEpVuRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5aebf3aba7edd723a938c02b5315961863bb0bc2c77ad4b760292d144ae822a","last_reissued_at":"2026-07-05T10:04:27.695618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:27.695618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Fengmiao Bian, Jian-Feng Cai, Xiaoqun Zhang, Yuanwei Zhang","submitted_at":"2025-01-23T05:03:50Z","abstract_excerpt":"Low-rank tensor completion aims to recover a tensor from partially observed entries, and it is widely applicable in fields such as quantum computing and image processing. Due to the significant advantages of the tensor train (TT) format in handling structured high-order tensors, this paper investigates the low-rank tensor completion problem based on the TT-format. We proposed a preconditioned Riemannian gradient descent algorithm (PRGD) to solve low TT-rank tensor completion and establish its linear convergence. Experimental results on both simulated and real datasets demonstrate the effective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13385","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/2501.13385/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":"2501.13385","created_at":"2026-07-05T10:04:27.695674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13385v1","created_at":"2026-07-05T10:04:27.695674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13385","created_at":"2026-07-05T10:04:27.695674+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWXL6OV2P3OX","created_at":"2026-07-05T10:04:27.695674+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWXL6OV2P3OXEOUT","created_at":"2026-07-05T10:04:27.695674+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWXL6OV2","created_at":"2026-07-05T10:04:27.695674+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04533","citing_title":"Online Riemannian Gradient Descent for Quantum State Tomography with Matrix Product Operators","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG","json":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG.json","graph_json":"https://pith.science/api/pith-number/WWXL6OV2P3OXEOUTRQBLKMKZMG/graph.json","events_json":"https://pith.science/api/pith-number/WWXL6OV2P3OXEOUTRQBLKMKZMG/events.json","paper":"https://pith.science/paper/WWXL6OV2"},"agent_actions":{"view_html":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG","download_json":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG.json","view_paper":"https://pith.science/paper/WWXL6OV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13385&json=true","fetch_graph":"https://pith.science/api/pith-number/WWXL6OV2P3OXEOUTRQBLKMKZMG/graph.json","fetch_events":"https://pith.science/api/pith-number/WWXL6OV2P3OXEOUTRQBLKMKZMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG/action/storage_attestation","attest_author":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG/action/author_attestation","sign_citation":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG/action/citation_signature","submit_replication":"https://pith.science/pith/WWXL6OV2P3OXEOUTRQBLKMKZMG/action/replication_record"}},"created_at":"2026-07-05T10:04:27.695674+00:00","updated_at":"2026-07-05T10:04:27.695674+00:00"}