{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UXV3CRUOFPHPUQYU3ZEPTODKAB","short_pith_number":"pith:UXV3CRUO","canonical_record":{"source":{"id":"1401.6497","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-25T05:08:33Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"dcc0128624a944bea6e6fdc81faf97a10b061822dc78db093749f3eb71b665b5","abstract_canon_sha256":"90611e89e2aa0d35dfa4155df51153dc84dc0a9c1b0e7bee17075a52c4edf72b"},"schema_version":"1.0"},"canonical_sha256":"a5ebb1468e2bcefa4314de48f9b86a005697a003e7715f9684b1a135375011a4","source":{"kind":"arxiv","id":"1401.6497","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6497","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6497v2","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6497","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"UXV3CRUOFPHP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UXV3CRUOFPHPUQYU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UXV3CRUO","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UXV3CRUOFPHPUQYU3ZEPTODKAB","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6497","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-25T05:08:33Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"dcc0128624a944bea6e6fdc81faf97a10b061822dc78db093749f3eb71b665b5","abstract_canon_sha256":"90611e89e2aa0d35dfa4155df51153dc84dc0a9c1b0e7bee17075a52c4edf72b"},"schema_version":"1.0"},"canonical_sha256":"a5ebb1468e2bcefa4314de48f9b86a005697a003e7715f9684b1a135375011a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:01.646973Z","signature_b64":"zbjJ3HTqRqZO/8tvVPy3zkrB+/swerIZDB9a5jhj3JVMhwYiBnkv6gutiw2eTBxQVJMI8L5cpx/jAxJIr4rvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5ebb1468e2bcefa4314de48f9b86a005697a003e7715f9684b1a135375011a4","last_reissued_at":"2026-05-18T02:29:01.646362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:01.646362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6497","source_version":2,"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-18T02:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"daW+QgsZjJdgoVax3g16zhoLb3vAfal63tRxHIi25f+jNyEe8Vk3BiaDxdOwOieYuqCkX4VSnkAcxscz3ZD2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:09:29.063751Z"},"content_sha256":"5909a4a8afdd2ecbe8fb87fd907135636b90cf4c88b572011e2b49fd66561626","schema_version":"1.0","event_id":"sha256:5909a4a8afdd2ecbe8fb87fd907135636b90cf4c88b572011e2b49fd66561626"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UXV3CRUOFPHPUQYU3ZEPTODKAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrzej Cichocki, Liqing Zhang, Qibin Zhao","submitted_at":"2014-01-25T05:08:33Z","abstract_excerpt":"CANDECOMP/PARAFAC (CP) tensor factorization of incomplete data is a powerful technique for tensor completion through explicitly capturing the multilinear latent factors. The existing CP algorithms require the tensor rank to be manually specified, however, the determination of tensor rank remains a challenging problem especially for CP rank. In addition, existing approaches do not take into account uncertainty information of latent factors, as well as missing entries. To address these issues, we formulate CP factorization using a hierarchical probabilistic model and employ a fully Bayesian trea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6497","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"},"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-18T02:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOOMD7UyEpoDUGTu1L3fVdHlg4gMv8l6w3bsYUWarroYd9IvyNQ1S1WrOYwZ77EgcF7zc2OJnAemfjhvDzfqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:09:29.064101Z"},"content_sha256":"4330e60557cc755ccf6bfdc7c3bac0651596f489d2aadc6e9d3b4a8a11db557f","schema_version":"1.0","event_id":"sha256:4330e60557cc755ccf6bfdc7c3bac0651596f489d2aadc6e9d3b4a8a11db557f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXV3CRUOFPHPUQYU3ZEPTODKAB/bundle.json","state_url":"https://pith.science/pith/UXV3CRUOFPHPUQYU3ZEPTODKAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXV3CRUOFPHPUQYU3ZEPTODKAB/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-20T09:09:29Z","links":{"resolver":"https://pith.science/pith/UXV3CRUOFPHPUQYU3ZEPTODKAB","bundle":"https://pith.science/pith/UXV3CRUOFPHPUQYU3ZEPTODKAB/bundle.json","state":"https://pith.science/pith/UXV3CRUOFPHPUQYU3ZEPTODKAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXV3CRUOFPHPUQYU3ZEPTODKAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UXV3CRUOFPHPUQYU3ZEPTODKAB","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":"90611e89e2aa0d35dfa4155df51153dc84dc0a9c1b0e7bee17075a52c4edf72b","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-25T05:08:33Z","title_canon_sha256":"dcc0128624a944bea6e6fdc81faf97a10b061822dc78db093749f3eb71b665b5"},"schema_version":"1.0","source":{"id":"1401.6497","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6497","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6497v2","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6497","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"UXV3CRUOFPHP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UXV3CRUOFPHPUQYU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UXV3CRUO","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:4330e60557cc755ccf6bfdc7c3bac0651596f489d2aadc6e9d3b4a8a11db557f","target":"graph","created_at":"2026-05-18T02:29:01Z","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":"CANDECOMP/PARAFAC (CP) tensor factorization of incomplete data is a powerful technique for tensor completion through explicitly capturing the multilinear latent factors. The existing CP algorithms require the tensor rank to be manually specified, however, the determination of tensor rank remains a challenging problem especially for CP rank. In addition, existing approaches do not take into account uncertainty information of latent factors, as well as missing entries. To address these issues, we formulate CP factorization using a hierarchical probabilistic model and employ a fully Bayesian trea","authors_text":"Andrzej Cichocki, Liqing Zhang, Qibin Zhao","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-25T05:08:33Z","title":"Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6497","kind":"arxiv","version":2},"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:5909a4a8afdd2ecbe8fb87fd907135636b90cf4c88b572011e2b49fd66561626","target":"record","created_at":"2026-05-18T02:29:01Z","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":"90611e89e2aa0d35dfa4155df51153dc84dc0a9c1b0e7bee17075a52c4edf72b","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-25T05:08:33Z","title_canon_sha256":"dcc0128624a944bea6e6fdc81faf97a10b061822dc78db093749f3eb71b665b5"},"schema_version":"1.0","source":{"id":"1401.6497","kind":"arxiv","version":2}},"canonical_sha256":"a5ebb1468e2bcefa4314de48f9b86a005697a003e7715f9684b1a135375011a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5ebb1468e2bcefa4314de48f9b86a005697a003e7715f9684b1a135375011a4","first_computed_at":"2026-05-18T02:29:01.646362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:01.646362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zbjJ3HTqRqZO/8tvVPy3zkrB+/swerIZDB9a5jhj3JVMhwYiBnkv6gutiw2eTBxQVJMI8L5cpx/jAxJIr4rvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:01.646973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6497","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5909a4a8afdd2ecbe8fb87fd907135636b90cf4c88b572011e2b49fd66561626","sha256:4330e60557cc755ccf6bfdc7c3bac0651596f489d2aadc6e9d3b4a8a11db557f"],"state_sha256":"eb34c182ecbb86a21359fab4788433c14bdc2a10f1232afd87f2b11062deb55d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onB6CPjQ7VbS6I5/QNpO/SIhNzk2Zpsus6YEWDryhw9cXMCHCrZQGTlvH6LWc8ZQxqqlVfwUiwLUijs53pRGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:09:29.066102Z","bundle_sha256":"6bb6ee9d7422c527d2e45de3c8d91730ee154ebb852724cdfc4813048e2e00fb"}}