{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BUBXBCMZ6NFFPKMO6Y2OYQ3HW7","short_pith_number":"pith:BUBXBCMZ","schema_version":"1.0","canonical_sha256":"0d03708999f34a57a98ef634ec4367b7e9144d1c66bf54994549be721008b84d","source":{"kind":"arxiv","id":"2103.08895","version":4},"attestation_state":"computed","paper":{"title":"Generalized Low-rank plus Sparse Tensor Estimation by Fast Riemannian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Dong Xia, Jian-Feng Cai, Jingyang Li","submitted_at":"2021-03-16T07:38:54Z","abstract_excerpt":"We investigate a generalized framework to estimate a latent low-rank plus sparse tensor, where the low-rank tensor often captures the multi-way principal components and the sparse tensor accounts for potential model mis-specifications or heterogeneous signals that are unexplainable by the low-rank part. The framework is flexible covering both linear and non-linear models, and can easily handle continuous or categorical variables. We propose a fast algorithm by integrating the Riemannian gradient descent and a novel gradient pruning procedure. Under suitable conditions, the algorithm converges "},"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":"2103.08895","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2021-03-16T07:38:54Z","cross_cats_sorted":["math.OC","math.ST","stat.TH"],"title_canon_sha256":"0ddd966c9926d1f16953e62641077a88315adbb58939e4ba9b99065efbae647b","abstract_canon_sha256":"d9bd71def2aeb84ebab503bc48237f147b2b17ae95f3f7e1e68b24611a7e08f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:14:36.971466Z","signature_b64":"zKIXEoC3n0gLLNCPmDZGwJp4fIt5+njccziIzcEsyY6cc7AI16g+Sq7ZWXpGAallF6xXOW/noEQ5TWfc/O/7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d03708999f34a57a98ef634ec4367b7e9144d1c66bf54994549be721008b84d","last_reissued_at":"2026-07-05T04:14:36.970920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:14:36.970920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Low-rank plus Sparse Tensor Estimation by Fast Riemannian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Dong Xia, Jian-Feng Cai, Jingyang Li","submitted_at":"2021-03-16T07:38:54Z","abstract_excerpt":"We investigate a generalized framework to estimate a latent low-rank plus sparse tensor, where the low-rank tensor often captures the multi-way principal components and the sparse tensor accounts for potential model mis-specifications or heterogeneous signals that are unexplainable by the low-rank part. The framework is flexible covering both linear and non-linear models, and can easily handle continuous or categorical variables. We propose a fast algorithm by integrating the Riemannian gradient descent and a novel gradient pruning procedure. Under suitable conditions, the algorithm converges "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.08895","kind":"arxiv","version":4},"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/2103.08895/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":"2103.08895","created_at":"2026-07-05T04:14:36.970978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.08895v4","created_at":"2026-07-05T04:14:36.970978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.08895","created_at":"2026-07-05T04:14:36.970978+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUBXBCMZ6NFF","created_at":"2026-07-05T04:14:36.970978+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUBXBCMZ6NFFPKMO","created_at":"2026-07-05T04:14:36.970978+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUBXBCMZ","created_at":"2026-07-05T04:14:36.970978+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/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7","json":"https://pith.science/pith/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7.json","graph_json":"https://pith.science/api/pith-number/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/graph.json","events_json":"https://pith.science/api/pith-number/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/events.json","paper":"https://pith.science/paper/BUBXBCMZ"},"agent_actions":{"view_html":"https://pith.science/pith/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7","download_json":"https://pith.science/pith/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7.json","view_paper":"https://pith.science/paper/BUBXBCMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.08895&json=true","fetch_graph":"https://pith.science/api/pith-number/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/graph.json","fetch_events":"https://pith.science/api/pith-number/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/action/storage_attestation","attest_author":"https://pith.science/pith/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/action/author_attestation","sign_citation":"https://pith.science/pith/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/action/citation_signature","submit_replication":"https://pith.science/pith/BUBXBCMZ6NFFPKMO6Y2OYQ3HW7/action/replication_record"}},"created_at":"2026-07-05T04:14:36.970978+00:00","updated_at":"2026-07-05T04:14:36.970978+00:00"}