{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:V27SMM6K3S7FTUK2S4TZ6EBBY6","short_pith_number":"pith:V27SMM6K","schema_version":"1.0","canonical_sha256":"aebf2633cadcbe59d15a97279f1021c78e7ae58f90fe638e0529c2a376dc4e54","source":{"kind":"arxiv","id":"2006.15502","version":1},"attestation_state":"computed","paper":{"title":"Scalable Deep Generative Modeling for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Azade Nazi, Bo Dai, Dale Schuurmans, Hanjun Dai, Yujia Li","submitted_at":"2020-06-28T04:37:57Z","abstract_excerpt":"Learning graph generative models is a challenging task for deep learning and has wide applicability to a range of domains like chemistry, biology and social science. However current deep neural methods suffer from limited scalability: for a graph with $n$ nodes and $m$ edges, existing deep neural methods require $\\Omega(n^2)$ complexity by building up the adjacency matrix. On the other hand, many real world graphs are actually sparse in the sense that $m\\ll n^2$. Based on this, we develop a novel autoregressive model, named BiGG, that utilizes this sparsity to avoid generating the full adjacen"},"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":"2006.15502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-28T04:37:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ac0311110110f7fd0596f3454073e3070bf9bee48240228955a8e202a64e2540","abstract_canon_sha256":"62b833fc018327625a03d732edd261cf1f8a9bd1a19af73ad00c6eae4d84ed6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:14:06.195677Z","signature_b64":"wNc0hIc3nDBn/1GAPEvNEh1SsIFRtCxF70MUmfd9E3Nq12MsjhRSlwnMZaOxLsVY9pkK0xiqeFRIioznBTFMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aebf2633cadcbe59d15a97279f1021c78e7ae58f90fe638e0529c2a376dc4e54","last_reissued_at":"2026-07-05T01:14:06.195270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:14:06.195270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Deep Generative Modeling for Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Azade Nazi, Bo Dai, Dale Schuurmans, Hanjun Dai, Yujia Li","submitted_at":"2020-06-28T04:37:57Z","abstract_excerpt":"Learning graph generative models is a challenging task for deep learning and has wide applicability to a range of domains like chemistry, biology and social science. However current deep neural methods suffer from limited scalability: for a graph with $n$ nodes and $m$ edges, existing deep neural methods require $\\Omega(n^2)$ complexity by building up the adjacency matrix. On the other hand, many real world graphs are actually sparse in the sense that $m\\ll n^2$. Based on this, we develop a novel autoregressive model, named BiGG, that utilizes this sparsity to avoid generating the full adjacen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.15502","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.15502/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":"2006.15502","created_at":"2026-07-05T01:14:06.195341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.15502v1","created_at":"2026-07-05T01:14:06.195341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.15502","created_at":"2026-07-05T01:14:06.195341+00:00"},{"alias_kind":"pith_short_12","alias_value":"V27SMM6K3S7F","created_at":"2026-07-05T01:14:06.195341+00:00"},{"alias_kind":"pith_short_16","alias_value":"V27SMM6K3S7FTUK2","created_at":"2026-07-05T01:14:06.195341+00:00"},{"alias_kind":"pith_short_8","alias_value":"V27SMM6K","created_at":"2026-07-05T01:14:06.195341+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16365","citing_title":"A collaborative constrained graph diffusion model for the generation of realistic synthetic molecules","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6","json":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6.json","graph_json":"https://pith.science/api/pith-number/V27SMM6K3S7FTUK2S4TZ6EBBY6/graph.json","events_json":"https://pith.science/api/pith-number/V27SMM6K3S7FTUK2S4TZ6EBBY6/events.json","paper":"https://pith.science/paper/V27SMM6K"},"agent_actions":{"view_html":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6","download_json":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6.json","view_paper":"https://pith.science/paper/V27SMM6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.15502&json=true","fetch_graph":"https://pith.science/api/pith-number/V27SMM6K3S7FTUK2S4TZ6EBBY6/graph.json","fetch_events":"https://pith.science/api/pith-number/V27SMM6K3S7FTUK2S4TZ6EBBY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/action/storage_attestation","attest_author":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/action/author_attestation","sign_citation":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/action/citation_signature","submit_replication":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/action/replication_record"}},"created_at":"2026-07-05T01:14:06.195341+00:00","updated_at":"2026-07-05T01:14:06.195341+00:00"}