{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6T2ZW2WIHXJUBSYHW5EF76BFJN","short_pith_number":"pith:6T2ZW2WI","canonical_record":{"source":{"id":"1906.01840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-05T05:59:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"35bfd2319b1b8b135237ab5767aa93a6886b9623161523d7dc8fca543ef37f7a","abstract_canon_sha256":"1e3d5dcf20da2367aca12c7c6bc57a47323c20f52a379ac4590f0f4666298183"},"schema_version":"1.0"},"canonical_sha256":"f4f59b6ac83dd340cb07b7485ff8254b7e3709db0bea05f990083eae1cdd398f","source":{"kind":"arxiv","id":"1906.01840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01840","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01840v1","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01840","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"6T2ZW2WIHXJU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6T2ZW2WIHXJUBSYH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6T2ZW2WI","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6T2ZW2WIHXJUBSYHW5EF76BFJN","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-05T05:59:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"35bfd2319b1b8b135237ab5767aa93a6886b9623161523d7dc8fca543ef37f7a","abstract_canon_sha256":"1e3d5dcf20da2367aca12c7c6bc57a47323c20f52a379ac4590f0f4666298183"},"schema_version":"1.0"},"canonical_sha256":"f4f59b6ac83dd340cb07b7485ff8254b7e3709db0bea05f990083eae1cdd398f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:06.027718Z","signature_b64":"RciLIwVuQzGhRVaTZ5vb66rpyX3TYyM0LFi7D3X4NFflLNJtyMDUjCcszwLfHRRKFVmS0eeCMPjnZKWKOzbcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4f59b6ac83dd340cb07b7485ff8254b7e3709db0bea05f990083eae1cdd398f","last_reissued_at":"2026-05-17T23:44:06.027083Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:06.027083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01840","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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/XDglIOtmd/KD8XAt67rF/mYNfQfHiVvpcAkWq3mhthvMjMAMJbxdrtyUFaOKSZvQJssXjLf3x4wG3q6if/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:01:20.941455Z"},"content_sha256":"0dab25f13808f4925b8061df221a16cb9c48aeed39531bc9f60d2e15460d64c7","schema_version":"1.0","event_id":"sha256:0dab25f13808f4925b8061df221a16cb9c48aeed39531bc9f60d2e15460d64c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6T2ZW2WIHXJUBSYHW5EF76BFJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Textual Network Embedding with Global Attention via Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Chenyang Tao, Dinghan Shen, Guoyin Wang, Lawrence Carin, Liqun Chen, Pengyu Cheng, Wenlin Wang, Xinyuan Zhang, Yizhe Zhang","submitted_at":"2019-06-05T05:59:07Z","abstract_excerpt":"Constituting highly informative network embeddings is an important tool for network analysis. It encodes network topology, along with other useful side information, into low-dimensional node-based feature representations that can be exploited by statistical modeling. This work focuses on learning context-aware network embeddings augmented with text data. We reformulate the network-embedding problem, and present two novel strategies to improve over traditional attention mechanisms: ($i$) a content-aware sparse attention module based on optimal transport, and ($ii$) a high-level attention parsin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01840","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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6r+/6aHmEpXUPzyd5ou7LJyl9/C0CGvjckNf8e0Zv9TivR7LnoWIP4SddhlUe6b530j5KBweG0GFZSKoQjrJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:01:20.941801Z"},"content_sha256":"78f6bdb86219c22d2cdbcbbf3bd76f4a83e4f5dc77db4d265c6423f253a7bab0","schema_version":"1.0","event_id":"sha256:78f6bdb86219c22d2cdbcbbf3bd76f4a83e4f5dc77db4d265c6423f253a7bab0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6T2ZW2WIHXJUBSYHW5EF76BFJN/bundle.json","state_url":"https://pith.science/pith/6T2ZW2WIHXJUBSYHW5EF76BFJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6T2ZW2WIHXJUBSYHW5EF76BFJN/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-06-03T05:01:20Z","links":{"resolver":"https://pith.science/pith/6T2ZW2WIHXJUBSYHW5EF76BFJN","bundle":"https://pith.science/pith/6T2ZW2WIHXJUBSYHW5EF76BFJN/bundle.json","state":"https://pith.science/pith/6T2ZW2WIHXJUBSYHW5EF76BFJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6T2ZW2WIHXJUBSYHW5EF76BFJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6T2ZW2WIHXJUBSYHW5EF76BFJN","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":"1e3d5dcf20da2367aca12c7c6bc57a47323c20f52a379ac4590f0f4666298183","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-05T05:59:07Z","title_canon_sha256":"35bfd2319b1b8b135237ab5767aa93a6886b9623161523d7dc8fca543ef37f7a"},"schema_version":"1.0","source":{"id":"1906.01840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01840","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01840v1","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01840","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"6T2ZW2WIHXJU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6T2ZW2WIHXJUBSYH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6T2ZW2WI","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:78f6bdb86219c22d2cdbcbbf3bd76f4a83e4f5dc77db4d265c6423f253a7bab0","target":"graph","created_at":"2026-05-17T23:44:06Z","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":"Constituting highly informative network embeddings is an important tool for network analysis. It encodes network topology, along with other useful side information, into low-dimensional node-based feature representations that can be exploited by statistical modeling. This work focuses on learning context-aware network embeddings augmented with text data. We reformulate the network-embedding problem, and present two novel strategies to improve over traditional attention mechanisms: ($i$) a content-aware sparse attention module based on optimal transport, and ($ii$) a high-level attention parsin","authors_text":"Chenyang Tao, Dinghan Shen, Guoyin Wang, Lawrence Carin, Liqun Chen, Pengyu Cheng, Wenlin Wang, Xinyuan Zhang, Yizhe Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-05T05:59:07Z","title":"Improving Textual Network Embedding with Global Attention via Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01840","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:0dab25f13808f4925b8061df221a16cb9c48aeed39531bc9f60d2e15460d64c7","target":"record","created_at":"2026-05-17T23:44:06Z","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":"1e3d5dcf20da2367aca12c7c6bc57a47323c20f52a379ac4590f0f4666298183","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-05T05:59:07Z","title_canon_sha256":"35bfd2319b1b8b135237ab5767aa93a6886b9623161523d7dc8fca543ef37f7a"},"schema_version":"1.0","source":{"id":"1906.01840","kind":"arxiv","version":1}},"canonical_sha256":"f4f59b6ac83dd340cb07b7485ff8254b7e3709db0bea05f990083eae1cdd398f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4f59b6ac83dd340cb07b7485ff8254b7e3709db0bea05f990083eae1cdd398f","first_computed_at":"2026-05-17T23:44:06.027083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:06.027083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RciLIwVuQzGhRVaTZ5vb66rpyX3TYyM0LFi7D3X4NFflLNJtyMDUjCcszwLfHRRKFVmS0eeCMPjnZKWKOzbcBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:06.027718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dab25f13808f4925b8061df221a16cb9c48aeed39531bc9f60d2e15460d64c7","sha256:78f6bdb86219c22d2cdbcbbf3bd76f4a83e4f5dc77db4d265c6423f253a7bab0"],"state_sha256":"728d279526b93c4ee7de790b6ca32828c955ce70153875a5569cdfb5401227a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2urtI95jTOLuCnDycPgMB6+HZgM4R6xOFmjLkAh3U9FHgBN4B/MM2z+79Cbq6hAnoEjnwWkTq6n5rT+e9opCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:01:20.943682Z","bundle_sha256":"0bb37cd45e02fc7744eb77a8f37f71ffab90e24fded78f0e57ce6f4570f13d83"}}