{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PXOUP3NJWBXHDDVFRBWT2QF7TF","short_pith_number":"pith:PXOUP3NJ","schema_version":"1.0","canonical_sha256":"7ddd47eda9b06e718ea5886d3d40bf9973b0f8634e1a0e385d12eaf072c96038","source":{"kind":"arxiv","id":"1708.07259","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Tensor Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Lexin Li, Will Wei Sun","submitted_at":"2017-08-24T02:50:15Z","abstract_excerpt":"Dynamic tensor data are becoming prevalent in numerous applications. Existing tensor clustering methods either fail to account for the dynamic nature of the data, or are inapplicable to a general-order tensor. Also there is often a gap between statistical guarantee and computational efficiency for existing tensor clustering solutions. In this article, we aim to bridge this gap by proposing a new dynamic tensor clustering method, which takes into account both sparsity and fusion structures, and enjoys strong statistical guarantees as well as high computational efficiency. Our proposal is based "},"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":"1708.07259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-24T02:50:15Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"945c4d2e2dfdb6df61ffd5519f2fb1e601dc3ad90bbe4f3b40f394f435fbdf19","abstract_canon_sha256":"b3c08545b775439044c36b53970a6efee129556281341048de384c263b5e6ca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:46.196766Z","signature_b64":"PpMwiOzJM7LfOo21w4VebFu74xHBEXNDXlD8DRO5i+lNF2wYhIxCkokHpUtJ8lKy0HXDPyLXDh3b1txFyJVyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ddd47eda9b06e718ea5886d3d40bf9973b0f8634e1a0e385d12eaf072c96038","last_reissued_at":"2026-05-18T00:05:46.195990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:46.195990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Tensor Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Lexin Li, Will Wei Sun","submitted_at":"2017-08-24T02:50:15Z","abstract_excerpt":"Dynamic tensor data are becoming prevalent in numerous applications. Existing tensor clustering methods either fail to account for the dynamic nature of the data, or are inapplicable to a general-order tensor. Also there is often a gap between statistical guarantee and computational efficiency for existing tensor clustering solutions. In this article, we aim to bridge this gap by proposing a new dynamic tensor clustering method, which takes into account both sparsity and fusion structures, and enjoys strong statistical guarantees as well as high computational efficiency. Our proposal is based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07259","kind":"arxiv","version":2},"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":"1708.07259","created_at":"2026-05-18T00:05:46.196121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07259v2","created_at":"2026-05-18T00:05:46.196121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07259","created_at":"2026-05-18T00:05:46.196121+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXOUP3NJWBXH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXOUP3NJWBXHDDVF","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXOUP3NJ","created_at":"2026-05-18T12:31:37.085036+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/PXOUP3NJWBXHDDVFRBWT2QF7TF","json":"https://pith.science/pith/PXOUP3NJWBXHDDVFRBWT2QF7TF.json","graph_json":"https://pith.science/api/pith-number/PXOUP3NJWBXHDDVFRBWT2QF7TF/graph.json","events_json":"https://pith.science/api/pith-number/PXOUP3NJWBXHDDVFRBWT2QF7TF/events.json","paper":"https://pith.science/paper/PXOUP3NJ"},"agent_actions":{"view_html":"https://pith.science/pith/PXOUP3NJWBXHDDVFRBWT2QF7TF","download_json":"https://pith.science/pith/PXOUP3NJWBXHDDVFRBWT2QF7TF.json","view_paper":"https://pith.science/paper/PXOUP3NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07259&json=true","fetch_graph":"https://pith.science/api/pith-number/PXOUP3NJWBXHDDVFRBWT2QF7TF/graph.json","fetch_events":"https://pith.science/api/pith-number/PXOUP3NJWBXHDDVFRBWT2QF7TF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXOUP3NJWBXHDDVFRBWT2QF7TF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXOUP3NJWBXHDDVFRBWT2QF7TF/action/storage_attestation","attest_author":"https://pith.science/pith/PXOUP3NJWBXHDDVFRBWT2QF7TF/action/author_attestation","sign_citation":"https://pith.science/pith/PXOUP3NJWBXHDDVFRBWT2QF7TF/action/citation_signature","submit_replication":"https://pith.science/pith/PXOUP3NJWBXHDDVFRBWT2QF7TF/action/replication_record"}},"created_at":"2026-05-18T00:05:46.196121+00:00","updated_at":"2026-05-18T00:05:46.196121+00:00"}