{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:J2RH4N3SRWRCLKJ7A57RMU4TAG","short_pith_number":"pith:J2RH4N3S","schema_version":"1.0","canonical_sha256":"4ea27e37728da225a93f077f16539301947155a34e8fdb3c848377d26ac1006c","source":{"kind":"arxiv","id":"0805.4220","version":1},"attestation_state":"computed","paper":{"title":"Best subspace tensor approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"S. Friedland, V. Mehrmann","submitted_at":"2008-05-27T21:15:22Z","abstract_excerpt":"In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained via the singular value decomposition which allows to compute the best rank $k$ approximations. For $t$-tensors with $t>2$ many generalizations of the singular value decomposition have been proposed to obtain low tensor rank decompositions. In this paper we will present a different approach which is based on best subspace approximations, which present an alter"},"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":"0805.4220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-05-27T21:15:22Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"cc41405ed972f6aa59024a7d99c6f06fa8b29292648b8b891e94105199e1e90b","abstract_canon_sha256":"65879c939544a862b30922c52d2327620315906a02b686b930df37b2c8b3d630"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:06.488966Z","signature_b64":"L3OjEqv5JbSx4ZqBUy6nXU1xlYnN6315zBCtrv5mItfXZHVzbBV2g72UQ82D/ITC/g/Jk9fK58/wsCBeMmEyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ea27e37728da225a93f077f16539301947155a34e8fdb3c848377d26ac1006c","last_reissued_at":"2026-06-03T22:06:06.488549Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:06.488549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best subspace tensor approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"S. Friedland, V. Mehrmann","submitted_at":"2008-05-27T21:15:22Z","abstract_excerpt":"In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained via the singular value decomposition which allows to compute the best rank $k$ approximations. For $t$-tensors with $t>2$ many generalizations of the singular value decomposition have been proposed to obtain low tensor rank decompositions. In this paper we will present a different approach which is based on best subspace approximations, which present an alter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.4220","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/0805.4220/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":"0805.4220","created_at":"2026-06-03T22:06:06.488602+00:00"},{"alias_kind":"arxiv_version","alias_value":"0805.4220v1","created_at":"2026-06-03T22:06:06.488602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.4220","created_at":"2026-06-03T22:06:06.488602+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2RH4N3SRWRC","created_at":"2026-06-03T22:06:06.488602+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2RH4N3SRWRCLKJ7","created_at":"2026-06-03T22:06:06.488602+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2RH4N3S","created_at":"2026-06-03T22:06:06.488602+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/J2RH4N3SRWRCLKJ7A57RMU4TAG","json":"https://pith.science/pith/J2RH4N3SRWRCLKJ7A57RMU4TAG.json","graph_json":"https://pith.science/api/pith-number/J2RH4N3SRWRCLKJ7A57RMU4TAG/graph.json","events_json":"https://pith.science/api/pith-number/J2RH4N3SRWRCLKJ7A57RMU4TAG/events.json","paper":"https://pith.science/paper/J2RH4N3S"},"agent_actions":{"view_html":"https://pith.science/pith/J2RH4N3SRWRCLKJ7A57RMU4TAG","download_json":"https://pith.science/pith/J2RH4N3SRWRCLKJ7A57RMU4TAG.json","view_paper":"https://pith.science/paper/J2RH4N3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0805.4220&json=true","fetch_graph":"https://pith.science/api/pith-number/J2RH4N3SRWRCLKJ7A57RMU4TAG/graph.json","fetch_events":"https://pith.science/api/pith-number/J2RH4N3SRWRCLKJ7A57RMU4TAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2RH4N3SRWRCLKJ7A57RMU4TAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2RH4N3SRWRCLKJ7A57RMU4TAG/action/storage_attestation","attest_author":"https://pith.science/pith/J2RH4N3SRWRCLKJ7A57RMU4TAG/action/author_attestation","sign_citation":"https://pith.science/pith/J2RH4N3SRWRCLKJ7A57RMU4TAG/action/citation_signature","submit_replication":"https://pith.science/pith/J2RH4N3SRWRCLKJ7A57RMU4TAG/action/replication_record"}},"created_at":"2026-06-03T22:06:06.488602+00:00","updated_at":"2026-06-03T22:06:06.488602+00:00"}