{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FMIJAO5XISHADX7J2H2B47ZQOE","short_pith_number":"pith:FMIJAO5X","schema_version":"1.0","canonical_sha256":"2b10903bb7448e01dfe9d1f41e7f307118e77466f6bab52a0173c6121d14e6fa","source":{"kind":"arxiv","id":"1812.02356","version":2},"attestation_state":"computed","paper":{"title":"dynnode2vec: Scalable Dynamic Network Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aijun An, Sedigheh Mahdavi, Shima Khoshraftar","submitted_at":"2018-12-06T05:30:02Z","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"},"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":"1812.02356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T05:30:02Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"3da550f7d6ce4fb6fae6093b64a0a2008621f274c9a00934e8f47ecf4e836204","abstract_canon_sha256":"21b3f27208756965ef6ab65908a3c22e0ad6699a684ec22da61a945a91ebabc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.969675Z","signature_b64":"gq2JzcU6jzez2qI0OFNSeQwHXPwBITXlSQ8lqUHuM2i+7p2YqZoi8JfcsqXDBadPB3M5PFYCCcgdoWvLpBgsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b10903bb7448e01dfe9d1f41e7f307118e77466f6bab52a0173c6121d14e6fa","last_reissued_at":"2026-05-17T23:54:38.968920Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.968920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"dynnode2vec: Scalable Dynamic Network Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aijun An, Sedigheh Mahdavi, Shima Khoshraftar","submitted_at":"2018-12-06T05:30:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02356","kind":"arxiv","version":2},"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":"1812.02356","created_at":"2026-05-17T23:54:38.969046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02356v2","created_at":"2026-05-17T23:54:38.969046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02356","created_at":"2026-05-17T23:54:38.969046+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMIJAO5XISHA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMIJAO5XISHADX7J","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMIJAO5X","created_at":"2026-05-18T12:32:22.470017+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/FMIJAO5XISHADX7J2H2B47ZQOE","json":"https://pith.science/pith/FMIJAO5XISHADX7J2H2B47ZQOE.json","graph_json":"https://pith.science/api/pith-number/FMIJAO5XISHADX7J2H2B47ZQOE/graph.json","events_json":"https://pith.science/api/pith-number/FMIJAO5XISHADX7J2H2B47ZQOE/events.json","paper":"https://pith.science/paper/FMIJAO5X"},"agent_actions":{"view_html":"https://pith.science/pith/FMIJAO5XISHADX7J2H2B47ZQOE","download_json":"https://pith.science/pith/FMIJAO5XISHADX7J2H2B47ZQOE.json","view_paper":"https://pith.science/paper/FMIJAO5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02356&json=true","fetch_graph":"https://pith.science/api/pith-number/FMIJAO5XISHADX7J2H2B47ZQOE/graph.json","fetch_events":"https://pith.science/api/pith-number/FMIJAO5XISHADX7J2H2B47ZQOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMIJAO5XISHADX7J2H2B47ZQOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMIJAO5XISHADX7J2H2B47ZQOE/action/storage_attestation","attest_author":"https://pith.science/pith/FMIJAO5XISHADX7J2H2B47ZQOE/action/author_attestation","sign_citation":"https://pith.science/pith/FMIJAO5XISHADX7J2H2B47ZQOE/action/citation_signature","submit_replication":"https://pith.science/pith/FMIJAO5XISHADX7J2H2B47ZQOE/action/replication_record"}},"created_at":"2026-05-17T23:54:38.969046+00:00","updated_at":"2026-05-17T23:54:38.969046+00:00"}