{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NWGJUJA7NRZXSIJNCJ3RFCEEBL","short_pith_number":"pith:NWGJUJA7","canonical_record":{"source":{"id":"1608.04674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T17:00:48Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"6c453fd7957edd3e379db264d508de64a35bf57d4d654cce487b0ddfeecc6933","abstract_canon_sha256":"54f880c7757095946b5f041812e99ddd90a96c855920b9b30b40a7c988156db7"},"schema_version":"1.0"},"canonical_sha256":"6d8c9a241f6c7379212d12771288840ac3ec2c891f888d392b029e3d3454ff6e","source":{"kind":"arxiv","id":"1608.04674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04674","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04674v1","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04674","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"NWGJUJA7NRZX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NWGJUJA7NRZXSIJN","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NWGJUJA7","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NWGJUJA7NRZXSIJNCJ3RFCEEBL","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T17:00:48Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"6c453fd7957edd3e379db264d508de64a35bf57d4d654cce487b0ddfeecc6933","abstract_canon_sha256":"54f880c7757095946b5f041812e99ddd90a96c855920b9b30b40a7c988156db7"},"schema_version":"1.0"},"canonical_sha256":"6d8c9a241f6c7379212d12771288840ac3ec2c891f888d392b029e3d3454ff6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:36.580369Z","signature_b64":"yZd0U4JIJeNWSRDuJfLuRDJkxb9bF5yZfvUyPDVBIViV6QIe1wD37Ofb2TAjGMqghBdEWn56EarLWZiSpsVuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d8c9a241f6c7379212d12771288840ac3ec2c891f888d392b029e3d3454ff6e","last_reissued_at":"2026-05-18T01:08:36.579743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:36.579743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04674","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-18T01:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDi99LCUdJEjp8r38MDXMy2fKf5AAByE+QCKE8+WjSsHW8RG5s4ztq6DWcy11m6aNtElURIDt5O0yk72daNSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:51:04.430373Z"},"content_sha256":"3d2195dcffd2e8f7deaa19a92e48f135c7da2ae48107d1918d2665e4da63778f","schema_version":"1.0","event_id":"sha256:3d2195dcffd2e8f7deaa19a92e48f135c7da2ae48107d1918d2665e4da63778f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NWGJUJA7NRZXSIJNCJ3RFCEEBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shape Constrained Tensor Decompositions using Sparse Representations in Over-Complete Libraries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Bethany Lusch, Eric C. Chi, J. Nathan Kutz","submitted_at":"2016-08-16T17:00:48Z","abstract_excerpt":"We consider $N$-way data arrays and low-rank tensor factorizations where the time mode is coded as a sparse linear combination of temporal elements from an over-complete library. Our method, Shape Constrained Tensor Decomposition (SCTD) is based upon the CANDECOMP/PARAFAC (CP) decomposition which produces $r$-rank approximations of data tensors via outer products of vectors in each dimension of the data. By constraining the vector in the temporal dimension to known analytic forms which are selected from a large set of candidate functions, more readily interpretable decompositions are achieved "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04674","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-18T01:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"070kpPoL9PD/0TObFRK58H9Fg8R8qfNCxoZsU8RwAU9CA7dFA0aRAr4Jx2j+sVjuG2V8jkK0n24dlRTDdy6ACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:51:04.430994Z"},"content_sha256":"544d70141270d07a5d410181818373da0e1d48357378e6f636e82eb925d8449d","schema_version":"1.0","event_id":"sha256:544d70141270d07a5d410181818373da0e1d48357378e6f636e82eb925d8449d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWGJUJA7NRZXSIJNCJ3RFCEEBL/bundle.json","state_url":"https://pith.science/pith/NWGJUJA7NRZXSIJNCJ3RFCEEBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWGJUJA7NRZXSIJNCJ3RFCEEBL/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-07T08:51:04Z","links":{"resolver":"https://pith.science/pith/NWGJUJA7NRZXSIJNCJ3RFCEEBL","bundle":"https://pith.science/pith/NWGJUJA7NRZXSIJNCJ3RFCEEBL/bundle.json","state":"https://pith.science/pith/NWGJUJA7NRZXSIJNCJ3RFCEEBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWGJUJA7NRZXSIJNCJ3RFCEEBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NWGJUJA7NRZXSIJNCJ3RFCEEBL","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":"54f880c7757095946b5f041812e99ddd90a96c855920b9b30b40a7c988156db7","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T17:00:48Z","title_canon_sha256":"6c453fd7957edd3e379db264d508de64a35bf57d4d654cce487b0ddfeecc6933"},"schema_version":"1.0","source":{"id":"1608.04674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04674","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04674v1","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04674","created_at":"2026-05-18T01:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"NWGJUJA7NRZX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NWGJUJA7NRZXSIJN","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NWGJUJA7","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:544d70141270d07a5d410181818373da0e1d48357378e6f636e82eb925d8449d","target":"graph","created_at":"2026-05-18T01:08:36Z","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":"We consider $N$-way data arrays and low-rank tensor factorizations where the time mode is coded as a sparse linear combination of temporal elements from an over-complete library. Our method, Shape Constrained Tensor Decomposition (SCTD) is based upon the CANDECOMP/PARAFAC (CP) decomposition which produces $r$-rank approximations of data tensors via outer products of vectors in each dimension of the data. By constraining the vector in the temporal dimension to known analytic forms which are selected from a large set of candidate functions, more readily interpretable decompositions are achieved ","authors_text":"Bethany Lusch, Eric C. Chi, J. Nathan Kutz","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T17:00:48Z","title":"Shape Constrained Tensor Decompositions using Sparse Representations in Over-Complete Libraries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04674","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:3d2195dcffd2e8f7deaa19a92e48f135c7da2ae48107d1918d2665e4da63778f","target":"record","created_at":"2026-05-18T01:08:36Z","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":"54f880c7757095946b5f041812e99ddd90a96c855920b9b30b40a7c988156db7","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T17:00:48Z","title_canon_sha256":"6c453fd7957edd3e379db264d508de64a35bf57d4d654cce487b0ddfeecc6933"},"schema_version":"1.0","source":{"id":"1608.04674","kind":"arxiv","version":1}},"canonical_sha256":"6d8c9a241f6c7379212d12771288840ac3ec2c891f888d392b029e3d3454ff6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d8c9a241f6c7379212d12771288840ac3ec2c891f888d392b029e3d3454ff6e","first_computed_at":"2026-05-18T01:08:36.579743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:36.579743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yZd0U4JIJeNWSRDuJfLuRDJkxb9bF5yZfvUyPDVBIViV6QIe1wD37Ofb2TAjGMqghBdEWn56EarLWZiSpsVuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:36.580369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d2195dcffd2e8f7deaa19a92e48f135c7da2ae48107d1918d2665e4da63778f","sha256:544d70141270d07a5d410181818373da0e1d48357378e6f636e82eb925d8449d"],"state_sha256":"05e6197c840b2fb53f00162b39a3080c441446b40ba6fa9cdf2a5a733b26faa0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkgzXlDnNk/rbkx4kBY6Q+tLDkl1g4i63qsN1CCBzytmQwSIIoxcww7SfxK8kyXAXyQEehhcO43OJ9CtAv4qDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:51:04.434239Z","bundle_sha256":"618c16cf45bfa3112e9f514807cd3e0e36acc86ad9109c54d6fdff66d4570071"}}