{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J6FJCPMS7SVNVVJABSQIT462EY","short_pith_number":"pith:J6FJCPMS","canonical_record":{"source":{"id":"1706.04289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-14T00:37:07Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"c25b1fe0b60c21e4da47c07c430c6eed17504f18d8c4710d40293836a81064d8","abstract_canon_sha256":"d3321158ae4a3af5be2301344c5d9aed27213b4830bb4f91d401feee61d9e306"},"schema_version":"1.0"},"canonical_sha256":"4f8a913d92fcaadad5200ca089f3da26061cf382aeb9018c5dd0a2ac43352eb6","source":{"kind":"arxiv","id":"1706.04289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04289","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04289v1","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04289","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"J6FJCPMS7SVN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J6FJCPMS7SVNVVJA","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J6FJCPMS","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J6FJCPMS7SVNVVJABSQIT462EY","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-14T00:37:07Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"c25b1fe0b60c21e4da47c07c430c6eed17504f18d8c4710d40293836a81064d8","abstract_canon_sha256":"d3321158ae4a3af5be2301344c5d9aed27213b4830bb4f91d401feee61d9e306"},"schema_version":"1.0"},"canonical_sha256":"4f8a913d92fcaadad5200ca089f3da26061cf382aeb9018c5dd0a2ac43352eb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.075573Z","signature_b64":"XuSri85kC4p0fVmoE0XAURrg9hYEpB7lYwwikbgAqzvCd0GRqLYzsGM+o8f49oSsfO7egXiIwzGUMXmBqX/vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f8a913d92fcaadad5200ca089f3da26061cf382aeb9018c5dd0a2ac43352eb6","last_reissued_at":"2026-05-18T00:42:23.074858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.074858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04289","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:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+HgMlp9dekPjT6vAkHA1KoPIPV50DcRCxmDSRJqca/OXjOZwzR2HUn3E16dyx1RbsuyAMIsDg4nN/KMC7MdYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:29:40.655342Z"},"content_sha256":"6f5d8ac032e0d8d7612d6986629e999f76d346c1f1dd3c8759c00f1aa2d12129","schema_version":"1.0","event_id":"sha256:6f5d8ac032e0d8d7612d6986629e999f76d346c1f1dd3c8759c00f1aa2d12129"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J6FJCPMS7SVNVVJABSQIT462EY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leveraging Node Attributes for Incomplete Relational Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"He Zhao, Lan Du, Wray Buntine","submitted_at":"2017-06-14T00:37:07Z","abstract_excerpt":"Relational data are usually highly incomplete in practice, which inspires us to leverage side information to improve the performance of community detection and link prediction. This paper presents a Bayesian probabilistic approach that incorporates various kinds of node attributes encoded in binary form in relational models with Poisson likelihood. Our method works flexibly with both directed and undirected relational networks. The inference can be done by efficient Gibbs sampling which leverages sparsity of both networks and node attributes. Extensive experiments show that our models achieve "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04289","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:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4Y65bhQ0HxYICodwDIJjG7QUrZmblgQbt2bz4APCZ68woybRwxIkyk7SnBJExH9wTRtJln4CMQuH5yDWsVfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:29:40.655769Z"},"content_sha256":"2776ad477733a678c6ea6827135ac13cdded54e5637ece8603b0a3f97b6aa17d","schema_version":"1.0","event_id":"sha256:2776ad477733a678c6ea6827135ac13cdded54e5637ece8603b0a3f97b6aa17d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6FJCPMS7SVNVVJABSQIT462EY/bundle.json","state_url":"https://pith.science/pith/J6FJCPMS7SVNVVJABSQIT462EY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6FJCPMS7SVNVVJABSQIT462EY/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-25T20:29:40Z","links":{"resolver":"https://pith.science/pith/J6FJCPMS7SVNVVJABSQIT462EY","bundle":"https://pith.science/pith/J6FJCPMS7SVNVVJABSQIT462EY/bundle.json","state":"https://pith.science/pith/J6FJCPMS7SVNVVJABSQIT462EY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6FJCPMS7SVNVVJABSQIT462EY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J6FJCPMS7SVNVVJABSQIT462EY","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":"d3321158ae4a3af5be2301344c5d9aed27213b4830bb4f91d401feee61d9e306","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-14T00:37:07Z","title_canon_sha256":"c25b1fe0b60c21e4da47c07c430c6eed17504f18d8c4710d40293836a81064d8"},"schema_version":"1.0","source":{"id":"1706.04289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04289","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04289v1","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04289","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"J6FJCPMS7SVN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J6FJCPMS7SVNVVJA","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J6FJCPMS","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:2776ad477733a678c6ea6827135ac13cdded54e5637ece8603b0a3f97b6aa17d","target":"graph","created_at":"2026-05-18T00:42:23Z","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":"Relational data are usually highly incomplete in practice, which inspires us to leverage side information to improve the performance of community detection and link prediction. This paper presents a Bayesian probabilistic approach that incorporates various kinds of node attributes encoded in binary form in relational models with Poisson likelihood. Our method works flexibly with both directed and undirected relational networks. The inference can be done by efficient Gibbs sampling which leverages sparsity of both networks and node attributes. Extensive experiments show that our models achieve ","authors_text":"He Zhao, Lan Du, Wray Buntine","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-14T00:37:07Z","title":"Leveraging Node Attributes for Incomplete Relational Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04289","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:6f5d8ac032e0d8d7612d6986629e999f76d346c1f1dd3c8759c00f1aa2d12129","target":"record","created_at":"2026-05-18T00:42:23Z","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":"d3321158ae4a3af5be2301344c5d9aed27213b4830bb4f91d401feee61d9e306","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-14T00:37:07Z","title_canon_sha256":"c25b1fe0b60c21e4da47c07c430c6eed17504f18d8c4710d40293836a81064d8"},"schema_version":"1.0","source":{"id":"1706.04289","kind":"arxiv","version":1}},"canonical_sha256":"4f8a913d92fcaadad5200ca089f3da26061cf382aeb9018c5dd0a2ac43352eb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f8a913d92fcaadad5200ca089f3da26061cf382aeb9018c5dd0a2ac43352eb6","first_computed_at":"2026-05-18T00:42:23.074858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:23.074858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XuSri85kC4p0fVmoE0XAURrg9hYEpB7lYwwikbgAqzvCd0GRqLYzsGM+o8f49oSsfO7egXiIwzGUMXmBqX/vCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:23.075573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f5d8ac032e0d8d7612d6986629e999f76d346c1f1dd3c8759c00f1aa2d12129","sha256:2776ad477733a678c6ea6827135ac13cdded54e5637ece8603b0a3f97b6aa17d"],"state_sha256":"1baa1e605041eb2ded2607bf96c211f604cbaa02976a76fd43fed727ee784029"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFeaCuJ4HPxdZQOaHkNpHDrvWYdIh8iFBdprSq9JmoOSApaY3jtfpEBSUiH3BXtjPgKKYH52qU8zgJrRA/1+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:29:40.657858Z","bundle_sha256":"c93f5db280d9a8ec6f6375ada64192ba8c290f50efd5e4136bae079f60e16486"}}