{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YMOEKIZBBKXCPCGLIFZ35AAVU4","short_pith_number":"pith:YMOEKIZB","schema_version":"1.0","canonical_sha256":"c31c4523210aae2788cb4173be8015a732af2968528169550406f414b67212c5","source":{"kind":"arxiv","id":"1802.08773","version":3},"attestation_state":"computed","paper":{"title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Jiaxuan You, Jure Leskovec, Rex Ying, William L. Hamilton, Xiang Ren","submitted_at":"2018-02-24T00:39:09Z","abstract_excerpt":"Modeling and generating graphs is fundamental for studying networks in biology, engineering, and social sciences. However, modeling complex distributions over graphs and then efficiently sampling from these distributions is challenging due to the non-unique, high-dimensional nature of graphs and the complex, non-local dependencies that exist between edges in a given graph. Here we propose GraphRNN, a deep autoregressive model that addresses the above challenges and approximates any distribution of graphs with minimal assumptions about their structure. GraphRNN learns to generate graphs by trai"},"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":"1802.08773","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T00:39:09Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"1be42868dd3b0a7ab8252bc449e7d61697bf6e1b4795f51b1b63d4b7e122a35b","abstract_canon_sha256":"87e9bc3d7f272b15ca974adad315accc4f57e9dd84ead9db5bbbe812d9b2f68b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:32.141260Z","signature_b64":"UDHBrN6L1aadCoXw932qUp0+o7qKUaiD31omXdhkN/NkH59QVCks589G8cHHVG0mCS8GRIMuzGmP2ncjMpNLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c31c4523210aae2788cb4173be8015a732af2968528169550406f414b67212c5","last_reissued_at":"2026-05-18T00:12:32.140674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:32.140674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Jiaxuan You, Jure Leskovec, Rex Ying, William L. Hamilton, Xiang Ren","submitted_at":"2018-02-24T00:39:09Z","abstract_excerpt":"Modeling and generating graphs is fundamental for studying networks in biology, engineering, and social sciences. However, modeling complex distributions over graphs and then efficiently sampling from these distributions is challenging due to the non-unique, high-dimensional nature of graphs and the complex, non-local dependencies that exist between edges in a given graph. Here we propose GraphRNN, a deep autoregressive model that addresses the above challenges and approximates any distribution of graphs with minimal assumptions about their structure. GraphRNN learns to generate graphs by trai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08773","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":""},"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":"1802.08773","created_at":"2026-05-18T00:12:32.140763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08773v3","created_at":"2026-05-18T00:12:32.140763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08773","created_at":"2026-05-18T00:12:32.140763+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMOEKIZBBKXC","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMOEKIZBBKXCPCGL","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMOEKIZB","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.05315","citing_title":"Graph Neural Based End-to-end Data Association Framework for Online Multiple-Object Tracking","ref_index":88,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05743","citing_title":"Semi-Supervised Graph Embedding for Multi-Label Graph Node Classification","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2511.03015","citing_title":"Discrete Bayesian Sample Inference for Graph Generation","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4","json":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4.json","graph_json":"https://pith.science/api/pith-number/YMOEKIZBBKXCPCGLIFZ35AAVU4/graph.json","events_json":"https://pith.science/api/pith-number/YMOEKIZBBKXCPCGLIFZ35AAVU4/events.json","paper":"https://pith.science/paper/YMOEKIZB"},"agent_actions":{"view_html":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4","download_json":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4.json","view_paper":"https://pith.science/paper/YMOEKIZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08773&json=true","fetch_graph":"https://pith.science/api/pith-number/YMOEKIZBBKXCPCGLIFZ35AAVU4/graph.json","fetch_events":"https://pith.science/api/pith-number/YMOEKIZBBKXCPCGLIFZ35AAVU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4/action/storage_attestation","attest_author":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4/action/author_attestation","sign_citation":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4/action/citation_signature","submit_replication":"https://pith.science/pith/YMOEKIZBBKXCPCGLIFZ35AAVU4/action/replication_record"}},"created_at":"2026-05-18T00:12:32.140763+00:00","updated_at":"2026-05-18T00:12:32.140763+00:00"}