{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AGBTEADC3VA7D3XLCDYTA4D3DV","short_pith_number":"pith:AGBTEADC","schema_version":"1.0","canonical_sha256":"0183320062dd41f1eeeb10f130707b1d6ac055e5321d97db52c5943d369b128f","source":{"kind":"arxiv","id":"1910.00760","version":3},"attestation_state":"computed","paper":{"title":"Efficient Graph Generation with Graph Recurrent Attention Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Charlie Nash, David Duvenaud, Raquel Urtasun, Renjie Liao, Richard S. Zemel, Shenlong Wang, William L. Hamilton, Yang Song, Yujia Li","submitted_at":"2019-10-02T03:28:16Z","abstract_excerpt":"We propose a new family of efficient and expressive deep generative models of graphs, called Graph Recurrent Attention Networks (GRANs). Our model generates graphs one block of nodes and associated edges at a time. The block size and sampling stride allow us to trade off sample quality for efficiency. Compared to previous RNN-based graph generative models, our framework better captures the auto-regressive conditioning between the already-generated and to-be-generated parts of the graph using Graph Neural Networks (GNNs) with attention. This not only reduces the dependency on node ordering but "},"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":"1910.00760","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-02T03:28:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"68127278a0f830ae529a60b3fb311ac5a085c2f25d6b4d560b8cf93115288295","abstract_canon_sha256":"403e84a1ac72e9a0c23aa70d088f84da0be6f6048ada47e8cadc67a04f315112"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:12.494649Z","signature_b64":"lbU6FDUVkPfCndLVeQSYeCorMTASW5Ra4XGsWgy5FxxPC0D9nqqk9QFtNnIKC+BO/JlHcUcG/cbcb7O3fAOnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0183320062dd41f1eeeb10f130707b1d6ac055e5321d97db52c5943d369b128f","last_reissued_at":"2026-07-05T01:20:12.494154Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:12.494154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Graph Generation with Graph Recurrent Attention Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Charlie Nash, David Duvenaud, Raquel Urtasun, Renjie Liao, Richard S. Zemel, Shenlong Wang, William L. Hamilton, Yang Song, Yujia Li","submitted_at":"2019-10-02T03:28:16Z","abstract_excerpt":"We propose a new family of efficient and expressive deep generative models of graphs, called Graph Recurrent Attention Networks (GRANs). Our model generates graphs one block of nodes and associated edges at a time. The block size and sampling stride allow us to trade off sample quality for efficiency. Compared to previous RNN-based graph generative models, our framework better captures the auto-regressive conditioning between the already-generated and to-be-generated parts of the graph using Graph Neural Networks (GNNs) with attention. This not only reduces the dependency on node ordering but "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00760","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.00760/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.00760","created_at":"2026-07-05T01:20:12.494215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.00760v3","created_at":"2026-07-05T01:20:12.494215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00760","created_at":"2026-07-05T01:20:12.494215+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGBTEADC3VA7","created_at":"2026-07-05T01:20:12.494215+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGBTEADC3VA7D3XL","created_at":"2026-07-05T01:20:12.494215+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGBTEADC","created_at":"2026-07-05T01:20:12.494215+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.03015","citing_title":"Discrete Bayesian Sample Inference for Graph Generation","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV","json":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV.json","graph_json":"https://pith.science/api/pith-number/AGBTEADC3VA7D3XLCDYTA4D3DV/graph.json","events_json":"https://pith.science/api/pith-number/AGBTEADC3VA7D3XLCDYTA4D3DV/events.json","paper":"https://pith.science/paper/AGBTEADC"},"agent_actions":{"view_html":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV","download_json":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV.json","view_paper":"https://pith.science/paper/AGBTEADC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.00760&json=true","fetch_graph":"https://pith.science/api/pith-number/AGBTEADC3VA7D3XLCDYTA4D3DV/graph.json","fetch_events":"https://pith.science/api/pith-number/AGBTEADC3VA7D3XLCDYTA4D3DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV/action/storage_attestation","attest_author":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV/action/author_attestation","sign_citation":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV/action/citation_signature","submit_replication":"https://pith.science/pith/AGBTEADC3VA7D3XLCDYTA4D3DV/action/replication_record"}},"created_at":"2026-07-05T01:20:12.494215+00:00","updated_at":"2026-07-05T01:20:12.494215+00:00"}