{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:D6VA4IT2RS4KBQHZRZJPJ3JSN4","short_pith_number":"pith:D6VA4IT2","schema_version":"1.0","canonical_sha256":"1faa0e227a8cb8a0c0f98e52f4ed326f112a431c588b94a3c8ed190c0531af56","source":{"kind":"arxiv","id":"1904.06455","version":1},"attestation_state":"computed","paper":{"title":"L1-norm Tucker Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","eess.SP"],"primary_cat":"cs.NA","authors_text":"Ashley Prater-Bennette, Dimitris G. Chachlakis, Panos P. Markopoulos","submitted_at":"2019-04-13T00:35:22Z","abstract_excerpt":"Tucker decomposition is a common method for the analysis of multi-way/tensor data. Standard Tucker has been shown to be sensitive against heavy corruptions, due to its L2-norm-based formulation which places squared emphasis to peripheral entries. In this work, we explore L1-Tucker, an L1-norm based reformulation of standard Tucker decomposition. After formulating the problem, we present two algorithms for its solution, namely L1-norm Higher-Order Singular Value Decomposition (L1-HOSVD) and L1-norm Higher-Order Orthogonal Iterations (L1-HOOI). The presented algorithms are accompanied by complex"},"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":"1904.06455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2019-04-13T00:35:22Z","cross_cats_sorted":["cs.DS","eess.SP"],"title_canon_sha256":"58a9d205bae34c5d2f39faf73189e6272c173b3b06726bc463b6889547e544e2","abstract_canon_sha256":"c539c039cdfab1aa1160315a017c7ea8637f2578826c2af9bebe09d869fca8e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:41.339663Z","signature_b64":"PnLsnO30gWB9YBS8PJdSOXu2mlHP+AeSpUZxllG638ehQuAdW2ixKATGHof9XT0ByzlBJvDd3SCSY06me01KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1faa0e227a8cb8a0c0f98e52f4ed326f112a431c588b94a3c8ed190c0531af56","last_reissued_at":"2026-05-17T23:48:41.338958Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:41.338958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L1-norm Tucker Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","eess.SP"],"primary_cat":"cs.NA","authors_text":"Ashley Prater-Bennette, Dimitris G. Chachlakis, Panos P. Markopoulos","submitted_at":"2019-04-13T00:35:22Z","abstract_excerpt":"Tucker decomposition is a common method for the analysis of multi-way/tensor data. Standard Tucker has been shown to be sensitive against heavy corruptions, due to its L2-norm-based formulation which places squared emphasis to peripheral entries. In this work, we explore L1-Tucker, an L1-norm based reformulation of standard Tucker decomposition. After formulating the problem, we present two algorithms for its solution, namely L1-norm Higher-Order Singular Value Decomposition (L1-HOSVD) and L1-norm Higher-Order Orthogonal Iterations (L1-HOOI). The presented algorithms are accompanied by complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06455","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":"1904.06455","created_at":"2026-05-17T23:48:41.339073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06455v1","created_at":"2026-05-17T23:48:41.339073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06455","created_at":"2026-05-17T23:48:41.339073+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6VA4IT2RS4K","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6VA4IT2RS4KBQHZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6VA4IT2","created_at":"2026-05-18T12:33:15.570797+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/D6VA4IT2RS4KBQHZRZJPJ3JSN4","json":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4.json","graph_json":"https://pith.science/api/pith-number/D6VA4IT2RS4KBQHZRZJPJ3JSN4/graph.json","events_json":"https://pith.science/api/pith-number/D6VA4IT2RS4KBQHZRZJPJ3JSN4/events.json","paper":"https://pith.science/paper/D6VA4IT2"},"agent_actions":{"view_html":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4","download_json":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4.json","view_paper":"https://pith.science/paper/D6VA4IT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06455&json=true","fetch_graph":"https://pith.science/api/pith-number/D6VA4IT2RS4KBQHZRZJPJ3JSN4/graph.json","fetch_events":"https://pith.science/api/pith-number/D6VA4IT2RS4KBQHZRZJPJ3JSN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/action/storage_attestation","attest_author":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/action/author_attestation","sign_citation":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/action/citation_signature","submit_replication":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/action/replication_record"}},"created_at":"2026-05-17T23:48:41.339073+00:00","updated_at":"2026-05-17T23:48:41.339073+00:00"}