{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4ZZ5RWTMI3MEMAI6JRF6QKOJVI","short_pith_number":"pith:4ZZ5RWTM","schema_version":"1.0","canonical_sha256":"e673d8da6c46d846011e4c4be829c9aa3163c23dab670e41a9260b1cd9f39387","source":{"kind":"arxiv","id":"1405.2096","version":1},"attestation_state":"computed","paper":{"title":"Optimization on the Hierarchical Tucker manifold - applications to tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Curt Da Silva, Felix J. Herrmann","submitted_at":"2014-05-08T20:49:51Z","abstract_excerpt":"In this work, we develop an optimization framework for problems whose solutions are well-approximated by Hierarchical Tucker (HT) tensors, an efficient structured tensor format based on recursive subspace factorizations. By exploiting the smooth manifold structure of these tensors, we construct standard optimization algorithms such as Steepest Descent and Conjugate Gradient for completing tensors from missing entries. Our algorithmic framework is fast and scalable to large problem sizes as we do not require SVDs on the ambient tensor space, as required by other methods. Moreover, we exploit th"},"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":"1405.2096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-05-08T20:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"a8fa2d7a31d1b920274823f4b700aa9b15e418e5284179978a8f59fbf4e6331f","abstract_canon_sha256":"4f861df0fc9d10acaf060a506f8cc2b87745c5f1a2c55aec89ca9e40d802c41b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:13.702959Z","signature_b64":"BB3oYNXf8InLQmGbTw3UpooUDi3sanrh/2IecYXFir8g5w6L0B3exS7ArPP81E40XBaRztHTWUoXs53H+faaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e673d8da6c46d846011e4c4be829c9aa3163c23dab670e41a9260b1cd9f39387","last_reissued_at":"2026-05-18T02:52:13.702306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:13.702306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization on the Hierarchical Tucker manifold - applications to tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Curt Da Silva, Felix J. Herrmann","submitted_at":"2014-05-08T20:49:51Z","abstract_excerpt":"In this work, we develop an optimization framework for problems whose solutions are well-approximated by Hierarchical Tucker (HT) tensors, an efficient structured tensor format based on recursive subspace factorizations. By exploiting the smooth manifold structure of these tensors, we construct standard optimization algorithms such as Steepest Descent and Conjugate Gradient for completing tensors from missing entries. Our algorithmic framework is fast and scalable to large problem sizes as we do not require SVDs on the ambient tensor space, as required by other methods. Moreover, we exploit th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2096","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":""},"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":"1405.2096","created_at":"2026-05-18T02:52:13.702424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2096v1","created_at":"2026-05-18T02:52:13.702424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2096","created_at":"2026-05-18T02:52:13.702424+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZZ5RWTMI3ME","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZZ5RWTMI3MEMAI6","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZZ5RWTM","created_at":"2026-05-18T12:28:14.216126+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/4ZZ5RWTMI3MEMAI6JRF6QKOJVI","json":"https://pith.science/pith/4ZZ5RWTMI3MEMAI6JRF6QKOJVI.json","graph_json":"https://pith.science/api/pith-number/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/graph.json","events_json":"https://pith.science/api/pith-number/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/events.json","paper":"https://pith.science/paper/4ZZ5RWTM"},"agent_actions":{"view_html":"https://pith.science/pith/4ZZ5RWTMI3MEMAI6JRF6QKOJVI","download_json":"https://pith.science/pith/4ZZ5RWTMI3MEMAI6JRF6QKOJVI.json","view_paper":"https://pith.science/paper/4ZZ5RWTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2096&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/action/storage_attestation","attest_author":"https://pith.science/pith/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/action/author_attestation","sign_citation":"https://pith.science/pith/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/action/citation_signature","submit_replication":"https://pith.science/pith/4ZZ5RWTMI3MEMAI6JRF6QKOJVI/action/replication_record"}},"created_at":"2026-05-18T02:52:13.702424+00:00","updated_at":"2026-05-18T02:52:13.702424+00:00"}