{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3UPLFL5TACX23H6SOMTIFV6457","short_pith_number":"pith:3UPLFL5T","canonical_record":{"source":{"id":"2009.08072","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-09-17T05:13:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4e2a8c3e33a4d9d4ea8f380bbf195d2ea61ba3a280e06352cc91eedcdc35c562","abstract_canon_sha256":"09a04cc2cc98917ca1c7fa847fc1aa959662cb951aca02c7c3c947f39e1520a3"},"schema_version":"1.0"},"canonical_sha256":"dd1eb2afb300afad9fd2732682d7dcefcc4486e33f96c6f7a10eafc9b020a099","source":{"kind":"arxiv","id":"2009.08072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.08072","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"arxiv_version","alias_value":"2009.08072v1","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.08072","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"pith_short_12","alias_value":"3UPLFL5TACX2","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"pith_short_16","alias_value":"3UPLFL5TACX23H6S","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"pith_short_8","alias_value":"3UPLFL5T","created_at":"2026-07-05T01:36:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3UPLFL5TACX23H6SOMTIFV6457","target":"record","payload":{"canonical_record":{"source":{"id":"2009.08072","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-09-17T05:13:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4e2a8c3e33a4d9d4ea8f380bbf195d2ea61ba3a280e06352cc91eedcdc35c562","abstract_canon_sha256":"09a04cc2cc98917ca1c7fa847fc1aa959662cb951aca02c7c3c947f39e1520a3"},"schema_version":"1.0"},"canonical_sha256":"dd1eb2afb300afad9fd2732682d7dcefcc4486e33f96c6f7a10eafc9b020a099","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:01.099642Z","signature_b64":"ocMaaOJh25DzZQASVanVc7gu4BslpcYqlZ7swF5COp87IcutJERJoJDgJC46kincdFz9wgFCbGP5TbugxaAZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd1eb2afb300afad9fd2732682d7dcefcc4486e33f96c6f7a10eafc9b020a099","last_reissued_at":"2026-07-05T01:36:01.099296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:01.099296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.08072","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:36:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iyBkQMo5COF6E94CNIzxnQsBywGR7N4EwNUBcyX8AXTe0FXylXaXNwRZAFTNgAz24/wdRobNsU3J2wE2YHObCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:22:05.389572Z"},"content_sha256":"a4e4f697a54da54c37570f52ec65a2af4d2c058d0a9f072ed0e508fb6e466349","schema_version":"1.0","event_id":"sha256:a4e4f697a54da54c37570f52ec65a2af4d2c058d0a9f072ed0e508fb6e466349"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3UPLFL5TACX23H6SOMTIFV6457","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Layer-stacked Attention for Heterogeneous Network Embedding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jean Gao, Nhat Tran","submitted_at":"2020-09-17T05:13:41Z","abstract_excerpt":"The heterogeneous network is a robust data abstraction that can model entities of different types interacting in various ways. Such heterogeneity brings rich semantic information but presents nontrivial challenges in aggregating the heterogeneous relationships between objects - especially those of higher-order indirect relations. Recent graph neural network approaches for representation learning on heterogeneous networks typically employ the attention mechanism, which is often only optimized for predictions based on direct links. Furthermore, even though most deep learning methods can aggregat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.08072","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/2009.08072/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:36:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwpDLXiJ+szJrbeQZvNC4dSoeo5RFRUIo2ekRqVTdULAo1LrQY7yDOvu7qsrode/NSNscBetHBsScGkvKXLZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:22:05.390206Z"},"content_sha256":"a41355e136a92e3bce35c40458b222a31ddf8003d75ea746ce34ba2640e64d3c","schema_version":"1.0","event_id":"sha256:a41355e136a92e3bce35c40458b222a31ddf8003d75ea746ce34ba2640e64d3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UPLFL5TACX23H6SOMTIFV6457/bundle.json","state_url":"https://pith.science/pith/3UPLFL5TACX23H6SOMTIFV6457/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UPLFL5TACX23H6SOMTIFV6457/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-22T10:22:05Z","links":{"resolver":"https://pith.science/pith/3UPLFL5TACX23H6SOMTIFV6457","bundle":"https://pith.science/pith/3UPLFL5TACX23H6SOMTIFV6457/bundle.json","state":"https://pith.science/pith/3UPLFL5TACX23H6SOMTIFV6457/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UPLFL5TACX23H6SOMTIFV6457/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3UPLFL5TACX23H6SOMTIFV6457","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":"09a04cc2cc98917ca1c7fa847fc1aa959662cb951aca02c7c3c947f39e1520a3","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-09-17T05:13:41Z","title_canon_sha256":"4e2a8c3e33a4d9d4ea8f380bbf195d2ea61ba3a280e06352cc91eedcdc35c562"},"schema_version":"1.0","source":{"id":"2009.08072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.08072","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"arxiv_version","alias_value":"2009.08072v1","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.08072","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"pith_short_12","alias_value":"3UPLFL5TACX2","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"pith_short_16","alias_value":"3UPLFL5TACX23H6S","created_at":"2026-07-05T01:36:01Z"},{"alias_kind":"pith_short_8","alias_value":"3UPLFL5T","created_at":"2026-07-05T01:36:01Z"}],"graph_snapshots":[{"event_id":"sha256:a41355e136a92e3bce35c40458b222a31ddf8003d75ea746ce34ba2640e64d3c","target":"graph","created_at":"2026-07-05T01:36:01Z","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/2009.08072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The heterogeneous network is a robust data abstraction that can model entities of different types interacting in various ways. Such heterogeneity brings rich semantic information but presents nontrivial challenges in aggregating the heterogeneous relationships between objects - especially those of higher-order indirect relations. Recent graph neural network approaches for representation learning on heterogeneous networks typically employ the attention mechanism, which is often only optimized for predictions based on direct links. Furthermore, even though most deep learning methods can aggregat","authors_text":"Jean Gao, Nhat Tran","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-09-17T05:13:41Z","title":"Layer-stacked Attention for Heterogeneous Network Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.08072","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:a4e4f697a54da54c37570f52ec65a2af4d2c058d0a9f072ed0e508fb6e466349","target":"record","created_at":"2026-07-05T01:36:01Z","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":"09a04cc2cc98917ca1c7fa847fc1aa959662cb951aca02c7c3c947f39e1520a3","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-09-17T05:13:41Z","title_canon_sha256":"4e2a8c3e33a4d9d4ea8f380bbf195d2ea61ba3a280e06352cc91eedcdc35c562"},"schema_version":"1.0","source":{"id":"2009.08072","kind":"arxiv","version":1}},"canonical_sha256":"dd1eb2afb300afad9fd2732682d7dcefcc4486e33f96c6f7a10eafc9b020a099","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd1eb2afb300afad9fd2732682d7dcefcc4486e33f96c6f7a10eafc9b020a099","first_computed_at":"2026-07-05T01:36:01.099296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:36:01.099296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ocMaaOJh25DzZQASVanVc7gu4BslpcYqlZ7swF5COp87IcutJERJoJDgJC46kincdFz9wgFCbGP5TbugxaAZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:36:01.099642Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.08072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4e4f697a54da54c37570f52ec65a2af4d2c058d0a9f072ed0e508fb6e466349","sha256:a41355e136a92e3bce35c40458b222a31ddf8003d75ea746ce34ba2640e64d3c"],"state_sha256":"076ccae87ce8f3feaf7863ec00fc268e95a5ec62908bc618a412961495a3fcda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMCW0cKfo6X4DzBsRms8YIsnpeeFW0KGKcRr+nLkO5ooKw3gCEBQh1xR9zl39Z9wzbT4NjtnG/ElN2yVCxauBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T10:22:05.395524Z","bundle_sha256":"5709439c4973e7e3d53d23ed43ff9ce093ac786796d16698e4d2108187bdd24a"}}