{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FMIJAO5XISHADX7J2H2B47ZQOE","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":"21b3f27208756965ef6ab65908a3c22e0ad6699a684ec22da61a945a91ebabc9","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T05:30:02Z","title_canon_sha256":"3da550f7d6ce4fb6fae6093b64a0a2008621f274c9a00934e8f47ecf4e836204"},"schema_version":"1.0","source":{"id":"1812.02356","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02356","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02356v2","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02356","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"FMIJAO5XISHA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FMIJAO5XISHADX7J","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FMIJAO5X","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:a63add3f710fe8bbc541cc113a1468cb73a03c1b09937bd9baef8fbc61d2a695","target":"graph","created_at":"2026-05-17T23:54:38Z","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 representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evolving patterns in a large dynamic network. In this paper, we propose a dynamic embedding method, dynnode2vec, based on the well-known graph embedding method node2vec. Node2vec is a random walk based embedding method for static networks. Applying static network embedding in dynamic","authors_text":"Aijun An, Sedigheh Mahdavi, Shima Khoshraftar","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T05:30:02Z","title":"dynnode2vec: Scalable Dynamic Network Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02356","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:8c48e738cc291c48eddd43d7f22bd2ddf82adf344b24c0b75d530d1f1934edd0","target":"record","created_at":"2026-05-17T23:54:38Z","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":"21b3f27208756965ef6ab65908a3c22e0ad6699a684ec22da61a945a91ebabc9","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T05:30:02Z","title_canon_sha256":"3da550f7d6ce4fb6fae6093b64a0a2008621f274c9a00934e8f47ecf4e836204"},"schema_version":"1.0","source":{"id":"1812.02356","kind":"arxiv","version":2}},"canonical_sha256":"2b10903bb7448e01dfe9d1f41e7f307118e77466f6bab52a0173c6121d14e6fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b10903bb7448e01dfe9d1f41e7f307118e77466f6bab52a0173c6121d14e6fa","first_computed_at":"2026-05-17T23:54:38.968920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:38.968920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gq2JzcU6jzez2qI0OFNSeQwHXPwBITXlSQ8lqUHuM2i+7p2YqZoi8JfcsqXDBadPB3M5PFYCCcgdoWvLpBgsAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:38.969675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02356","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c48e738cc291c48eddd43d7f22bd2ddf82adf344b24c0b75d530d1f1934edd0","sha256:a63add3f710fe8bbc541cc113a1468cb73a03c1b09937bd9baef8fbc61d2a695"],"state_sha256":"0b44fc38b4aa7d3b2f8587299de82527b2df467cce6fbdae8bd03d88713d4202"}