{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EQX4C75X7CF2Y6Q5WTWWMMCHII","short_pith_number":"pith:EQX4C75X","schema_version":"1.0","canonical_sha256":"242fc17fb7f88bac7a1db4ed6630474229e7406c85a3193d1c0d00f4165049da","source":{"kind":"arxiv","id":"1803.03324","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.03324","created_at":"2026-05-18T00:21:39.972340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03324v1","created_at":"2026-05-18T00:21:39.972340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03324","created_at":"2026-05-18T00:21:39.972340+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQX4C75X7CF2","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQX4C75X7CF2Y6Q5","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQX4C75X","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2601.15133","citing_title":"Building Deep Graph Predictors with Graph Imitation Learning","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17773","citing_title":"PlantPose: Universal Plant Skeleton Estimation via Tree-constrained Graph Generation","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09065","citing_title":"Dependency-Aware Discrete Diffusion for Scene Graph Generation","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06239","citing_title":"When Graph Language Models Go Beyond Memorization","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII","json":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII.json","graph_json":"https://pith.science/api/pith-number/EQX4C75X7CF2Y6Q5WTWWMMCHII/graph.json","events_json":"https://pith.science/api/pith-number/EQX4C75X7CF2Y6Q5WTWWMMCHII/events.json","paper":"https://pith.science/paper/EQX4C75X"},"agent_actions":{"view_html":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII","download_json":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII.json","view_paper":"https://pith.science/paper/EQX4C75X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03324&json=true","fetch_graph":"https://pith.science/api/pith-number/EQX4C75X7CF2Y6Q5WTWWMMCHII/graph.json","fetch_events":"https://pith.science/api/pith-number/EQX4C75X7CF2Y6Q5WTWWMMCHII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/action/storage_attestation","attest_author":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/action/author_attestation","sign_citation":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/action/citation_signature","submit_replication":"https://pith.science/pith/EQX4C75X7CF2Y6Q5WTWWMMCHII/action/replication_record"}},"created_at":"2026-05-18T00:21:39.972340+00:00","updated_at":"2026-05-18T00:21:39.972340+00:00"}