{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WXUDK4OYR4X444GL2O3N5UI6Q2","short_pith_number":"pith:WXUDK4OY","schema_version":"1.0","canonical_sha256":"b5e83571d88f2fce70cbd3b6ded11e86a357ca0a5e4319b43054a034d715aa97","source":{"kind":"arxiv","id":"1502.01425","version":3},"attestation_state":"computed","paper":{"title":"Provable Sparse Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Guang Cheng, Han Liu, Junwei Lu, Will Wei Sun","submitted_at":"2015-02-05T03:37:40Z","abstract_excerpt":"We propose a novel sparse tensor decomposition method, namely Tensor Truncated Power (TTP) method, that incorporates variable selection into the estimation of decomposition components. The sparsity is achieved via an efficient truncation step embedded in the tensor power iteration. Our method applies to a broad family of high dimensional latent variable models, including high dimensional Gaussian mixture and mixtures of sparse regressions. A thorough theoretical investigation is further conducted. In particular, we show that the final decomposition estimator is guaranteed to achieve a local st"},"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":"1502.01425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-05T03:37:40Z","cross_cats_sorted":[],"title_canon_sha256":"bc20cc346741506e17fc5c700e00776951b8a75d8981df62170aedaf420f81a6","abstract_canon_sha256":"a18b408666264bcd7e3f9f36cf066ae56099238c52af11f1eb88dc1da24b8423"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:53.136089Z","signature_b64":"HUJk5glvPb4Wn2KBdZi7VoG2szLgSL0R2yCgJ00WqtkOtITYz4YLlFATdnSXyb8Y0vbt35CYKls4RWe/vxa2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5e83571d88f2fce70cbd3b6ded11e86a357ca0a5e4319b43054a034d715aa97","last_reissued_at":"2026-05-18T01:15:53.135633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:53.135633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Sparse Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Guang Cheng, Han Liu, Junwei Lu, Will Wei Sun","submitted_at":"2015-02-05T03:37:40Z","abstract_excerpt":"We propose a novel sparse tensor decomposition method, namely Tensor Truncated Power (TTP) method, that incorporates variable selection into the estimation of decomposition components. The sparsity is achieved via an efficient truncation step embedded in the tensor power iteration. Our method applies to a broad family of high dimensional latent variable models, including high dimensional Gaussian mixture and mixtures of sparse regressions. A thorough theoretical investigation is further conducted. In particular, we show that the final decomposition estimator is guaranteed to achieve a local st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01425","kind":"arxiv","version":3},"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":"1502.01425","created_at":"2026-05-18T01:15:53.135703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01425v3","created_at":"2026-05-18T01:15:53.135703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01425","created_at":"2026-05-18T01:15:53.135703+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXUDK4OYR4X4","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXUDK4OYR4X444GL","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXUDK4OY","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.17568","citing_title":"Structured Neural Marked Point Processes for Interpretable Event Interaction Modeling","ref_index":220,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17568","citing_title":"Structured Neural Marked Point Processes for Interpretable Event Interaction Modeling","ref_index":220,"is_internal_anchor":true},{"citing_arxiv_id":"2605.01226","citing_title":"Arbitrarily Conditioned Hierarchical Flows for Spatiotemporal Events","ref_index":209,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2","json":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2.json","graph_json":"https://pith.science/api/pith-number/WXUDK4OYR4X444GL2O3N5UI6Q2/graph.json","events_json":"https://pith.science/api/pith-number/WXUDK4OYR4X444GL2O3N5UI6Q2/events.json","paper":"https://pith.science/paper/WXUDK4OY"},"agent_actions":{"view_html":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2","download_json":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2.json","view_paper":"https://pith.science/paper/WXUDK4OY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01425&json=true","fetch_graph":"https://pith.science/api/pith-number/WXUDK4OYR4X444GL2O3N5UI6Q2/graph.json","fetch_events":"https://pith.science/api/pith-number/WXUDK4OYR4X444GL2O3N5UI6Q2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2/action/storage_attestation","attest_author":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2/action/author_attestation","sign_citation":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2/action/citation_signature","submit_replication":"https://pith.science/pith/WXUDK4OYR4X444GL2O3N5UI6Q2/action/replication_record"}},"created_at":"2026-05-18T01:15:53.135703+00:00","updated_at":"2026-05-18T01:15:53.135703+00:00"}