{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MBDQM5QOVSIAO7WCGFENDDTD3I","short_pith_number":"pith:MBDQM5QO","canonical_record":{"source":{"id":"1808.09633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T04:23:02Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"b3da5e21ed2e883744d764b816db46bec3be7c16548cf84d1d90c120a57734b3","abstract_canon_sha256":"23a2d07397f5be41a693b291e8d4b2ddb8b438fa7cf2855ca79b27474ab77a02"},"schema_version":"1.0"},"canonical_sha256":"604706760eac90077ec23148d18e63da386df9b1482e4a3861754e697fb65270","source":{"kind":"arxiv","id":"1808.09633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09633","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09633v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09633","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"MBDQM5QOVSIA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MBDQM5QOVSIAO7WC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MBDQM5QO","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MBDQM5QOVSIAO7WCGFENDDTD3I","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T04:23:02Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"b3da5e21ed2e883744d764b816db46bec3be7c16548cf84d1d90c120a57734b3","abstract_canon_sha256":"23a2d07397f5be41a693b291e8d4b2ddb8b438fa7cf2855ca79b27474ab77a02"},"schema_version":"1.0"},"canonical_sha256":"604706760eac90077ec23148d18e63da386df9b1482e4a3861754e697fb65270","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:54.952424Z","signature_b64":"FK1cQl+xxyT1EfOT3lZjZFwV6u+3u1bWpxo2uErINXD/q+h094jvF7WIpmOI7rURQDohwVJymUvjd996RbG/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"604706760eac90077ec23148d18e63da386df9b1482e4a3861754e697fb65270","last_reissued_at":"2026-05-18T00:06:54.951989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:54.951989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09633","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-18T00:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCeo5Jmd2yDyXRtubMoDQghPE9FksgW0VexPTAEmYWfQI0gj3iVrh8medfnJI7/y3DiBqyanSpDBPdXqxBXoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:34:10.438964Z"},"content_sha256":"48a5ff6550a882db6f5de8d4ae61e19648e7e72619517375a6faaf747d578856","schema_version":"1.0","event_id":"sha256:48a5ff6550a882db6f5de8d4ae61e19648e7e72619517375a6faaf747d578856"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MBDQM5QOVSIAO7WCGFENDDTD3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Semantic-Aware Network Embedding with Fine-Grained Word Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SI"],"primary_cat":"cs.CL","authors_text":"Dinghan Shen, Lawrence Carin, Ricardo Henao, Xinyuan Zhang","submitted_at":"2018-08-29T04:23:02Z","abstract_excerpt":"Network embeddings, which learn low-dimensional representations for each vertex in a large-scale network, have received considerable attention in recent years. For a wide range of applications, vertices in a network are typically accompanied by rich textual information such as user profiles, paper abstracts, etc. We propose to incorporate semantic features into network embeddings by matching important words between text sequences for all pairs of vertices. We introduce a word-by-word alignment framework that measures the compatibility of embeddings between word pairs, and then adaptively accum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09633","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-18T00:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1n7ATT9s7wVXxunvCF0snXW+OUcFkUP4CFbmVhEfaVAAsygExvLleIJ6WkMmvkpkeXIAj8w53eEK47gE0YgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:34:10.439322Z"},"content_sha256":"d7e6c534b4c174cd8e5ac88f001de5530b36724bea200bdc5eccf58b192e749a","schema_version":"1.0","event_id":"sha256:d7e6c534b4c174cd8e5ac88f001de5530b36724bea200bdc5eccf58b192e749a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBDQM5QOVSIAO7WCGFENDDTD3I/bundle.json","state_url":"https://pith.science/pith/MBDQM5QOVSIAO7WCGFENDDTD3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBDQM5QOVSIAO7WCGFENDDTD3I/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-05-19T11:34:10Z","links":{"resolver":"https://pith.science/pith/MBDQM5QOVSIAO7WCGFENDDTD3I","bundle":"https://pith.science/pith/MBDQM5QOVSIAO7WCGFENDDTD3I/bundle.json","state":"https://pith.science/pith/MBDQM5QOVSIAO7WCGFENDDTD3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBDQM5QOVSIAO7WCGFENDDTD3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MBDQM5QOVSIAO7WCGFENDDTD3I","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":"23a2d07397f5be41a693b291e8d4b2ddb8b438fa7cf2855ca79b27474ab77a02","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T04:23:02Z","title_canon_sha256":"b3da5e21ed2e883744d764b816db46bec3be7c16548cf84d1d90c120a57734b3"},"schema_version":"1.0","source":{"id":"1808.09633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09633","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09633v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09633","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"MBDQM5QOVSIA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MBDQM5QOVSIAO7WC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MBDQM5QO","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:d7e6c534b4c174cd8e5ac88f001de5530b36724bea200bdc5eccf58b192e749a","target":"graph","created_at":"2026-05-18T00:06:54Z","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":"Network embeddings, which learn low-dimensional representations for each vertex in a large-scale network, have received considerable attention in recent years. For a wide range of applications, vertices in a network are typically accompanied by rich textual information such as user profiles, paper abstracts, etc. We propose to incorporate semantic features into network embeddings by matching important words between text sequences for all pairs of vertices. We introduce a word-by-word alignment framework that measures the compatibility of embeddings between word pairs, and then adaptively accum","authors_text":"Dinghan Shen, Lawrence Carin, Ricardo Henao, Xinyuan Zhang","cross_cats":["cs.AI","cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T04:23:02Z","title":"Improved Semantic-Aware Network Embedding with Fine-Grained Word Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09633","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:48a5ff6550a882db6f5de8d4ae61e19648e7e72619517375a6faaf747d578856","target":"record","created_at":"2026-05-18T00:06:54Z","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":"23a2d07397f5be41a693b291e8d4b2ddb8b438fa7cf2855ca79b27474ab77a02","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-29T04:23:02Z","title_canon_sha256":"b3da5e21ed2e883744d764b816db46bec3be7c16548cf84d1d90c120a57734b3"},"schema_version":"1.0","source":{"id":"1808.09633","kind":"arxiv","version":1}},"canonical_sha256":"604706760eac90077ec23148d18e63da386df9b1482e4a3861754e697fb65270","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"604706760eac90077ec23148d18e63da386df9b1482e4a3861754e697fb65270","first_computed_at":"2026-05-18T00:06:54.951989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:54.951989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FK1cQl+xxyT1EfOT3lZjZFwV6u+3u1bWpxo2uErINXD/q+h094jvF7WIpmOI7rURQDohwVJymUvjd996RbG/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:54.952424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a5ff6550a882db6f5de8d4ae61e19648e7e72619517375a6faaf747d578856","sha256:d7e6c534b4c174cd8e5ac88f001de5530b36724bea200bdc5eccf58b192e749a"],"state_sha256":"ae4239a22131b72f5ade19e35c362bfd5ef507ab9ee9e4d0ced036539c63fa90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8V9PxF3jJd++J4BK4Dp3oxqLG5Y4pjzPV7EJvfw9rIVDMWk4bhamvGSdeJTuUqVnbyFPwEWK1zSiwOTWhrQFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:34:10.440916Z","bundle_sha256":"d2e8d52cda725b7ed3ef15ab36a121f58365266e88cd577c24ae0b9eaeb7cf72"}}