{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EAFVD4EZUOG7BP4CMJ6JKAZGTZ","short_pith_number":"pith:EAFVD4EZ","canonical_record":{"source":{"id":"1905.05738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T17:32:12Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"eb9df5058c86b580428408508fff32a447ce49ea1c19426dc0fdd7fdf3d1c470","abstract_canon_sha256":"65c9db6daadbd9977bad6abd86522b9f1d765db646f3b5a10c0c04ef5d0acc3e"},"schema_version":"1.0"},"canonical_sha256":"200b51f099a38df0bf82627c9503269e6e8ec97992196a4d9e66bcc7a5339f56","source":{"kind":"arxiv","id":"1905.05738","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05738","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05738v1","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05738","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"EAFVD4EZUOG7","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EAFVD4EZUOG7BP4C","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EAFVD4EZ","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EAFVD4EZUOG7BP4CMJ6JKAZGTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T17:32:12Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"eb9df5058c86b580428408508fff32a447ce49ea1c19426dc0fdd7fdf3d1c470","abstract_canon_sha256":"65c9db6daadbd9977bad6abd86522b9f1d765db646f3b5a10c0c04ef5d0acc3e"},"schema_version":"1.0"},"canonical_sha256":"200b51f099a38df0bf82627c9503269e6e8ec97992196a4d9e66bcc7a5339f56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:13.689661Z","signature_b64":"Jpwod8M32bQoqnMLR57FxnPd1GSZBDkG2t17qMZF7fq6byirT6lG1dE4dW8jE9hdrtL9/VrgU9cI8B4A72CUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"200b51f099a38df0bf82627c9503269e6e8ec97992196a4d9e66bcc7a5339f56","last_reissued_at":"2026-05-17T23:46:13.689067Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:13.689067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05738","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-17T23:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJKWmlxrWIjM0xnBVNuIntOMFdI/lhz9RUbrOyJpmOLL+lMqOrEdnLcVcB8UPZnCW03Sv8nrodgBXuqRiZwoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:56:17.541454Z"},"content_sha256":"6c37e4a54f3e4fc0b879b2381c883bfc60e892626cc1ea42733d7a2cb4341137","schema_version":"1.0","event_id":"sha256:6c37e4a54f3e4fc0b879b2381c883bfc60e892626cc1ea42733d7a2cb4341137"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EAFVD4EZUOG7BP4CMJ6JKAZGTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Blockmodels meet Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Lawrence Carin, Nikhil Mehta, Piyush Rai","submitted_at":"2019-05-14T17:32:12Z","abstract_excerpt":"Stochastic blockmodels (SBM) and their variants, $e.g.$, mixed-membership and overlapping stochastic blockmodels, are latent variable based generative models for graphs. They have proven to be successful for various tasks, such as discovering the community structure and link prediction on graph-structured data. Recently, graph neural networks, $e.g.$, graph convolutional networks, have also emerged as a promising approach to learn powerful representations (embeddings) for the nodes in the graph, by exploiting graph properties such as locality and invariance. In this work, we unify these two di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05738","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-17T23:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ssx1N36EWvRZxXfkXeffquWGzl3WbFKVHkJTjVEqaB9jyyMmZ5BmwyDDHtLAz3S7AtEc4GAneH+vZQ9E2nESCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:56:17.541784Z"},"content_sha256":"32cf64323e7fe7d9d181edff16f9990c454bf346546728548d3dd01aea688606","schema_version":"1.0","event_id":"sha256:32cf64323e7fe7d9d181edff16f9990c454bf346546728548d3dd01aea688606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAFVD4EZUOG7BP4CMJ6JKAZGTZ/bundle.json","state_url":"https://pith.science/pith/EAFVD4EZUOG7BP4CMJ6JKAZGTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAFVD4EZUOG7BP4CMJ6JKAZGTZ/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-08T12:56:17Z","links":{"resolver":"https://pith.science/pith/EAFVD4EZUOG7BP4CMJ6JKAZGTZ","bundle":"https://pith.science/pith/EAFVD4EZUOG7BP4CMJ6JKAZGTZ/bundle.json","state":"https://pith.science/pith/EAFVD4EZUOG7BP4CMJ6JKAZGTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAFVD4EZUOG7BP4CMJ6JKAZGTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EAFVD4EZUOG7BP4CMJ6JKAZGTZ","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":"65c9db6daadbd9977bad6abd86522b9f1d765db646f3b5a10c0c04ef5d0acc3e","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T17:32:12Z","title_canon_sha256":"eb9df5058c86b580428408508fff32a447ce49ea1c19426dc0fdd7fdf3d1c470"},"schema_version":"1.0","source":{"id":"1905.05738","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05738","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05738v1","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05738","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"EAFVD4EZUOG7","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EAFVD4EZUOG7BP4C","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EAFVD4EZ","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:32cf64323e7fe7d9d181edff16f9990c454bf346546728548d3dd01aea688606","target":"graph","created_at":"2026-05-17T23:46:13Z","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":"Stochastic blockmodels (SBM) and their variants, $e.g.$, mixed-membership and overlapping stochastic blockmodels, are latent variable based generative models for graphs. They have proven to be successful for various tasks, such as discovering the community structure and link prediction on graph-structured data. Recently, graph neural networks, $e.g.$, graph convolutional networks, have also emerged as a promising approach to learn powerful representations (embeddings) for the nodes in the graph, by exploiting graph properties such as locality and invariance. In this work, we unify these two di","authors_text":"Lawrence Carin, Nikhil Mehta, Piyush Rai","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T17:32:12Z","title":"Stochastic Blockmodels meet Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05738","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:6c37e4a54f3e4fc0b879b2381c883bfc60e892626cc1ea42733d7a2cb4341137","target":"record","created_at":"2026-05-17T23:46:13Z","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":"65c9db6daadbd9977bad6abd86522b9f1d765db646f3b5a10c0c04ef5d0acc3e","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T17:32:12Z","title_canon_sha256":"eb9df5058c86b580428408508fff32a447ce49ea1c19426dc0fdd7fdf3d1c470"},"schema_version":"1.0","source":{"id":"1905.05738","kind":"arxiv","version":1}},"canonical_sha256":"200b51f099a38df0bf82627c9503269e6e8ec97992196a4d9e66bcc7a5339f56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"200b51f099a38df0bf82627c9503269e6e8ec97992196a4d9e66bcc7a5339f56","first_computed_at":"2026-05-17T23:46:13.689067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:13.689067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jpwod8M32bQoqnMLR57FxnPd1GSZBDkG2t17qMZF7fq6byirT6lG1dE4dW8jE9hdrtL9/VrgU9cI8B4A72CUDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:13.689661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05738","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c37e4a54f3e4fc0b879b2381c883bfc60e892626cc1ea42733d7a2cb4341137","sha256:32cf64323e7fe7d9d181edff16f9990c454bf346546728548d3dd01aea688606"],"state_sha256":"17ae066f7f48e991d65238e41e7979ceadd69ca2a6ddf86adca11e204b6903b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"foBFIlAOUedQPcu0iM9wcxCT7JdV6xOUzazyb20anH44uV+AqsJ9PUDYht6kmZPxr8e6S6RcXLfFiSZC/MVABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:56:17.543540Z","bundle_sha256":"a27efee24d5e81466e10170fd6174fd7188930990b59f9e034e57a29ae506b4b"}}