{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TV6KRRGTCIHG2RU6YWK2YT7HLL","short_pith_number":"pith:TV6KRRGT","canonical_record":{"source":{"id":"1903.07293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-18T08:19:40Z","cross_cats_sorted":[],"title_canon_sha256":"fa831d7436c794c73d20adc295ce59b5dce72da84bfc524d8d921b390cce4786","abstract_canon_sha256":"625e602c8eeafcc62821d560f035806a236fabbe831a9f934a93a21adb2f0461"},"schema_version":"1.0"},"canonical_sha256":"9d7ca8c4d3120e6d469ec595ac4fe75ac976a1ec44a20db1c3467376866437ee","source":{"kind":"arxiv","id":"1903.07293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07293","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07293v2","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07293","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"pith_short_12","alias_value":"TV6KRRGTCIHG","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"pith_short_16","alias_value":"TV6KRRGTCIHG2RU6","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"pith_short_8","alias_value":"TV6KRRGT","created_at":"2026-07-05T02:08:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TV6KRRGTCIHG2RU6YWK2YT7HLL","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-18T08:19:40Z","cross_cats_sorted":[],"title_canon_sha256":"fa831d7436c794c73d20adc295ce59b5dce72da84bfc524d8d921b390cce4786","abstract_canon_sha256":"625e602c8eeafcc62821d560f035806a236fabbe831a9f934a93a21adb2f0461"},"schema_version":"1.0"},"canonical_sha256":"9d7ca8c4d3120e6d469ec595ac4fe75ac976a1ec44a20db1c3467376866437ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:16.023166Z","signature_b64":"2DdnOBNX9AcZB2fksSHQnz3pOo5QmRmLLfDrJwF7exAbsdo6aOmgSCOqq2CI6DGbvVGJrimB9ckkNjc1qxniBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d7ca8c4d3120e6d469ec595ac4fe75ac976a1ec44a20db1c3467376866437ee","last_reissued_at":"2026-07-05T02:08:16.022625Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:16.022625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07293","source_version":2,"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:08:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VdtWz0uC4FQj1ailjTZmHb0iOldtHY+tajn5P+pszo+IJNvuodV3J/3vg73EMy/oUOomLaPfxo/qepGb6VWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:33:29.222071Z"},"content_sha256":"5efe1811a6b1abbdf6053c3b362526aaa14857b673ef6516b8e9d7d145875691","schema_version":"1.0","event_id":"sha256:5efe1811a6b1abbdf6053c3b362526aaa14857b673ef6516b8e9d7d145875691"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TV6KRRGTCIHG2RU6YWK2YT7HLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heterogeneous Graph Attention Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bai Wang, Chuan Shi, Houye Ji, Peng Cui, P. Yu, Xiao Wang, Yanfang Ye","submitted_at":"2019-03-18T08:19:40Z","abstract_excerpt":"Graph neural network, as a powerful graph representation technique based on deep learning, has shown superior performance and attracted considerable research interest. However, it has not been fully considered in graph neural network for heterogeneous graph which contains different types of nodes and links. The heterogeneity and rich semantic information bring great challenges for designing a graph neural network for heterogeneous graph. Recently, one of the most exciting advancements in deep learning is the attention mechanism, whose great potential has been well demonstrated in various areas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07293","kind":"arxiv","version":2},"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/1903.07293/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:08:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qmteb6b/nccsALRgONJXK+Lu6eVwGQ+mf7MxvYRA12YYEkHbNtFNJqubWwKxAFQn+s86vTtUufcbK484ps0wBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:33:29.222642Z"},"content_sha256":"2a58094e7a3ae863fa335b3d333eb2bf0f8bf5e6f9669279ab60be390afcc665","schema_version":"1.0","event_id":"sha256:2a58094e7a3ae863fa335b3d333eb2bf0f8bf5e6f9669279ab60be390afcc665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TV6KRRGTCIHG2RU6YWK2YT7HLL/bundle.json","state_url":"https://pith.science/pith/TV6KRRGTCIHG2RU6YWK2YT7HLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TV6KRRGTCIHG2RU6YWK2YT7HLL/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-06T08:33:29Z","links":{"resolver":"https://pith.science/pith/TV6KRRGTCIHG2RU6YWK2YT7HLL","bundle":"https://pith.science/pith/TV6KRRGTCIHG2RU6YWK2YT7HLL/bundle.json","state":"https://pith.science/pith/TV6KRRGTCIHG2RU6YWK2YT7HLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TV6KRRGTCIHG2RU6YWK2YT7HLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TV6KRRGTCIHG2RU6YWK2YT7HLL","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":"625e602c8eeafcc62821d560f035806a236fabbe831a9f934a93a21adb2f0461","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-18T08:19:40Z","title_canon_sha256":"fa831d7436c794c73d20adc295ce59b5dce72da84bfc524d8d921b390cce4786"},"schema_version":"1.0","source":{"id":"1903.07293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07293","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07293v2","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07293","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"pith_short_12","alias_value":"TV6KRRGTCIHG","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"pith_short_16","alias_value":"TV6KRRGTCIHG2RU6","created_at":"2026-07-05T02:08:16Z"},{"alias_kind":"pith_short_8","alias_value":"TV6KRRGT","created_at":"2026-07-05T02:08:16Z"}],"graph_snapshots":[{"event_id":"sha256:2a58094e7a3ae863fa335b3d333eb2bf0f8bf5e6f9669279ab60be390afcc665","target":"graph","created_at":"2026-07-05T02:08:16Z","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/1903.07293/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural network, as a powerful graph representation technique based on deep learning, has shown superior performance and attracted considerable research interest. However, it has not been fully considered in graph neural network for heterogeneous graph which contains different types of nodes and links. The heterogeneity and rich semantic information bring great challenges for designing a graph neural network for heterogeneous graph. Recently, one of the most exciting advancements in deep learning is the attention mechanism, whose great potential has been well demonstrated in various areas","authors_text":"Bai Wang, Chuan Shi, Houye Ji, Peng Cui, P. Yu, Xiao Wang, Yanfang Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-18T08:19:40Z","title":"Heterogeneous Graph Attention Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07293","kind":"arxiv","version":2},"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:5efe1811a6b1abbdf6053c3b362526aaa14857b673ef6516b8e9d7d145875691","target":"record","created_at":"2026-07-05T02:08:16Z","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":"625e602c8eeafcc62821d560f035806a236fabbe831a9f934a93a21adb2f0461","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-18T08:19:40Z","title_canon_sha256":"fa831d7436c794c73d20adc295ce59b5dce72da84bfc524d8d921b390cce4786"},"schema_version":"1.0","source":{"id":"1903.07293","kind":"arxiv","version":2}},"canonical_sha256":"9d7ca8c4d3120e6d469ec595ac4fe75ac976a1ec44a20db1c3467376866437ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d7ca8c4d3120e6d469ec595ac4fe75ac976a1ec44a20db1c3467376866437ee","first_computed_at":"2026-07-05T02:08:16.022625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:08:16.022625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2DdnOBNX9AcZB2fksSHQnz3pOo5QmRmLLfDrJwF7exAbsdo6aOmgSCOqq2CI6DGbvVGJrimB9ckkNjc1qxniBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:08:16.023166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5efe1811a6b1abbdf6053c3b362526aaa14857b673ef6516b8e9d7d145875691","sha256:2a58094e7a3ae863fa335b3d333eb2bf0f8bf5e6f9669279ab60be390afcc665"],"state_sha256":"e9c4ce3b7de608bd8c0beea3b064e32be41606dc025257bbe89900f4d16b6354"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWoxLJYRJUFszGW99Ng+2+R71n7RGI4E7EPyTvfECYt9LuMvmH7y2BIR492ci8hHOWzPJHpvnXNLdH+L/STYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:33:29.228012Z","bundle_sha256":"d36bb02a4560d64acdcde34aaf9a0e0413aa02c8e6b618aabe77d188850c4b2f"}}