{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:INCKBX2DT4LOGQS5WJMJTD5XK5","short_pith_number":"pith:INCKBX2D","canonical_record":{"source":{"id":"2012.11147","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-21T06:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"35bfdc8d8e87dc0aa3d6ac61749dd5d0bc036e93cab1509dbd4c5a8c6aca2e93","abstract_canon_sha256":"eded859e91c5cb51251bc1b8457958864ef740f546546a70a148b42129b4a4ec"},"schema_version":"1.0"},"canonical_sha256":"4344a0df439f16e3425db258998fb75763d0cd282e5ee4540be6260a930d61a9","source":{"kind":"arxiv","id":"2012.11147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.11147","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"2012.11147v1","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.11147","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"INCKBX2DT4LO","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"pith_short_16","alias_value":"INCKBX2DT4LOGQS5","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"pith_short_8","alias_value":"INCKBX2D","created_at":"2026-07-05T02:00:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:INCKBX2DT4LOGQS5WJMJTD5XK5","target":"record","payload":{"canonical_record":{"source":{"id":"2012.11147","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-21T06:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"35bfdc8d8e87dc0aa3d6ac61749dd5d0bc036e93cab1509dbd4c5a8c6aca2e93","abstract_canon_sha256":"eded859e91c5cb51251bc1b8457958864ef740f546546a70a148b42129b4a4ec"},"schema_version":"1.0"},"canonical_sha256":"4344a0df439f16e3425db258998fb75763d0cd282e5ee4540be6260a930d61a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:59.071737Z","signature_b64":"236T8N3K2e+UdWU+EfzogzEL6vi9VfJBH1cPkvM07KhanwAs9MRC+CxhIOudoj38BAShEHO3qqDefgaoSRozDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4344a0df439f16e3425db258998fb75763d0cd282e5ee4540be6260a930d61a9","last_reissued_at":"2026-07-05T02:00:59.071361Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:59.071361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.11147","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-05T02:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFa/AsXmnWdKGWFAADPKMivgNsaUVjwIXHtzHaR2qV7VB8yXUnaNK+X26V3HSLUP8ErWdyXdOWWvWcyBcuQRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:23:33.380640Z"},"content_sha256":"56ca544bfb57dc11120383244f297cf67e46b5b236012acc83306b2eaae32fcc","schema_version":"1.0","event_id":"sha256:56ca544bfb57dc11120383244f297cf67e46b5b236012acc83306b2eaae32fcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:INCKBX2DT4LOGQS5WJMJTD5XK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hop-Hop Relation-aware Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haiping Lu, Li Zhang, Yan Ge","submitted_at":"2020-12-21T06:58:38Z","abstract_excerpt":"Graph Neural Networks (GNNs) are widely used in graph representation learning. However, most GNN methods are designed for either homogeneous or heterogeneous graphs. In this paper, we propose a new model, Hop-Hop Relation-aware Graph Neural Network (HHR-GNN), to unify representation learning for these two types of graphs. HHR-GNN learns a personalized receptive field for each node by leveraging knowledge graph embedding to learn relation scores between the central node's representations at different hops. In neighborhood aggregation, our model simultaneously allows for hop-aware projection and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.11147","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/2012.11147/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-05T02:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yA/CsZg8jRSGvAz9XrXHeOifM/k/uMMvfi1kJJmxTT/e3usAh09ycRXt3Evvd5/KCCCk8aQYyR17LOXJALMMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:23:33.381116Z"},"content_sha256":"faf098d94317a2d8d5ccb5ac606be9fa912e373c71d6abc4d92b99eebb7f68bd","schema_version":"1.0","event_id":"sha256:faf098d94317a2d8d5ccb5ac606be9fa912e373c71d6abc4d92b99eebb7f68bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INCKBX2DT4LOGQS5WJMJTD5XK5/bundle.json","state_url":"https://pith.science/pith/INCKBX2DT4LOGQS5WJMJTD5XK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INCKBX2DT4LOGQS5WJMJTD5XK5/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-09T06:23:33Z","links":{"resolver":"https://pith.science/pith/INCKBX2DT4LOGQS5WJMJTD5XK5","bundle":"https://pith.science/pith/INCKBX2DT4LOGQS5WJMJTD5XK5/bundle.json","state":"https://pith.science/pith/INCKBX2DT4LOGQS5WJMJTD5XK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INCKBX2DT4LOGQS5WJMJTD5XK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:INCKBX2DT4LOGQS5WJMJTD5XK5","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":"eded859e91c5cb51251bc1b8457958864ef740f546546a70a148b42129b4a4ec","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-21T06:58:38Z","title_canon_sha256":"35bfdc8d8e87dc0aa3d6ac61749dd5d0bc036e93cab1509dbd4c5a8c6aca2e93"},"schema_version":"1.0","source":{"id":"2012.11147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.11147","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"2012.11147v1","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.11147","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"INCKBX2DT4LO","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"pith_short_16","alias_value":"INCKBX2DT4LOGQS5","created_at":"2026-07-05T02:00:59Z"},{"alias_kind":"pith_short_8","alias_value":"INCKBX2D","created_at":"2026-07-05T02:00:59Z"}],"graph_snapshots":[{"event_id":"sha256:faf098d94317a2d8d5ccb5ac606be9fa912e373c71d6abc4d92b99eebb7f68bd","target":"graph","created_at":"2026-07-05T02:00:59Z","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/2012.11147/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) are widely used in graph representation learning. However, most GNN methods are designed for either homogeneous or heterogeneous graphs. In this paper, we propose a new model, Hop-Hop Relation-aware Graph Neural Network (HHR-GNN), to unify representation learning for these two types of graphs. HHR-GNN learns a personalized receptive field for each node by leveraging knowledge graph embedding to learn relation scores between the central node's representations at different hops. In neighborhood aggregation, our model simultaneously allows for hop-aware projection and","authors_text":"Haiping Lu, Li Zhang, Yan Ge","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-21T06:58:38Z","title":"Hop-Hop Relation-aware Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.11147","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:56ca544bfb57dc11120383244f297cf67e46b5b236012acc83306b2eaae32fcc","target":"record","created_at":"2026-07-05T02:00:59Z","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":"eded859e91c5cb51251bc1b8457958864ef740f546546a70a148b42129b4a4ec","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-21T06:58:38Z","title_canon_sha256":"35bfdc8d8e87dc0aa3d6ac61749dd5d0bc036e93cab1509dbd4c5a8c6aca2e93"},"schema_version":"1.0","source":{"id":"2012.11147","kind":"arxiv","version":1}},"canonical_sha256":"4344a0df439f16e3425db258998fb75763d0cd282e5ee4540be6260a930d61a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4344a0df439f16e3425db258998fb75763d0cd282e5ee4540be6260a930d61a9","first_computed_at":"2026-07-05T02:00:59.071361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:00:59.071361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"236T8N3K2e+UdWU+EfzogzEL6vi9VfJBH1cPkvM07KhanwAs9MRC+CxhIOudoj38BAShEHO3qqDefgaoSRozDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:00:59.071737Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.11147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56ca544bfb57dc11120383244f297cf67e46b5b236012acc83306b2eaae32fcc","sha256:faf098d94317a2d8d5ccb5ac606be9fa912e373c71d6abc4d92b99eebb7f68bd"],"state_sha256":"5d1dfe595a935b734c4957df5b6ab3e7e4dabaf734d6e02e864d67d4dbd51bb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5Kuxz8PuPMfs1ib22Omnd1gRLs18v0/HA7yntWATHqLm9ItZeknMqAHFkNWdmBiEh5qarZ4FbOOIQOdv/shCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T06:23:33.384592Z","bundle_sha256":"3f31fd16241379502e4fbed437eac5b87731e2c13430c5bba762ac6889eb7c3e"}}