{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IU5QVPLOYNVGOPTJNVMYBWDFGA","short_pith_number":"pith:IU5QVPLO","schema_version":"1.0","canonical_sha256":"453b0abd6ec36a673e696d5980d865303246f9428c72850effd328d2288a38bf","source":{"kind":"arxiv","id":"2011.13395","version":1},"attestation_state":"computed","paper":{"title":"Second-order optimization for tensors with fixed tensor-train rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Psenka, Nicolas Boumal","submitted_at":"2020-11-26T17:16:52Z","abstract_excerpt":"There are several different notions of \"low rank\" for tensors, associated to different formats. Among them, the Tensor Train (TT) format is particularly well suited for tensors of high order, as it circumvents the curse of dimensionality: an appreciable property for certain high-dimensional applications. It is often convenient to model such applications as optimization over the set of tensors with fixed (and low) TT rank. That set is a smooth manifold. Exploiting this fact, others have shown that Riemannian optimization techniques can perform particularly well on tasks such as tensor completio"},"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":"2011.13395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-26T17:16:52Z","cross_cats_sorted":[],"title_canon_sha256":"7ccad9154ea903631be52c2ece1a0b53efec9010c00c3b666f5c309d5f800b5d","abstract_canon_sha256":"685e0f9cc44751262ae6ea3e0b8be9275a66828c602e174ecd5e797cf6e13e1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:53.778815Z","signature_b64":"W717rgACdhHlU+5fgqVd8J6IF3gdDId44521n92pCBmr9BCeT750YHnBEDgqHTMMvWTQikzqlq+GemvdAwtBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"453b0abd6ec36a673e696d5980d865303246f9428c72850effd328d2288a38bf","last_reissued_at":"2026-07-05T01:54:53.778191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:53.778191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Second-order optimization for tensors with fixed tensor-train rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Psenka, Nicolas Boumal","submitted_at":"2020-11-26T17:16:52Z","abstract_excerpt":"There are several different notions of \"low rank\" for tensors, associated to different formats. Among them, the Tensor Train (TT) format is particularly well suited for tensors of high order, as it circumvents the curse of dimensionality: an appreciable property for certain high-dimensional applications. It is often convenient to model such applications as optimization over the set of tensors with fixed (and low) TT rank. That set is a smooth manifold. Exploiting this fact, others have shown that Riemannian optimization techniques can perform particularly well on tasks such as tensor completio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13395","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/2011.13395/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":"2011.13395","created_at":"2026-07-05T01:54:53.778271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.13395v1","created_at":"2026-07-05T01:54:53.778271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13395","created_at":"2026-07-05T01:54:53.778271+00:00"},{"alias_kind":"pith_short_12","alias_value":"IU5QVPLOYNVG","created_at":"2026-07-05T01:54:53.778271+00:00"},{"alias_kind":"pith_short_16","alias_value":"IU5QVPLOYNVGOPTJ","created_at":"2026-07-05T01:54:53.778271+00:00"},{"alias_kind":"pith_short_8","alias_value":"IU5QVPLO","created_at":"2026-07-05T01:54:53.778271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30173","citing_title":"Low-Rank Tensor Completion using Tensor Train Decomposition via Riemannian Optimization on the Quotient Geometry","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA","json":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA.json","graph_json":"https://pith.science/api/pith-number/IU5QVPLOYNVGOPTJNVMYBWDFGA/graph.json","events_json":"https://pith.science/api/pith-number/IU5QVPLOYNVGOPTJNVMYBWDFGA/events.json","paper":"https://pith.science/paper/IU5QVPLO"},"agent_actions":{"view_html":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA","download_json":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA.json","view_paper":"https://pith.science/paper/IU5QVPLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.13395&json=true","fetch_graph":"https://pith.science/api/pith-number/IU5QVPLOYNVGOPTJNVMYBWDFGA/graph.json","fetch_events":"https://pith.science/api/pith-number/IU5QVPLOYNVGOPTJNVMYBWDFGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA/action/storage_attestation","attest_author":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA/action/author_attestation","sign_citation":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA/action/citation_signature","submit_replication":"https://pith.science/pith/IU5QVPLOYNVGOPTJNVMYBWDFGA/action/replication_record"}},"created_at":"2026-07-05T01:54:53.778271+00:00","updated_at":"2026-07-05T01:54:53.778271+00:00"}