{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DNO5IYKRSCM7ZYEKOBPSDPEHIQ","short_pith_number":"pith:DNO5IYKR","canonical_record":{"source":{"id":"1202.3769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8b23ad7c04a8c726bd513c4e6637593ee5916ec443e9cb8dbfb268707758c3f8","abstract_canon_sha256":"c877c6f8dd95a12fba22c4b3df49df7597bc28975abec77c36487abdf50c48eb"},"schema_version":"1.0"},"canonical_sha256":"1b5dd461519099fce08a705f21bc87443b58bde3575eb8cbb2248b3a7de9f9a2","source":{"kind":"arxiv","id":"1202.3769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3769","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3769v1","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3769","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"DNO5IYKRSCM7","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DNO5IYKRSCM7ZYEK","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DNO5IYKR","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DNO5IYKRSCM7ZYEKOBPSDPEHIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8b23ad7c04a8c726bd513c4e6637593ee5916ec443e9cb8dbfb268707758c3f8","abstract_canon_sha256":"c877c6f8dd95a12fba22c4b3df49df7597bc28975abec77c36487abdf50c48eb"},"schema_version":"1.0"},"canonical_sha256":"1b5dd461519099fce08a705f21bc87443b58bde3575eb8cbb2248b3a7de9f9a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:02.891088Z","signature_b64":"shPef8SR3Y7lhbK56qg0eVZZ/V4QK/rxEV2Gf67t0+mDRNQaDxEkas2yP0biRGtlz0CxYW52BmxsrbQHxS63Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5dd461519099fce08a705f21bc87443b58bde3575eb8cbb2248b3a7de9f9a2","last_reissued_at":"2026-05-18T04:02:02.890429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:02.890429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3769","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-18T04:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvF6Y6E0Gscbtm7bVMf/5b2U7WhY67umoz2y/THHFUOBF7ih3kSMytyFokNZ7UbWXlwUon4WVNDauSLDxxftBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T02:12:12.566185Z"},"content_sha256":"2fa5b29afad751300c8793254fd7157a6106f09c4c3b82fd6514e5d6cef5d146","schema_version":"1.0","event_id":"sha256:2fa5b29afad751300c8793254fd7157a6106f09c4c3b82fd6514e5d6cef5d146"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DNO5IYKRSCM7ZYEKOBPSDPEHIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse matrix-variate Gaussian process blockmodels for network modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feng Yan, Yuan (Alan) Qi, Zenglin Xu","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"We face network data from various sources, such as protein interactions and online social networks. A critical problem is to model network interactions and identify latent groups of network nodes. This problem is challenging due to many reasons. For example, the network nodes are interdependent instead of independent of each other, and the data are known to be very noisy (e.g., missing edges). To address these challenges, we propose a new relational model for network data, Sparse Matrix-variate Gaussian process Blockmodel (SMGB). Our model generalizes popular bilinear generative models and cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3769","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-18T04:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWttc123IIgpeWy8bPTUrNmdawKSQhH3npNYjxf1Y4MfPsNkLKYurUO5zaNTV0J5F6fPiRrPYe6zR+DHr/jEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T02:12:12.567046Z"},"content_sha256":"8e280fbe42d843fb4ee1eb17e97fb75846da5ab59edc9a34e9ceda983d5c4fa9","schema_version":"1.0","event_id":"sha256:8e280fbe42d843fb4ee1eb17e97fb75846da5ab59edc9a34e9ceda983d5c4fa9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNO5IYKRSCM7ZYEKOBPSDPEHIQ/bundle.json","state_url":"https://pith.science/pith/DNO5IYKRSCM7ZYEKOBPSDPEHIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNO5IYKRSCM7ZYEKOBPSDPEHIQ/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-08-10T02:12:12Z","links":{"resolver":"https://pith.science/pith/DNO5IYKRSCM7ZYEKOBPSDPEHIQ","bundle":"https://pith.science/pith/DNO5IYKRSCM7ZYEKOBPSDPEHIQ/bundle.json","state":"https://pith.science/pith/DNO5IYKRSCM7ZYEKOBPSDPEHIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNO5IYKRSCM7ZYEKOBPSDPEHIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DNO5IYKRSCM7ZYEKOBPSDPEHIQ","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":"c877c6f8dd95a12fba22c4b3df49df7597bc28975abec77c36487abdf50c48eb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"8b23ad7c04a8c726bd513c4e6637593ee5916ec443e9cb8dbfb268707758c3f8"},"schema_version":"1.0","source":{"id":"1202.3769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3769","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3769v1","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3769","created_at":"2026-05-18T04:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"DNO5IYKRSCM7","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DNO5IYKRSCM7ZYEK","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DNO5IYKR","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:8e280fbe42d843fb4ee1eb17e97fb75846da5ab59edc9a34e9ceda983d5c4fa9","target":"graph","created_at":"2026-05-18T04:02:02Z","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 face network data from various sources, such as protein interactions and online social networks. A critical problem is to model network interactions and identify latent groups of network nodes. This problem is challenging due to many reasons. For example, the network nodes are interdependent instead of independent of each other, and the data are known to be very noisy (e.g., missing edges). To address these challenges, we propose a new relational model for network data, Sparse Matrix-variate Gaussian process Blockmodel (SMGB). Our model generalizes popular bilinear generative models and cap","authors_text":"Feng Yan, Yuan (Alan) Qi, Zenglin Xu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title":"Sparse matrix-variate Gaussian process blockmodels for network modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3769","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:2fa5b29afad751300c8793254fd7157a6106f09c4c3b82fd6514e5d6cef5d146","target":"record","created_at":"2026-05-18T04:02:02Z","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":"c877c6f8dd95a12fba22c4b3df49df7597bc28975abec77c36487abdf50c48eb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"8b23ad7c04a8c726bd513c4e6637593ee5916ec443e9cb8dbfb268707758c3f8"},"schema_version":"1.0","source":{"id":"1202.3769","kind":"arxiv","version":1}},"canonical_sha256":"1b5dd461519099fce08a705f21bc87443b58bde3575eb8cbb2248b3a7de9f9a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b5dd461519099fce08a705f21bc87443b58bde3575eb8cbb2248b3a7de9f9a2","first_computed_at":"2026-05-18T04:02:02.890429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:02.890429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"shPef8SR3Y7lhbK56qg0eVZZ/V4QK/rxEV2Gf67t0+mDRNQaDxEkas2yP0biRGtlz0CxYW52BmxsrbQHxS63Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:02.891088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fa5b29afad751300c8793254fd7157a6106f09c4c3b82fd6514e5d6cef5d146","sha256:8e280fbe42d843fb4ee1eb17e97fb75846da5ab59edc9a34e9ceda983d5c4fa9"],"state_sha256":"2b427b33b65f93ad25faef331fb7267af020c1747c441949a2409221f631fc19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LcVR6EEpjl+9gkSOKtDfHWQ3Zj9o1r86xwxYIbgVaBDMQyqcE7G0JwZ58D4CQ/UqLpbk8HvIt/c9JOOMGeBxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T02:12:12.573675Z","bundle_sha256":"12d990264aa529d72d6ba52bcbd61cf2b81525a2e0f7d002152411214588a797"}}