{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ETEYDDYTFZITT3FL5ROZENX4ZM","short_pith_number":"pith:ETEYDDYT","canonical_record":{"source":{"id":"2011.09679","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-19T06:03:35Z","cross_cats_sorted":[],"title_canon_sha256":"d0eec263c7332191f521181184b5f57bcb922f5f870a76611df799f1e6f3de2a","abstract_canon_sha256":"3a95e89c8b989976325417092b67f6581b4d8724a9f4f770cfb1e5ead4dabb4d"},"schema_version":"1.0"},"canonical_sha256":"24c9818f132e5139ecabec5d9236fccb1ee9409c9468ddd4b59b6139000cf11e","source":{"kind":"arxiv","id":"2011.09679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09679","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09679v1","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09679","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"ETEYDDYTFZIT","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"pith_short_16","alias_value":"ETEYDDYTFZITT3FL","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"pith_short_8","alias_value":"ETEYDDYT","created_at":"2026-07-05T01:52:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ETEYDDYTFZITT3FL5ROZENX4ZM","target":"record","payload":{"canonical_record":{"source":{"id":"2011.09679","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-19T06:03:35Z","cross_cats_sorted":[],"title_canon_sha256":"d0eec263c7332191f521181184b5f57bcb922f5f870a76611df799f1e6f3de2a","abstract_canon_sha256":"3a95e89c8b989976325417092b67f6581b4d8724a9f4f770cfb1e5ead4dabb4d"},"schema_version":"1.0"},"canonical_sha256":"24c9818f132e5139ecabec5d9236fccb1ee9409c9468ddd4b59b6139000cf11e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:51.141395Z","signature_b64":"fUfFJGWiVAlVTXnFqZ+aW+ov9ZJ1VsZeQOfEZOCUeC2ZYyiEdnYbbj3DmpRQjYekICg8M2UOPMNEzrOQr1DbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24c9818f132e5139ecabec5d9236fccb1ee9409c9468ddd4b59b6139000cf11e","last_reissued_at":"2026-07-05T01:52:51.141047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:51.141047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.09679","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:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlDj6m7dFd1h8r/WGCYn0YGJWfun7ZFFfP/A/Fu3TpPHU534vdQj3c3AhgAnrDL9ZA39To5y/V1eL2IoK0YRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:26:40.991663Z"},"content_sha256":"b0ed70ab75b71de255f6b3f809dc3c2d2fb88824f4a3fcaa1de326af32195181","schema_version":"1.0","event_id":"sha256:b0ed70ab75b71de255f6b3f809dc3c2d2fb88824f4a3fcaa1de326af32195181"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ETEYDDYTFZITT3FL5ROZENX4ZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Graph Neural Networks for Heterogeneous Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adam Lerer, Jiajun Shen, Jinyang Li, Lingfan Yu","submitted_at":"2020-11-19T06:03:35Z","abstract_excerpt":"Graph neural networks (GNNs) are a popular class of parametric model for learning over graph-structured data. Recent work has argued that GNNs primarily use the graph for feature smoothing, and have shown competitive results on benchmark tasks by simply operating on graph-smoothed node features, rather than using end-to-end learned feature hierarchies that are challenging to scale to large graphs. In this work, we ask whether these results can be extended to heterogeneous graphs, which encode multiple types of relationship between different entities. We propose Neighbor Averaging over Relation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09679","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/2011.09679/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:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kK2eV21HYCvNbRtJHLuKRndSwTjA6ABFDk6qdbCLnmY8IV4kZqswIqa9hXhvzc1nN5hIWAo0ZwM5ur0UTgqaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:26:40.992203Z"},"content_sha256":"c4903adcf4e506b7a14be2555dad06c7c9b694de0f6419e645b43e074ee106a4","schema_version":"1.0","event_id":"sha256:c4903adcf4e506b7a14be2555dad06c7c9b694de0f6419e645b43e074ee106a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETEYDDYTFZITT3FL5ROZENX4ZM/bundle.json","state_url":"https://pith.science/pith/ETEYDDYTFZITT3FL5ROZENX4ZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETEYDDYTFZITT3FL5ROZENX4ZM/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-04T22:26:40Z","links":{"resolver":"https://pith.science/pith/ETEYDDYTFZITT3FL5ROZENX4ZM","bundle":"https://pith.science/pith/ETEYDDYTFZITT3FL5ROZENX4ZM/bundle.json","state":"https://pith.science/pith/ETEYDDYTFZITT3FL5ROZENX4ZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETEYDDYTFZITT3FL5ROZENX4ZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ETEYDDYTFZITT3FL5ROZENX4ZM","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":"3a95e89c8b989976325417092b67f6581b4d8724a9f4f770cfb1e5ead4dabb4d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-19T06:03:35Z","title_canon_sha256":"d0eec263c7332191f521181184b5f57bcb922f5f870a76611df799f1e6f3de2a"},"schema_version":"1.0","source":{"id":"2011.09679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09679","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09679v1","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09679","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"ETEYDDYTFZIT","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"pith_short_16","alias_value":"ETEYDDYTFZITT3FL","created_at":"2026-07-05T01:52:51Z"},{"alias_kind":"pith_short_8","alias_value":"ETEYDDYT","created_at":"2026-07-05T01:52:51Z"}],"graph_snapshots":[{"event_id":"sha256:c4903adcf4e506b7a14be2555dad06c7c9b694de0f6419e645b43e074ee106a4","target":"graph","created_at":"2026-07-05T01:52:51Z","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/2011.09679/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks (GNNs) are a popular class of parametric model for learning over graph-structured data. Recent work has argued that GNNs primarily use the graph for feature smoothing, and have shown competitive results on benchmark tasks by simply operating on graph-smoothed node features, rather than using end-to-end learned feature hierarchies that are challenging to scale to large graphs. In this work, we ask whether these results can be extended to heterogeneous graphs, which encode multiple types of relationship between different entities. We propose Neighbor Averaging over Relation","authors_text":"Adam Lerer, Jiajun Shen, Jinyang Li, Lingfan Yu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-19T06:03:35Z","title":"Scalable Graph Neural Networks for Heterogeneous Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09679","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:b0ed70ab75b71de255f6b3f809dc3c2d2fb88824f4a3fcaa1de326af32195181","target":"record","created_at":"2026-07-05T01:52:51Z","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":"3a95e89c8b989976325417092b67f6581b4d8724a9f4f770cfb1e5ead4dabb4d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-19T06:03:35Z","title_canon_sha256":"d0eec263c7332191f521181184b5f57bcb922f5f870a76611df799f1e6f3de2a"},"schema_version":"1.0","source":{"id":"2011.09679","kind":"arxiv","version":1}},"canonical_sha256":"24c9818f132e5139ecabec5d9236fccb1ee9409c9468ddd4b59b6139000cf11e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24c9818f132e5139ecabec5d9236fccb1ee9409c9468ddd4b59b6139000cf11e","first_computed_at":"2026-07-05T01:52:51.141047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:51.141047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fUfFJGWiVAlVTXnFqZ+aW+ov9ZJ1VsZeQOfEZOCUeC2ZYyiEdnYbbj3DmpRQjYekICg8M2UOPMNEzrOQr1DbCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:51.141395Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.09679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0ed70ab75b71de255f6b3f809dc3c2d2fb88824f4a3fcaa1de326af32195181","sha256:c4903adcf4e506b7a14be2555dad06c7c9b694de0f6419e645b43e074ee106a4"],"state_sha256":"a79be3602d522545c7b7c13b6e7f9070bb6a16b35ee2b696cbb8c8e91faf1f10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8LvplUTKjYRANWINkeawhkTal5uEs/o7mlbpXdTapomkMXnjdyjV4/kFar/0N/l3+Jo6dQvbIuqQUX8oBWTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T22:26:40.997952Z","bundle_sha256":"7111089e040a743b5cb8c13ac59c20ea86e6bdd35de23648f128eb59c271fc3b"}}