{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":24,"of":24,"of_with_code":10,"tagged_in_all":24,"counts":{"archive_papers_tagged":24,"with_a_code_link":10,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":24,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/toward-structure-fairness-in-dynamic-graph","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dtgb-a-comprehensive-benchmark-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2406.12072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12072"}},"official":{"repos":["zjs123/DTGB"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/valid-conformal-prediction-for-dynamic-gnns","slug":"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_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/valid-conformal-prediction-for-dynamic-gnns#ran","syntology_url":"https://syntology.ai/paper/2405.19230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19230"}},"official":{"repos":["edwarddavis1/valid_conformal_for_dynamic_gnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/transformerg2g-adaptive-time-stepping-for","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/parameter-free-dynamic-graph-embedding-for#ran","syntology_url":"https://syntology.ai/paper/2210.08189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08189"}},"official":{"repos":["fudancisl/freegem"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dyng2g-an-efficient-stochastic-graph","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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},{"url":null,"slug":"a-comparative-study-on-dynamic-graph","title":"A Comparative Study on Dynamic Graph Embedding based on Mamba and Transformers","date":"2024-12-15","arxiv_id":"2412.11293","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-progressive-influence-maximization-in","title":"Non-Progressive Influence Maximization in Dynamic Social Networks","date":"2024-12-10","arxiv_id":"2412.07402","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-intrinsic-dimensionality-for-dynamic","title":"Local Intrinsic Dimensionality for Dynamic Graph Embeddings","date":"2024-11-25","arxiv_id":"2411.16145","repositories_listed":0,"syntology":null},{"url":null,"slug":"empowering-interdisciplinary-insights-with","title":"Empowering Interdisciplinary Insights with Dynamic Graph Embedding Trajectories","date":"2024-06-25","arxiv_id":"2406.17963","repositories_listed":0,"syntology":null},{"url":null,"slug":"dysuse-susceptibility-estimation-in-dynamic","title":"DySuse: Susceptibility Estimation in Dynamic Social Networks","date":"2023-08-21","arxiv_id":"2308.10442","repositories_listed":0,"syntology":null},{"url":null,"slug":"atem-a-topic-evolution-model-for-the","title":"ATEM: A Topic Evolution Model for the Detection of Emerging Topics in Scientific Archives","date":"2023-06-04","arxiv_id":"2306.02221","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-aware-dynamic-graph-embedding-for","title":"Time-aware Dynamic Graph Embedding for Asynchronous Structural Evolution","date":"2022-07-01","arxiv_id":"2207.00594","repositories_listed":0,"syntology":null},{"url":null,"slug":"walkingtime-dynamic-graph-embedding-using","title":"WalkingTime: Dynamic Graph Embedding Using Temporal-Topological Flows","date":"2021-11-22","arxiv_id":"2111.10928","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-smart-ponzi-scheme-detection","title":"Data-driven Smart Ponzi Scheme Detection","date":"2021-08-20","arxiv_id":"2108.09305","repositories_listed":0,"syntology":null},{"url":null,"slug":"dygcn-dynamic-graph-embedding-with-graph","title":"DyGCN: Dynamic Graph Embedding with Graph Convolutional Network","date":"2021-04-07","arxiv_id":"2104.02962","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-embedding-dynamic-graphs","title":"A Survey on Embedding Dynamic Graphs","date":"2021-01-04","arxiv_id":"2101.01229","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-graph-embedding-methods-and","title":"Understanding graph embedding methods and their applications","date":"2020-12-15","arxiv_id":"2012.08019","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-embedding-via-lstm-history","title":"Dynamic Graph Embedding via LSTM History Tracking","date":"2019-11-05","arxiv_id":"1911.01551","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-event-representations-in-image","title":"Learning event representations for temporal segmentation of image sequences by dynamic graph embedding","date":"2019-10-08","arxiv_id":"1910.03483","repositories_listed":0,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/task/dynamic-graph-embedding/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/dynamic-graph-embedding/papers/ran/1","json":"/task/dynamic-graph-embedding/papers/ran/1.json","rows":2}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"12e6821e0cd3ab86b7c262a72b6bde5e7d5eb1da01b2a0ebd68561e92b9b3efd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}