{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:D6VA4IT2RS4KBQHZRZJPJ3JSN4","short_pith_number":"pith:D6VA4IT2","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"},"canonical_sha256":"1faa0e227a8cb8a0c0f98e52f4ed326f112a431c588b94a3c8ed190c0531af56","source":{"kind":"arxiv","id":"1904.06455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06455","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06455v1","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06455","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"pith_short_12","alias_value":"D6VA4IT2RS4K","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"D6VA4IT2RS4KBQHZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"D6VA4IT2","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:D6VA4IT2RS4KBQHZRZJPJ3JSN4","target":"record","payload":{"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"},"canonical_sha256":"1faa0e227a8cb8a0c0f98e52f4ed326f112a431c588b94a3c8ed190c0531af56","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"},"source_kind":"arxiv","source_id":"1904.06455","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrDKoHHkT/SP+JtG5pN1M+DjLQFv8ROu3tAfaevbr/oPK4jpVxjumuottYGm9gKAg5jdRkWnqTI9T5CVSUAuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:42:32.543887Z"},"content_sha256":"ee3c15bd8adf4248cb47f9856cd295f64c34831fe40da1b942900bf44c60bf30","schema_version":"1.0","event_id":"sha256:ee3c15bd8adf4248cb47f9856cd295f64c34831fe40da1b942900bf44c60bf30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:D6VA4IT2RS4KBQHZRZJPJ3JSN4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MC3mHF1w8EgxEZi+u+AJCCplBmtnRPSXSPE/HhkbBW458k+WZMeb9lTDj40aLmmFWh1JWkpr14XovdGbn5yBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:42:32.544577Z"},"content_sha256":"2b9b50341c76e15e567a8971773b9188d43110b19b6fefc513abb2333c86a01f","schema_version":"1.0","event_id":"sha256:2b9b50341c76e15e567a8971773b9188d43110b19b6fefc513abb2333c86a01f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/bundle.json","state_url":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T01:42:32Z","links":{"resolver":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4","bundle":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/bundle.json","state":"https://pith.science/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6VA4IT2RS4KBQHZRZJPJ3JSN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:D6VA4IT2RS4KBQHZRZJPJ3JSN4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c539c039cdfab1aa1160315a017c7ea8637f2578826c2af9bebe09d869fca8e6","cross_cats_sorted":["cs.DS","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2019-04-13T00:35:22Z","title_canon_sha256":"58a9d205bae34c5d2f39faf73189e6272c173b3b06726bc463b6889547e544e2"},"schema_version":"1.0","source":{"id":"1904.06455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06455","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06455v1","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06455","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"pith_short_12","alias_value":"D6VA4IT2RS4K","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"D6VA4IT2RS4KBQHZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"D6VA4IT2","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:2b9b50341c76e15e567a8971773b9188d43110b19b6fefc513abb2333c86a01f","target":"graph","created_at":"2026-05-17T23:48:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ashley Prater-Bennette, Dimitris G. Chachlakis, Panos P. Markopoulos","cross_cats":["cs.DS","eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2019-04-13T00:35:22Z","title":"L1-norm Tucker Tensor Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06455","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ee3c15bd8adf4248cb47f9856cd295f64c34831fe40da1b942900bf44c60bf30","target":"record","created_at":"2026-05-17T23:48:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c539c039cdfab1aa1160315a017c7ea8637f2578826c2af9bebe09d869fca8e6","cross_cats_sorted":["cs.DS","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2019-04-13T00:35:22Z","title_canon_sha256":"58a9d205bae34c5d2f39faf73189e6272c173b3b06726bc463b6889547e544e2"},"schema_version":"1.0","source":{"id":"1904.06455","kind":"arxiv","version":1}},"canonical_sha256":"1faa0e227a8cb8a0c0f98e52f4ed326f112a431c588b94a3c8ed190c0531af56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1faa0e227a8cb8a0c0f98e52f4ed326f112a431c588b94a3c8ed190c0531af56","first_computed_at":"2026-05-17T23:48:41.338958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:41.338958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PnLsnO30gWB9YBS8PJdSOXu2mlHP+AeSpUZxllG638ehQuAdW2ixKATGHof9XT0ByzlBJvDd3SCSY06me01KAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:41.339663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee3c15bd8adf4248cb47f9856cd295f64c34831fe40da1b942900bf44c60bf30","sha256:2b9b50341c76e15e567a8971773b9188d43110b19b6fefc513abb2333c86a01f"],"state_sha256":"5c5d0375a57ccb4792ecd5b3e7a53249d3ca550649bdba53dab7d8c06fa0a79b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lymGPpwiY9kOr5Xk4LnLSCms+yX6bVUkKbl+3hYUsEi/S8H0PFa5k/nRPTYty991GwVmHsNxndmw+DeGF86AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:42:32.548720Z","bundle_sha256":"db95b048f2b27cadab8d2b76d9f391d65987522edc9fe1e141050d3cda9008be"}}