{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7DV7JC5MRZZCMTMIQDERQWJHS3","short_pith_number":"pith:7DV7JC5M","canonical_record":{"source":{"id":"1708.02455","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-08T11:59:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"585164ed70e74f9538a5cdfc17e69006db6fce564cfb6eec614bf7e187255df1","abstract_canon_sha256":"81ec4fd2f4687bc87af92ffcf6003b9e9a6a55cb5e5e029b1faf6726ddb909b8"},"schema_version":"1.0"},"canonical_sha256":"f8ebf48bac8e72264d8880c918592796ff2bb8bf7f4e70f5c945b0aaad3b3926","source":{"kind":"arxiv","id":"1708.02455","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02455","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02455v2","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02455","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"7DV7JC5MRZZC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7DV7JC5MRZZCMTMI","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7DV7JC5M","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7DV7JC5MRZZCMTMIQDERQWJHS3","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02455","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-08T11:59:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"585164ed70e74f9538a5cdfc17e69006db6fce564cfb6eec614bf7e187255df1","abstract_canon_sha256":"81ec4fd2f4687bc87af92ffcf6003b9e9a6a55cb5e5e029b1faf6726ddb909b8"},"schema_version":"1.0"},"canonical_sha256":"f8ebf48bac8e72264d8880c918592796ff2bb8bf7f4e70f5c945b0aaad3b3926","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:31.702437Z","signature_b64":"TIo72/WDPWV+btWtLQ4uiBkji8e8jcyA4r3eWjyI2iLp3515Kada+CgmukSwWtjZreVEERdW1ikOFycg3OWIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8ebf48bac8e72264d8880c918592796ff2bb8bf7f4e70f5c945b0aaad3b3926","last_reissued_at":"2026-05-18T00:16:31.701937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:31.701937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02455","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-18T00:16:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5drAc7QrqEsxM0bAHaA+l85u6892BGXN8VsojY967FGPjmx6uy6RFCvqNkMdJ1O/0jwL9dc42cr/hD0OdMeOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:52.883780Z"},"content_sha256":"3dd02ec841f4b282fdea184bbd1ff4eeccd3ebd710cafcc4931bc354e7049179","schema_version":"1.0","event_id":"sha256:3dd02ec841f4b282fdea184bbd1ff4eeccd3ebd710cafcc4931bc354e7049179"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7DV7JC5MRZZCMTMIQDERQWJHS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bing Zeng, Hongbin Li, Huiping Duan, Jun Fang, Linxiao Yang","submitted_at":"2017-08-08T11:59:10Z","abstract_excerpt":"The problem of low rank matrix completion is considered in this paper. To exploit the underlying low-rank structure of the data matrix, we propose a hierarchical Gaussian prior model, where columns of the low-rank matrix are assumed to follow a Gaussian distribution with zero mean and a common precision matrix, and a Wishart distribution is specified as a hyperprior over the precision matrix. We show that such a hierarchical Gaussian prior has the potential to encourage a low-rank solution. Based on the proposed hierarchical prior model, a variational Bayesian method is developed for matrix co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02455","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-18T00:16:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRloZTgpkw+2oXzFcO3HUj02FARCQBN91D2Q/SXOZMRwTWaF0I/OvPqtn0qImiMCdJzI3fsZLtl4bzAP+Gd5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:52.884140Z"},"content_sha256":"a30c72723c15ae2ac33b853627fab63b1c6047b793958c2337af91e6271b2595","schema_version":"1.0","event_id":"sha256:a30c72723c15ae2ac33b853627fab63b1c6047b793958c2337af91e6271b2595"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/bundle.json","state_url":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/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-25T04:13:52Z","links":{"resolver":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3","bundle":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/bundle.json","state":"https://pith.science/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DV7JC5MRZZCMTMIQDERQWJHS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7DV7JC5MRZZCMTMIQDERQWJHS3","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":"81ec4fd2f4687bc87af92ffcf6003b9e9a6a55cb5e5e029b1faf6726ddb909b8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-08T11:59:10Z","title_canon_sha256":"585164ed70e74f9538a5cdfc17e69006db6fce564cfb6eec614bf7e187255df1"},"schema_version":"1.0","source":{"id":"1708.02455","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02455","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02455v2","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02455","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"7DV7JC5MRZZC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7DV7JC5MRZZCMTMI","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7DV7JC5M","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:a30c72723c15ae2ac33b853627fab63b1c6047b793958c2337af91e6271b2595","target":"graph","created_at":"2026-05-18T00:16:31Z","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":"The problem of low rank matrix completion is considered in this paper. To exploit the underlying low-rank structure of the data matrix, we propose a hierarchical Gaussian prior model, where columns of the low-rank matrix are assumed to follow a Gaussian distribution with zero mean and a common precision matrix, and a Wishart distribution is specified as a hyperprior over the precision matrix. We show that such a hierarchical Gaussian prior has the potential to encourage a low-rank solution. Based on the proposed hierarchical prior model, a variational Bayesian method is developed for matrix co","authors_text":"Bing Zeng, Hongbin Li, Huiping Duan, Jun Fang, Linxiao Yang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-08T11:59:10Z","title":"Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02455","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:3dd02ec841f4b282fdea184bbd1ff4eeccd3ebd710cafcc4931bc354e7049179","target":"record","created_at":"2026-05-18T00:16:31Z","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":"81ec4fd2f4687bc87af92ffcf6003b9e9a6a55cb5e5e029b1faf6726ddb909b8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-08T11:59:10Z","title_canon_sha256":"585164ed70e74f9538a5cdfc17e69006db6fce564cfb6eec614bf7e187255df1"},"schema_version":"1.0","source":{"id":"1708.02455","kind":"arxiv","version":2}},"canonical_sha256":"f8ebf48bac8e72264d8880c918592796ff2bb8bf7f4e70f5c945b0aaad3b3926","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8ebf48bac8e72264d8880c918592796ff2bb8bf7f4e70f5c945b0aaad3b3926","first_computed_at":"2026-05-18T00:16:31.701937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:31.701937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TIo72/WDPWV+btWtLQ4uiBkji8e8jcyA4r3eWjyI2iLp3515Kada+CgmukSwWtjZreVEERdW1ikOFycg3OWIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:31.702437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02455","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dd02ec841f4b282fdea184bbd1ff4eeccd3ebd710cafcc4931bc354e7049179","sha256:a30c72723c15ae2ac33b853627fab63b1c6047b793958c2337af91e6271b2595"],"state_sha256":"cc0ea1715503f8df2b5dcff6fdd945c466c4179a58904619800f28b78b4f1aee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gl9TrRq7dykcqUEMFRS0yCJsz1BJAJI6IRRwgW8PVoZDYMPhxVPUIpJws2lMgcQkD+JNucxaYPEIT6PbCdqUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:13:52.887603Z","bundle_sha256":"d64b0bd62ef085e372f58e1b9c1fd2faaffe532ba16df22bdf5cc8f83f0d4aa5"}}