{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RLSZKFZPFIOOBTHRANLNOB3D7A","short_pith_number":"pith:RLSZKFZP","canonical_record":{"source":{"id":"1903.02640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T22:36:57Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"3552e14677f4c50577e30a7be2a2753826d1ace8009ef3e959b7cb97d695cd46","abstract_canon_sha256":"5a2f727a641e83bad3f842182608a7b219794172c3b8cd6ed7e2c02e6daed781"},"schema_version":"1.0"},"canonical_sha256":"8ae595172f2a1ce0ccf10356d70763f80e1de5e8dc5c03d8b8bc15021d29785e","source":{"kind":"arxiv","id":"1903.02640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02640","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02640v1","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02640","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"RLSZKFZPFIOO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RLSZKFZPFIOOBTHR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RLSZKFZP","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RLSZKFZPFIOOBTHRANLNOB3D7A","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T22:36:57Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"3552e14677f4c50577e30a7be2a2753826d1ace8009ef3e959b7cb97d695cd46","abstract_canon_sha256":"5a2f727a641e83bad3f842182608a7b219794172c3b8cd6ed7e2c02e6daed781"},"schema_version":"1.0"},"canonical_sha256":"8ae595172f2a1ce0ccf10356d70763f80e1de5e8dc5c03d8b8bc15021d29785e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:37.644292Z","signature_b64":"UUMh2q0LL2dcszNlDGcCpKFwKPGwgjL6FTHdmA6Vex556+3l6Moj8TbLbrq5py4fXfbqG8QTklWXuoRMBN6RAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae595172f2a1ce0ccf10356d70763f80e1de5e8dc5c03d8b8bc15021d29785e","last_reissued_at":"2026-05-17T23:44:37.643850Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:37.643850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02640","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-05-17T23:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1I5UdcRyeWSIN7xZHVkcy0LaAfnEa4/Lc5NZFcd9GF+O/UjH13p5/kvSZktvLbvKu7VMroYjxnandss0rAcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:20:47.114856Z"},"content_sha256":"afe024f6bd1022934c899e84f431a4e25059f498ac3879773e77ae24626eb085","schema_version":"1.0","event_id":"sha256:afe024f6bd1022934c899e84f431a4e25059f498ac3879773e77ae24626eb085"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RLSZKFZPFIOOBTHRANLNOB3D7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generative Graph Convolutional Network for Growing Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chuanwei Ruan, Da Xu, Evren Korpeoglu, Kamiya Motwani, Kannan Achan, Sushant Kumar","submitted_at":"2019-03-06T22:36:57Z","abstract_excerpt":"Modeling generative process of growing graphs has wide applications in social networks and recommendation systems, where cold start problem leads to new nodes isolated from existing graph. Despite the emerging literature in learning graph representation and graph generation, most of them can not handle isolated new nodes without nontrivial modifications. The challenge arises due to the fact that learning to generate representations for nodes in observed graph relies heavily on topological features, whereas for new nodes only node attributes are available. Here we propose a unified generative g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02640","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"},"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-05-17T23:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hbK9pUEC5ULw5oaM+zxcgWlDjYeUvY79wh9BCkSaYOLbFpEEs5N9n57j8mbanvk+pnlgqfkQd6WiefwBy1GAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:20:47.115214Z"},"content_sha256":"2b7899523a91f8406d7ffb39b96144306b680a5ac94560970d96568c91c1b376","schema_version":"1.0","event_id":"sha256:2b7899523a91f8406d7ffb39b96144306b680a5ac94560970d96568c91c1b376"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLSZKFZPFIOOBTHRANLNOB3D7A/bundle.json","state_url":"https://pith.science/pith/RLSZKFZPFIOOBTHRANLNOB3D7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLSZKFZPFIOOBTHRANLNOB3D7A/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-05-31T20:20:47Z","links":{"resolver":"https://pith.science/pith/RLSZKFZPFIOOBTHRANLNOB3D7A","bundle":"https://pith.science/pith/RLSZKFZPFIOOBTHRANLNOB3D7A/bundle.json","state":"https://pith.science/pith/RLSZKFZPFIOOBTHRANLNOB3D7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLSZKFZPFIOOBTHRANLNOB3D7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RLSZKFZPFIOOBTHRANLNOB3D7A","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":"5a2f727a641e83bad3f842182608a7b219794172c3b8cd6ed7e2c02e6daed781","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T22:36:57Z","title_canon_sha256":"3552e14677f4c50577e30a7be2a2753826d1ace8009ef3e959b7cb97d695cd46"},"schema_version":"1.0","source":{"id":"1903.02640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02640","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02640v1","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02640","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"RLSZKFZPFIOO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RLSZKFZPFIOOBTHR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RLSZKFZP","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:2b7899523a91f8406d7ffb39b96144306b680a5ac94560970d96568c91c1b376","target":"graph","created_at":"2026-05-17T23:44:37Z","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"},"paper":{"abstract_excerpt":"Modeling generative process of growing graphs has wide applications in social networks and recommendation systems, where cold start problem leads to new nodes isolated from existing graph. Despite the emerging literature in learning graph representation and graph generation, most of them can not handle isolated new nodes without nontrivial modifications. The challenge arises due to the fact that learning to generate representations for nodes in observed graph relies heavily on topological features, whereas for new nodes only node attributes are available. Here we propose a unified generative g","authors_text":"Chuanwei Ruan, Da Xu, Evren Korpeoglu, Kamiya Motwani, Kannan Achan, Sushant Kumar","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T22:36:57Z","title":"Generative Graph Convolutional Network for Growing Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02640","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:afe024f6bd1022934c899e84f431a4e25059f498ac3879773e77ae24626eb085","target":"record","created_at":"2026-05-17T23:44:37Z","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":"5a2f727a641e83bad3f842182608a7b219794172c3b8cd6ed7e2c02e6daed781","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T22:36:57Z","title_canon_sha256":"3552e14677f4c50577e30a7be2a2753826d1ace8009ef3e959b7cb97d695cd46"},"schema_version":"1.0","source":{"id":"1903.02640","kind":"arxiv","version":1}},"canonical_sha256":"8ae595172f2a1ce0ccf10356d70763f80e1de5e8dc5c03d8b8bc15021d29785e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ae595172f2a1ce0ccf10356d70763f80e1de5e8dc5c03d8b8bc15021d29785e","first_computed_at":"2026-05-17T23:44:37.643850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:37.643850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UUMh2q0LL2dcszNlDGcCpKFwKPGwgjL6FTHdmA6Vex556+3l6Moj8TbLbrq5py4fXfbqG8QTklWXuoRMBN6RAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:37.644292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afe024f6bd1022934c899e84f431a4e25059f498ac3879773e77ae24626eb085","sha256:2b7899523a91f8406d7ffb39b96144306b680a5ac94560970d96568c91c1b376"],"state_sha256":"e0d25266ab095d6d6c3d740b0265f80380383c0468580d30468cb88f723320a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFsRbdY/3Qp++7FF2bzG68yIeRMnTYaoF1lz3vDFYwUVQ/ugIyl+FAoP1nRtVAr9S7NWu/jphgMAfPJ5kLA1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:20:47.117504Z","bundle_sha256":"fafc5ac5a263da3d5ac138ca3e16a0daa454cfc36c1859124c5c468631602cf8"}}