{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KQZXZ5QCYGM7NUUGIM3EUUFZNE","short_pith_number":"pith:KQZXZ5QC","canonical_record":{"source":{"id":"1705.10015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-29T02:14:05Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"109cf99322d582d8cf9dc17a0d980ab5d0e0eacad329a17a59981d71e678e2c8","abstract_canon_sha256":"6b784cbab223b0621c12b9a0a1e49125d761abd5dd99df94255d8e78681b9431"},"schema_version":"1.0"},"canonical_sha256":"54337cf602c199f6d28643364a50b96907ee2a04e78c81681b27a4fce7f9ae11","source":{"kind":"arxiv","id":"1705.10015","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10015","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10015v1","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10015","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"KQZXZ5QCYGM7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KQZXZ5QCYGM7NUUG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KQZXZ5QC","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KQZXZ5QCYGM7NUUGIM3EUUFZNE","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-29T02:14:05Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"109cf99322d582d8cf9dc17a0d980ab5d0e0eacad329a17a59981d71e678e2c8","abstract_canon_sha256":"6b784cbab223b0621c12b9a0a1e49125d761abd5dd99df94255d8e78681b9431"},"schema_version":"1.0"},"canonical_sha256":"54337cf602c199f6d28643364a50b96907ee2a04e78c81681b27a4fce7f9ae11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:32.164371Z","signature_b64":"Z+rrokh+oJwpssIH3FQhyj2v+jQJ9qZUmGdAZJkn/o7jE8cG9867fziZAjxvkT212KEVsYyuLQiOFnRo+5PvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54337cf602c199f6d28643364a50b96907ee2a04e78c81681b27a4fce7f9ae11","last_reissued_at":"2026-05-18T00:43:32.163761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:32.163761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10015","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-18T00:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOm1d4Xr1u2W2BSlvX2xjmJwrOPUkuBNR0CwoiapTzi2gWGcm1JQOPBKpgAqRg/IWfopvX06RwNUwOLLd9lWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:00:06.113721Z"},"content_sha256":"650f8152a3ab6be758fd9be91020d43f20f2a618a3a7b4141eb001fc8b507477","schema_version":"1.0","event_id":"sha256:650f8152a3ab6be758fd9be91020d43f20f2a618a3a7b4141eb001fc8b507477"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KQZXZ5QCYGM7NUUGIM3EUUFZNE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning the Sparse and Low Rank PARAFAC Decomposition via the Elastic Net","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"math.NA","authors_text":"Arkadiusz Sitek, Quanzheng Li, Songting Shi, Xiang Li","submitted_at":"2017-05-29T02:14:05Z","abstract_excerpt":"In this article, we derive a Bayesian model to learning the sparse and low rank PARAFAC decomposition for the observed tensor with missing values via the elastic net, with property to find the true rank and sparse factor matrix which is robust to the noise. We formulate efficient block coordinate descent algorithm and admax stochastic block coordinate descent algorithm to solve it, which can be used to solve the large scale problem. To choose the appropriate rank and sparsity in PARAFAC decomposition, we will give a solution path by gradually increasing the regularization to increase the spars"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10015","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-18T00:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mQSYANz8iP20l8owqckQF7rR1VpAPTm26uDYbHerMlAjO+RF9sclxNrPVRVwoHkS0HpRMeAKDtMUw1ZJF1uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:00:06.114386Z"},"content_sha256":"0a775a83585427bdcc4933267c6caecc51346d6f89aa561adefbecbdf567879b","schema_version":"1.0","event_id":"sha256:0a775a83585427bdcc4933267c6caecc51346d6f89aa561adefbecbdf567879b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQZXZ5QCYGM7NUUGIM3EUUFZNE/bundle.json","state_url":"https://pith.science/pith/KQZXZ5QCYGM7NUUGIM3EUUFZNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQZXZ5QCYGM7NUUGIM3EUUFZNE/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-05-31T18:00:06Z","links":{"resolver":"https://pith.science/pith/KQZXZ5QCYGM7NUUGIM3EUUFZNE","bundle":"https://pith.science/pith/KQZXZ5QCYGM7NUUGIM3EUUFZNE/bundle.json","state":"https://pith.science/pith/KQZXZ5QCYGM7NUUGIM3EUUFZNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQZXZ5QCYGM7NUUGIM3EUUFZNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KQZXZ5QCYGM7NUUGIM3EUUFZNE","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":"6b784cbab223b0621c12b9a0a1e49125d761abd5dd99df94255d8e78681b9431","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-29T02:14:05Z","title_canon_sha256":"109cf99322d582d8cf9dc17a0d980ab5d0e0eacad329a17a59981d71e678e2c8"},"schema_version":"1.0","source":{"id":"1705.10015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10015","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10015v1","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10015","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"KQZXZ5QCYGM7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KQZXZ5QCYGM7NUUG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KQZXZ5QC","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:0a775a83585427bdcc4933267c6caecc51346d6f89aa561adefbecbdf567879b","target":"graph","created_at":"2026-05-18T00:43:32Z","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":"In this article, we derive a Bayesian model to learning the sparse and low rank PARAFAC decomposition for the observed tensor with missing values via the elastic net, with property to find the true rank and sparse factor matrix which is robust to the noise. We formulate efficient block coordinate descent algorithm and admax stochastic block coordinate descent algorithm to solve it, which can be used to solve the large scale problem. To choose the appropriate rank and sparsity in PARAFAC decomposition, we will give a solution path by gradually increasing the regularization to increase the spars","authors_text":"Arkadiusz Sitek, Quanzheng Li, Songting Shi, Xiang Li","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-29T02:14:05Z","title":"Learning the Sparse and Low Rank PARAFAC Decomposition via the Elastic Net"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10015","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:650f8152a3ab6be758fd9be91020d43f20f2a618a3a7b4141eb001fc8b507477","target":"record","created_at":"2026-05-18T00:43:32Z","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":"6b784cbab223b0621c12b9a0a1e49125d761abd5dd99df94255d8e78681b9431","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-29T02:14:05Z","title_canon_sha256":"109cf99322d582d8cf9dc17a0d980ab5d0e0eacad329a17a59981d71e678e2c8"},"schema_version":"1.0","source":{"id":"1705.10015","kind":"arxiv","version":1}},"canonical_sha256":"54337cf602c199f6d28643364a50b96907ee2a04e78c81681b27a4fce7f9ae11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54337cf602c199f6d28643364a50b96907ee2a04e78c81681b27a4fce7f9ae11","first_computed_at":"2026-05-18T00:43:32.163761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:32.163761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z+rrokh+oJwpssIH3FQhyj2v+jQJ9qZUmGdAZJkn/o7jE8cG9867fziZAjxvkT212KEVsYyuLQiOFnRo+5PvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:32.164371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:650f8152a3ab6be758fd9be91020d43f20f2a618a3a7b4141eb001fc8b507477","sha256:0a775a83585427bdcc4933267c6caecc51346d6f89aa561adefbecbdf567879b"],"state_sha256":"1e72fa6483572ac054ec568840c1b91cae8464a8939de29d9261fb355312eae4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VAm1b6sDre5mRrzeVrUpvL8sRp1t0+0qcmND4Ht1Sd9EzrTzYg2uAgmuTtKZMiBuWT2eZloIoTyn6dzmndTbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:00:06.117781Z","bundle_sha256":"40d1c3a4a8842c93b5fb1651ea365095be1a202c618de11d096cb01dd37cfe9d"}}