{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JI7FH3XCELXUYC32AAXGZACAHI","short_pith_number":"pith:JI7FH3XC","schema_version":"1.0","canonical_sha256":"4a3e53eee222ef4c0b7a002e6c80403a305411dbcfd4d851fd490b11602662ec","source":{"kind":"arxiv","id":"2508.06693","version":1},"attestation_state":"computed","paper":{"title":"A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Matthew Fahrbach, Mehrdad Ghadiri","submitted_at":"2025-08-08T20:34:57Z","abstract_excerpt":"We prove that the classic approximation guarantee for the higher-order singular value decomposition (HOSVD) is tight by constructing a tensor for which HOSVD achieves an approximation ratio of $N/(1+\\varepsilon)$, for any $\\varepsilon > 0$. This matches the upper bound of De Lathauwer et al. (2000a) and shows that the approximation ratio of HOSVD cannot be improved. Using a more advanced construction, we also prove that the approximation guarantees for the ST-HOSVD algorithm of Vannieuwenhoven et al. (2012) and higher-order orthogonal iteration (HOOI) of De Lathauwer et al. (2000b) are tight b"},"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":"2508.06693","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-08T20:34:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"53bc458ab529172ab2c990f9f5d7eb73fe163269e1a177acc922f0ef4ef9da65","abstract_canon_sha256":"ff36ef15527e9f0410e5a60a2ab55a48529aac2f669902fe84e460a12ad26174"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:05.078778Z","signature_b64":"Pxql+DSuM63x1n/tU3nlmfblDYG458ME/ve3M/d6SXVovhNejJgi3K9NfogHeKe50DXP7Nu4CghgaHrWU7AUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3e53eee222ef4c0b7a002e6c80403a305411dbcfd4d851fd490b11602662ec","last_reissued_at":"2026-07-05T11:51:05.078331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:05.078331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Matthew Fahrbach, Mehrdad Ghadiri","submitted_at":"2025-08-08T20:34:57Z","abstract_excerpt":"We prove that the classic approximation guarantee for the higher-order singular value decomposition (HOSVD) is tight by constructing a tensor for which HOSVD achieves an approximation ratio of $N/(1+\\varepsilon)$, for any $\\varepsilon > 0$. This matches the upper bound of De Lathauwer et al. (2000a) and shows that the approximation ratio of HOSVD cannot be improved. Using a more advanced construction, we also prove that the approximation guarantees for the ST-HOSVD algorithm of Vannieuwenhoven et al. (2012) and higher-order orthogonal iteration (HOOI) of De Lathauwer et al. (2000b) are tight b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06693","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/2508.06693/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":"2508.06693","created_at":"2026-07-05T11:51:05.078390+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.06693v1","created_at":"2026-07-05T11:51:05.078390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06693","created_at":"2026-07-05T11:51:05.078390+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI7FH3XCELXU","created_at":"2026-07-05T11:51:05.078390+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI7FH3XCELXUYC32","created_at":"2026-07-05T11:51:05.078390+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI7FH3XC","created_at":"2026-07-05T11:51:05.078390+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/JI7FH3XCELXUYC32AAXGZACAHI","json":"https://pith.science/pith/JI7FH3XCELXUYC32AAXGZACAHI.json","graph_json":"https://pith.science/api/pith-number/JI7FH3XCELXUYC32AAXGZACAHI/graph.json","events_json":"https://pith.science/api/pith-number/JI7FH3XCELXUYC32AAXGZACAHI/events.json","paper":"https://pith.science/paper/JI7FH3XC"},"agent_actions":{"view_html":"https://pith.science/pith/JI7FH3XCELXUYC32AAXGZACAHI","download_json":"https://pith.science/pith/JI7FH3XCELXUYC32AAXGZACAHI.json","view_paper":"https://pith.science/paper/JI7FH3XC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.06693&json=true","fetch_graph":"https://pith.science/api/pith-number/JI7FH3XCELXUYC32AAXGZACAHI/graph.json","fetch_events":"https://pith.science/api/pith-number/JI7FH3XCELXUYC32AAXGZACAHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI7FH3XCELXUYC32AAXGZACAHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI7FH3XCELXUYC32AAXGZACAHI/action/storage_attestation","attest_author":"https://pith.science/pith/JI7FH3XCELXUYC32AAXGZACAHI/action/author_attestation","sign_citation":"https://pith.science/pith/JI7FH3XCELXUYC32AAXGZACAHI/action/citation_signature","submit_replication":"https://pith.science/pith/JI7FH3XCELXUYC32AAXGZACAHI/action/replication_record"}},"created_at":"2026-07-05T11:51:05.078390+00:00","updated_at":"2026-07-05T11:51:05.078390+00:00"}