{"url":"/task/dynamic-graph-embedding","name":"Dynamic graph embedding","slug":"dynamic-graph-embedding","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":24,"papers_with_code":10,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":1,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[{"url":"/task/knowledge-base-completion","name":"Knowledge Base Completion"}],"parent_tasks":[{"url":"/task/graph-embedding","name":"Graph Embedding"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":10,"of":10,"tagged_in_all":24,"items":[{"url":"/paper/toward-structure-fairness-in-dynamic-graph","title":"Toward Structure Fairness in Dynamic Graph Embedding: A Trend-aware Dual Debiasing Approach","date":"2024-06-19","arxiv_id":"2406.13201","repositories_listed":1,"syntology":null},{"url":"/paper/dtgb-a-comprehensive-benchmark-for-dynamic","title":"DTGB: A Comprehensive Benchmark for Dynamic Text-Attributed Graphs","date":"2024-06-17","arxiv_id":"2406.12072","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/valid-conformal-prediction-for-dynamic-gnns","title":"Valid Conformal Prediction for Dynamic GNNs","date":"2024-05-29","arxiv_id":"2405.19230","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_unverified":6,"n_pointer_only":12}},{"url":"/paper/transformerg2g-adaptive-time-stepping-for","title":"TransformerG2G: Adaptive time-stepping for learning temporal graph embeddings using transformers","date":"2023-07-05","arxiv_id":"2307.02588","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-free-dynamic-graph-embedding-for","title":"Parameter-free Dynamic Graph Embedding for Link Prediction","date":"2022-10-15","arxiv_id":"2210.08189","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":5}},{"url":"/paper/dyng2g-an-efficient-stochastic-graph","title":"DynG2G: An Efficient Stochastic Graph Embedding Method for Temporal Graphs","date":"2021-09-28","arxiv_id":"2109.13441","repositories_listed":1,"syntology":null},{"url":"/paper/featurenorm-l2-feature-normalization-for","title":"FeatureNorm: L2 Feature Normalization for Dynamic Graph Embedding","date":"2021-02-27","arxiv_id":"2103.00164","repositories_listed":1,"syntology":null},{"url":"/paper/k-core-based-temporal-graph-convolutional","title":"K-Core based Temporal Graph Convolutional Network for Dynamic Graphs","date":"2020-03-22","arxiv_id":"2003.09902","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-embedding-for-temporal-networks","title":"FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings","date":"2019-04-06","arxiv_id":"1904.03423","repositories_listed":1,"syntology":null},{"url":"/paper/dynamicgem-a-library-for-dynamic-graph","title":"DynamicGEM: A Library for Dynamic Graph Embedding Methods","date":"2018-11-26","arxiv_id":"1811.10734","repositories_listed":1,"syntology":null}],"syntology_records":3,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}