{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:V27SMM6K3S7FTUK2S4TZ6EBBY6","short_pith_number":"pith:V27SMM6K","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"},"canonical_sha256":"aebf2633cadcbe59d15a97279f1021c78e7ae58f90fe638e0529c2a376dc4e54","source":{"kind":"arxiv","id":"2006.15502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.15502","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"2006.15502v1","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.15502","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"V27SMM6K3S7F","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"pith_short_16","alias_value":"V27SMM6K3S7FTUK2","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"pith_short_8","alias_value":"V27SMM6K","created_at":"2026-07-05T01:14:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:V27SMM6K3S7FTUK2S4TZ6EBBY6","target":"record","payload":{"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"},"canonical_sha256":"aebf2633cadcbe59d15a97279f1021c78e7ae58f90fe638e0529c2a376dc4e54","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"},"source_kind":"arxiv","source_id":"2006.15502","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-07-05T01:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74G+UXMgGd1Xm6Q6Q0qi7w6EyqsaZVJVSZtpZi8SdzEcdaDymNpz3IlXUf4899kPoaztvBrwUyHJPQBsCVQTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:37:13.648820Z"},"content_sha256":"3dbe79dff0b80963192c63545e7cfdd99ff63372135730a9f0bd2d3fa8dac8bb","schema_version":"1.0","event_id":"sha256:3dbe79dff0b80963192c63545e7cfdd99ff63372135730a9f0bd2d3fa8dac8bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:V27SMM6K3S7FTUK2S4TZ6EBBY6","target":"graph","payload":{"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"},"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-07-05T01:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wuiL3OABjuyoJVEdhZaRhoLHP+7QuLZRQX71moVioxQDfN9Xc2B1jvfjNji3LVTslgj0DMaUNlD/uBCNHcasBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:37:13.649394Z"},"content_sha256":"3823e9f901f24c45f413fb044fa2e765212e7d1ffb4ee1f9b80645c92bc6b9e8","schema_version":"1.0","event_id":"sha256:3823e9f901f24c45f413fb044fa2e765212e7d1ffb4ee1f9b80645c92bc6b9e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/bundle.json","state_url":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/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-08-14T08:37:13Z","links":{"resolver":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6","bundle":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/bundle.json","state":"https://pith.science/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V27SMM6K3S7FTUK2S4TZ6EBBY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:V27SMM6K3S7FTUK2S4TZ6EBBY6","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":"62b833fc018327625a03d732edd261cf1f8a9bd1a19af73ad00c6eae4d84ed6a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-28T04:37:57Z","title_canon_sha256":"ac0311110110f7fd0596f3454073e3070bf9bee48240228955a8e202a64e2540"},"schema_version":"1.0","source":{"id":"2006.15502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.15502","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"2006.15502v1","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.15502","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"V27SMM6K3S7F","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"pith_short_16","alias_value":"V27SMM6K3S7FTUK2","created_at":"2026-07-05T01:14:06Z"},{"alias_kind":"pith_short_8","alias_value":"V27SMM6K","created_at":"2026-07-05T01:14:06Z"}],"graph_snapshots":[{"event_id":"sha256:3823e9f901f24c45f413fb044fa2e765212e7d1ffb4ee1f9b80645c92bc6b9e8","target":"graph","created_at":"2026-07-05T01:14:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.15502/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Azade Nazi, Bo Dai, Dale Schuurmans, Hanjun Dai, Yujia Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-28T04:37:57Z","title":"Scalable Deep Generative Modeling for Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.15502","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:3dbe79dff0b80963192c63545e7cfdd99ff63372135730a9f0bd2d3fa8dac8bb","target":"record","created_at":"2026-07-05T01:14:06Z","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":"62b833fc018327625a03d732edd261cf1f8a9bd1a19af73ad00c6eae4d84ed6a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-28T04:37:57Z","title_canon_sha256":"ac0311110110f7fd0596f3454073e3070bf9bee48240228955a8e202a64e2540"},"schema_version":"1.0","source":{"id":"2006.15502","kind":"arxiv","version":1}},"canonical_sha256":"aebf2633cadcbe59d15a97279f1021c78e7ae58f90fe638e0529c2a376dc4e54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aebf2633cadcbe59d15a97279f1021c78e7ae58f90fe638e0529c2a376dc4e54","first_computed_at":"2026-07-05T01:14:06.195270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:14:06.195270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wNc0hIc3nDBn/1GAPEvNEh1SsIFRtCxF70MUmfd9E3Nq12MsjhRSlwnMZaOxLsVY9pkK0xiqeFRIioznBTFMBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:14:06.195677Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.15502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dbe79dff0b80963192c63545e7cfdd99ff63372135730a9f0bd2d3fa8dac8bb","sha256:3823e9f901f24c45f413fb044fa2e765212e7d1ffb4ee1f9b80645c92bc6b9e8"],"state_sha256":"ac3bd0b2fa9aff4a6f271a0aecbc8eac5235981186cb5aa736bfa63d66b73b9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqvQavtJ+fAqUUJHMnsbsJFeTBM+IPZ20Sd2sKbL8N7DVhjF23l+8j+BZS3vVyXEKkklMo24Zq5WoJJb/M5IAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:37:13.655551Z","bundle_sha256":"3a4fc33c1c7e4937eb79fa09488d1ed5239e133261dc7890f6570bfe92a9b26e"}}