{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EQX4C75X7CF2Y6Q5WTWWMMCHII","short_pith_number":"pith:EQX4C75X","canonical_record":{"source":{"id":"1803.03324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-08T22:20:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a492a0369df461efa9cb2a7ce75596fdd198cd88974bacccf1835175ca3604e6","abstract_canon_sha256":"f6254c0f4ffcaa169fa66a9e33d02929a1550e004a2d3d803e373c7bdcc25b5d"},"schema_version":"1.0"},"canonical_sha256":"242fc17fb7f88bac7a1db4ed6630474229e7406c85a3193d1c0d00f4165049da","source":{"kind":"arxiv","id":"1803.03324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03324","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03324v1","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03324","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"EQX4C75X7CF2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EQX4C75X7CF2Y6Q5","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EQX4C75X","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EQX4C75X7CF2Y6Q5WTWWMMCHII","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-08T22:20:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a492a0369df461efa9cb2a7ce75596fdd198cd88974bacccf1835175ca3604e6","abstract_canon_sha256":"f6254c0f4ffcaa169fa66a9e33d02929a1550e004a2d3d803e373c7bdcc25b5d"},"schema_version":"1.0"},"canonical_sha256":"242fc17fb7f88bac7a1db4ed6630474229e7406c85a3193d1c0d00f4165049da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:39.973023Z","signature_b64":"oKshMOISErVlVJ8aqcDm0QXaELGebxByA/g6I1ApSHyp90+sPb8iA8A1Ib6836dc2hqFZy81BndNUs4FHjaDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"242fc17fb7f88bac7a1db4ed6630474229e7406c85a3193d1c0d00f4165049da","last_reissued_at":"2026-05-18T00:21:39.972183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:39.972183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03324","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:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AS+hZP3pEGQIvkUWGNZ+mrhfSNZrFECye4Tfe48P/fNUOpq+n7mQZToHjugE5e2N8auX8W84qchiSwSkK8RwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:10:25.194343Z"},"content_sha256":"e990340b0799c7200d26e0646e587af2dff2e04e57cf7d250b588d2935cd6565","schema_version":"1.0","event_id":"sha256:e990340b0799c7200d26e0646e587af2dff2e04e57cf7d250b588d2935cd6565"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EQX4C75X7CF2Y6Q5WTWWMMCHII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Deep Generative Models of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris Dyer, Oriol Vinyals, Peter Battaglia, Razvan Pascanu, Yujia Li","submitted_at":"2018-03-08T22:20:00Z","abstract_excerpt":"Graphs are fundamental data structures which concisely capture the relational structure in many important real-world domains, such as knowledge graphs, physical and social interactions, language, and chemistry. Here we introduce a powerful new approach for learning generative models over graphs, which can capture both their structure and attributes. Our approach uses graph neural networks to express probabilistic dependencies among a graph's nodes and edges, and can, in principle, learn distributions over any arbitrary graph. In a series of experiments our results show that once trained, our m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03324","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:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2yuvsTjz89ybKw3cPB2TZpxnEVeblbyXB/E+lE6M9XDug+te+tnqgtcC3RDcwu/1iG4TXtdz0pJ7WqswblkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:10:25.195104Z"},"content_sha256":"b61e95ab7beff38629dab40c908889c9a48fa7ab562f1f15a7fbf2d4bff6f239","schema_version":"1.0","event_id":"sha256:b61e95ab7beff38629dab40c908889c9a48fa7ab562f1f15a7fbf2d4bff6f239"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/bundle.json","state_url":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/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-10T10:10:25Z","links":{"resolver":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII","bundle":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/bundle.json","state":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EQX4C75X7CF2Y6Q5WTWWMMCHII","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":"f6254c0f4ffcaa169fa66a9e33d02929a1550e004a2d3d803e373c7bdcc25b5d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-08T22:20:00Z","title_canon_sha256":"a492a0369df461efa9cb2a7ce75596fdd198cd88974bacccf1835175ca3604e6"},"schema_version":"1.0","source":{"id":"1803.03324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03324","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03324v1","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03324","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"EQX4C75X7CF2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EQX4C75X7CF2Y6Q5","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EQX4C75X","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:b61e95ab7beff38629dab40c908889c9a48fa7ab562f1f15a7fbf2d4bff6f239","target":"graph","created_at":"2026-05-18T00:21:39Z","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":"Graphs are fundamental data structures which concisely capture the relational structure in many important real-world domains, such as knowledge graphs, physical and social interactions, language, and chemistry. Here we introduce a powerful new approach for learning generative models over graphs, which can capture both their structure and attributes. Our approach uses graph neural networks to express probabilistic dependencies among a graph's nodes and edges, and can, in principle, learn distributions over any arbitrary graph. In a series of experiments our results show that once trained, our m","authors_text":"Chris Dyer, Oriol Vinyals, Peter Battaglia, Razvan Pascanu, Yujia Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-08T22:20:00Z","title":"Learning Deep Generative Models of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03324","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:e990340b0799c7200d26e0646e587af2dff2e04e57cf7d250b588d2935cd6565","target":"record","created_at":"2026-05-18T00:21:39Z","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":"f6254c0f4ffcaa169fa66a9e33d02929a1550e004a2d3d803e373c7bdcc25b5d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-08T22:20:00Z","title_canon_sha256":"a492a0369df461efa9cb2a7ce75596fdd198cd88974bacccf1835175ca3604e6"},"schema_version":"1.0","source":{"id":"1803.03324","kind":"arxiv","version":1}},"canonical_sha256":"242fc17fb7f88bac7a1db4ed6630474229e7406c85a3193d1c0d00f4165049da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"242fc17fb7f88bac7a1db4ed6630474229e7406c85a3193d1c0d00f4165049da","first_computed_at":"2026-05-18T00:21:39.972183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:39.972183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oKshMOISErVlVJ8aqcDm0QXaELGebxByA/g6I1ApSHyp90+sPb8iA8A1Ib6836dc2hqFZy81BndNUs4FHjaDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:39.973023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e990340b0799c7200d26e0646e587af2dff2e04e57cf7d250b588d2935cd6565","sha256:b61e95ab7beff38629dab40c908889c9a48fa7ab562f1f15a7fbf2d4bff6f239"],"state_sha256":"7498071d5139f232bbd62c53458d2b6d7690996092222c6d900449bf6cfda071"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MEDeppSSuy2RnSRKcv+LGqL4FOexpOZQ9FBl9rIBXahx4iDYy83uzVgi3Ein50OlXz+q899aypYaxmhOqwlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:10:25.199276Z","bundle_sha256":"c9ae385c9450d4c91ff7fa23c8bd52c44e43e52d09cd13e87b71a37fa44e46e7"}}