{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IETFUZFHUWQ7VBGXYWAYTKU4ZT","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":"d1f6bc5925a29a0463495abea35935a8e6c7f2bb9dcb205cb403205417e3ea5d","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-09-06T04:21:50Z","title_canon_sha256":"10c8e9b2bbb9b2eaf49ed8918b54ae465cc49deb74c967fac933e53bc6076fb5"},"schema_version":"1.0","source":{"id":"2309.02698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.02698","created_at":"2026-07-05T06:48:16Z"},{"alias_kind":"arxiv_version","alias_value":"2309.02698v1","created_at":"2026-07-05T06:48:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02698","created_at":"2026-07-05T06:48:16Z"},{"alias_kind":"pith_short_12","alias_value":"IETFUZFHUWQ7","created_at":"2026-07-05T06:48:16Z"},{"alias_kind":"pith_short_16","alias_value":"IETFUZFHUWQ7VBGX","created_at":"2026-07-05T06:48:16Z"},{"alias_kind":"pith_short_8","alias_value":"IETFUZFH","created_at":"2026-07-05T06:48:16Z"}],"graph_snapshots":[{"event_id":"sha256:64e77828e259301864b5749cbc5329c077337f0ef5841ec63c622fcb53482c17","target":"graph","created_at":"2026-07-05T06:48:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.02698/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the computational and statistical aspects of quantile and pseudo-Huber tensor decomposition. The integrated investigation of computational and statistical issues of robust tensor decomposition poses challenges due to the non-smooth loss functions. We propose a projected sub-gradient descent algorithm for tensor decomposition, equipped with either the pseudo-Huber loss or the quantile loss. In the presence of both heavy-tailed noise and Huber's contamination error, we demonstrate that our algorithm exhibits a so-called phenomenon of two-phase convergence with a carefully chos","authors_text":"Dong Xia, Yinan Shen","cross_cats":["cs.IT","math.IT","stat.ME","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-09-06T04:21:50Z","title":"Quantile and pseudo-Huber Tensor Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.02698","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:7e88aa02c8ba581c01210e567f3ce628079fe2ad5a7554bded4c510a83e74a80","target":"record","created_at":"2026-07-05T06:48:16Z","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":"d1f6bc5925a29a0463495abea35935a8e6c7f2bb9dcb205cb403205417e3ea5d","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-09-06T04:21:50Z","title_canon_sha256":"10c8e9b2bbb9b2eaf49ed8918b54ae465cc49deb74c967fac933e53bc6076fb5"},"schema_version":"1.0","source":{"id":"2309.02698","kind":"arxiv","version":1}},"canonical_sha256":"41265a64a7a5a1fa84d7c58189aa9cccc8ab6f5c8df15b9ea545fde8a21589b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41265a64a7a5a1fa84d7c58189aa9cccc8ab6f5c8df15b9ea545fde8a21589b3","first_computed_at":"2026-07-05T06:48:16.029392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:48:16.029392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rlMSl6UV9Mlmxrrk7SAVk4RCWnfmbtVXzMUjFdAKtn7jeIvU4yDSDNvlsv0QI5vj1ZVWkiknYfTeL6ATFfMSCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:48:16.029768Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.02698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e88aa02c8ba581c01210e567f3ce628079fe2ad5a7554bded4c510a83e74a80","sha256:64e77828e259301864b5749cbc5329c077337f0ef5841ec63c622fcb53482c17"],"state_sha256":"b7f0c06e382704c7e298651be980177f9dacf529074fdeb992bf005463807c59"}