{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZZ3OUCSTVQRUHNAH4UFLEP6IHR","short_pith_number":"pith:ZZ3OUCST","schema_version":"1.0","canonical_sha256":"ce76ea0a53ac2343b407e50ab23fc83c52a7598a1c7c860d56536b5db85ef7bb","source":{"kind":"arxiv","id":"1810.09176","version":4},"attestation_state":"computed","paper":{"title":"Node Representation Learning for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Avishek Anand, Jurek Leonhardt, Megha Khosla, Wolfgang Nejdl","submitted_at":"2018-10-22T11:04:00Z","abstract_excerpt":"We propose a novel approach for learning node representations in directed graphs, which maintains separate views or embedding spaces for the two distinct node roles induced by the directionality of the edges. We argue that the previous approaches either fail to encode the edge directionality or their encodings cannot be generalized across tasks. With our simple \\emph{alternating random walk} strategy, we generate role specific vertex neighborhoods and train node embeddings in their corresponding source/target roles while fully exploiting the semantics of directed graphs. We also unearth the li"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.09176","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-10-22T11:04:00Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a344ba3145f8f374f07cab62fbc1d70f8e507c186e146744237df58e4ba4e4e9","abstract_canon_sha256":"0cb9921309b1661bdc87a201c9372a18dc6da3496c03896815c166229f50306d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:02.931799Z","signature_b64":"m6HMmBOffzyEW+79nrGZKV3erOyRH0evh9wfZywky5sEsPMoU96iGKwn2PuFqzojrhNfQtlkj9iGqbOHHJJzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce76ea0a53ac2343b407e50ab23fc83c52a7598a1c7c860d56536b5db85ef7bb","last_reissued_at":"2026-05-17T23:42:02.931278Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:02.931278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Node Representation Learning for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Avishek Anand, Jurek Leonhardt, Megha Khosla, Wolfgang Nejdl","submitted_at":"2018-10-22T11:04:00Z","abstract_excerpt":"We propose a novel approach for learning node representations in directed graphs, which maintains separate views or embedding spaces for the two distinct node roles induced by the directionality of the edges. We argue that the previous approaches either fail to encode the edge directionality or their encodings cannot be generalized across tasks. With our simple \\emph{alternating random walk} strategy, we generate role specific vertex neighborhoods and train node embeddings in their corresponding source/target roles while fully exploiting the semantics of directed graphs. We also unearth the li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09176","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.09176","created_at":"2026-05-17T23:42:02.931362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09176v4","created_at":"2026-05-17T23:42:02.931362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09176","created_at":"2026-05-17T23:42:02.931362+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZ3OUCSTVQRU","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZ3OUCSTVQRUHNAH","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZ3OUCST","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR","json":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR.json","graph_json":"https://pith.science/api/pith-number/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/graph.json","events_json":"https://pith.science/api/pith-number/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/events.json","paper":"https://pith.science/paper/ZZ3OUCST"},"agent_actions":{"view_html":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR","download_json":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR.json","view_paper":"https://pith.science/paper/ZZ3OUCST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09176&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/action/storage_attestation","attest_author":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/action/author_attestation","sign_citation":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/action/citation_signature","submit_replication":"https://pith.science/pith/ZZ3OUCSTVQRUHNAH4UFLEP6IHR/action/replication_record"}},"created_at":"2026-05-17T23:42:02.931362+00:00","updated_at":"2026-05-17T23:42:02.931362+00:00"}