{"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-link-prediction","name":"Dynamic Link Prediction","slug":"dynamic-link-prediction","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":41,"papers_with_code":20,"benchmarks":10,"benchmark_tables_in_archive":10,"benchmark_tables_shown":10,"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":8,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/dynamic-link-prediction-on-dblp-temporal","slug":"dynamic-link-prediction-on-dblp-temporal","dataset":"DBLP Temporal","dataset_url":"/dataset/dblp-temporal","rows_in_archive":7,"metrics":["AUC","AP","MRR"],"first_row_in_archive_order":{"model":"teneNCE","paper_title":"Contrastive Representation Learning for Dynamic Link Prediction in Temporal Networks","paper_url":"/paper/contrastive-representation-learning-for-3","paper_date":"2024-08-22","arxiv_id":"2408.12753","code_links":[{"title":"amrhssn/teneNCE","url":"https://github.com/amrhssn/teneNCE"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-enron-email","slug":"dynamic-link-prediction-on-enron-email","dataset":"Enron Emails","dataset_url":"/dataset/enron-email-dataset","rows_in_archive":7,"metrics":["AP","AUC","MRR"],"first_row_in_archive_order":{"model":"Euler","paper_title":"Euler: Detecting Network Lateral Movement via Scalable Temporal Link Prediction","paper_url":"/paper/euler-detecting-network-lateral-movement-via","paper_date":"2022-04-24","arxiv_id":null,"code_links":[{"title":"iHeartGraph/Euler","url":"https://github.com/iHeartGraph/Euler"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-enron","slug":"dynamic-link-prediction-on-enron","dataset":"Enron","dataset_url":null,"rows_in_archive":1,"metrics":["AP"],"first_row_in_archive_order":{"model":"DyG2Vec","paper_title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","paper_url":"/paper/dyg2vec-representation-learning-for-dynamic","paper_date":"2022-10-30","arxiv_id":"2210.16906","code_links":[{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-lastfm","slug":"dynamic-link-prediction-on-lastfm","dataset":"LastFM","dataset_url":null,"rows_in_archive":1,"metrics":["AP"],"first_row_in_archive_order":{"model":"DyG2Vec","paper_title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","paper_url":"/paper/dyg2vec-representation-learning-for-dynamic","paper_date":"2022-10-30","arxiv_id":"2210.16906","code_links":[{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-mooc","slug":"dynamic-link-prediction-on-mooc","dataset":"MOOC","dataset_url":null,"rows_in_archive":1,"metrics":["AP"],"first_row_in_archive_order":{"model":"DyG2Vec","paper_title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","paper_url":"/paper/dyg2vec-representation-learning-for-dynamic","paper_date":"2022-10-30","arxiv_id":"2210.16906","code_links":[{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-reddit","slug":"dynamic-link-prediction-on-reddit","dataset":"Reddit","dataset_url":"/dataset/reddit","rows_in_archive":1,"metrics":["AP"],"first_row_in_archive_order":{"model":"DyG2Vec","paper_title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","paper_url":"/paper/dyg2vec-representation-learning-for-dynamic","paper_date":"2022-10-30","arxiv_id":"2210.16906","code_links":[{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-social-evolution","slug":"dynamic-link-prediction-on-social-evolution","dataset":"Social Evolution","dataset_url":null,"rows_in_archive":1,"metrics":["AP"],"first_row_in_archive_order":{"model":"DyG2Vec","paper_title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","paper_url":"/paper/dyg2vec-representation-learning-for-dynamic","paper_date":"2022-10-30","arxiv_id":"2210.16906","code_links":[{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-uci","slug":"dynamic-link-prediction-on-uci","dataset":"UCI","dataset_url":null,"rows_in_archive":1,"metrics":["AP"],"first_row_in_archive_order":{"model":"DyG2Vec","paper_title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","paper_url":"/paper/dyg2vec-representation-learning-for-dynamic","paper_date":"2022-10-30","arxiv_id":"2210.16906","code_links":[{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-wikipedia","slug":"dynamic-link-prediction-on-wikipedia","dataset":"Wikipedia","dataset_url":null,"rows_in_archive":1,"metrics":["AP"],"first_row_in_archive_order":{"model":"DyG2Vec","paper_title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","paper_url":"/paper/dyg2vec-representation-learning-for-dynamic","paper_date":"2022-10-30","arxiv_id":"2210.16906","code_links":[{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research"}],"syntology":null}},{"leaderboard":"/sota/dynamic-link-prediction-on-wn18-filtered","slug":"dynamic-link-prediction-on-wn18-filtered","dataset":"WN18 (filtered)","dataset_url":"/dataset/wn18","rows_in_archive":1,"metrics":["Mrr@2"],"first_row_in_archive_order":{"model":"ComplEx-N3 (reciprocal)","paper_title":"Canonical Tensor Decomposition for Knowledge Base Completion","paper_url":"/paper/canonical-tensor-decomposition-for-knowledge","paper_date":"2018-06-19","arxiv_id":"1806.07297","code_links":[{"title":"facebookresearch/kbc","url":"https://github.com/facebookresearch/kbc"},{"title":"facebookresearch/ssl-relation-prediction","url":"https://github.com/facebookresearch/ssl-relation-prediction"},{"title":"twktheainur/kbc","url":"https://github.com/twktheainur/kbc"}],"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}},"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}}}],"datasets":[{"url":"/dataset/reddit","name":"Reddit","full_name":"","num_papers_in_archive":699},{"url":"/dataset/wn18","name":"WN18","full_name":"WordNet18","num_papers_in_archive":485},{"url":"/dataset/enron-email-dataset","name":"Enron Emails","full_name":"","num_papers_in_archive":18},{"url":"/dataset/dblp-temporal","name":"DBLP Temporal","full_name":"","num_papers_in_archive":7},{"url":"/dataset/dgraphfin-tgn-style","name":"DGraphFin (TGN Style)","full_name":"","num_papers_in_archive":2},{"url":"/dataset/herigraph","name":"HeriGraph","full_name":"Multimodal Machine Learning Datasets on Graphs of Heritage Values and Attributes","num_papers_in_archive":2},{"url":"/dataset/ml25m-tgn-style","name":"ML25m (TGN Style)","full_name":"","num_papers_in_archive":1},{"url":"/dataset/taobao-tgn-style","name":"Taobao (TGN Style)","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/link-prediction","name":"Link Prediction"}],"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":41,"of":41,"of_with_code":20,"tagged_in_all":41,"counts":{"archive_papers_tagged":41,"with_a_code_link":20,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":41,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/evolvegcn-evolving-graph-convolutional","slug":"evolvegcn-evolving-graph-convolutional","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","date":"2019-02-26","arxiv_id":"1902.10191","repositories_listed":10,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evolvegcn-evolving-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1902.10191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10191"}},"official":{"repos":["IBM/AMLSim","IBM/EvolveGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/canonical-tensor-decomposition-for-knowledge","slug":"canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","arxiv_id":"1806.07297","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}},"official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/towards-better-dynamic-graph-learning-new-1","slug":"towards-better-dynamic-graph-learning-new-1","title":"Towards Better Dynamic Graph Learning: New Architecture and Unified Library","date":"2023-03-23","arxiv_id":"2303.13047","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-better-dynamic-graph-learning-new-1#ran","syntology_url":"https://syntology.ai/paper/2303.13047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13047"}},"official":{"repos":["yule-buaa/dyglib"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/dyg2vec-representation-learning-for-dynamic","slug":"dyg2vec-representation-learning-for-dynamic","title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","date":"2022-10-30","arxiv_id":"2210.16906","repositories_listed":2,"syntology":null},{"url":"/paper/variational-graph-recurrent-neural-networks","slug":"variational-graph-recurrent-neural-networks","title":"Variational Graph Recurrent Neural Networks","date":"2019-08-26","arxiv_id":"1908.09710","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/variational-graph-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1908.09710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09710"}},"official":{"repos":["VGraphRNN/VGRNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dyrep-learning-representations-over-dynamic","slug":"dyrep-learning-representations-over-dynamic","title":"DyRep: Learning Representations over Dynamic Graphs","date":"2019-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/supra-laplacian-encoding-for-transformer-on","slug":"supra-laplacian-encoding-for-transformer-on","title":"Supra-Laplacian Encoding for Transformer on Dynamic Graphs","date":"2024-09-26","arxiv_id":"2409.17986","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supra-laplacian-encoding-for-transformer-on#ran","syntology_url":"https://syntology.ai/paper/2409.17986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17986"}},"official":{"repos":["ykrmm/slate"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-representation-learning-for-3","slug":"contrastive-representation-learning-for-3","title":"Contrastive Representation Learning for Dynamic Link Prediction in Temporal Networks","date":"2024-08-22","arxiv_id":"2408.12753","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-receptive-field-in-dynamic-graph","slug":"temporal-receptive-field-in-dynamic-graph","title":"Temporal receptive field in dynamic graph learning: A comprehensive analysis","date":"2024-07-17","arxiv_id":"2407.12370","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-performance-of-continuous-time","slug":"exploring-the-performance-of-continuous-time","title":"Exploring the Performance of Continuous-Time Dynamic Link Prediction Algorithms","date":"2024-05-27","arxiv_id":"2405.17182","repositories_listed":1,"syntology":null},{"url":"/paper/new-perspectives-on-the-evaluation-of-link","slug":"new-perspectives-on-the-evaluation-of-link","title":"New Perspectives on the Evaluation of Link Prediction Algorithms for Dynamic Graphs","date":"2023-11-30","arxiv_id":"2311.18486","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-time-granularity-on-temporal-graphs","slug":"exploring-time-granularity-on-temporal-graphs","title":"Exploring Time Granularity on Temporal Graphs for Dynamic Link Prediction in Real-world Networks","date":"2023-11-21","arxiv_id":"2311.12255","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-time-granularity-on-temporal-graphs#ran","syntology_url":"https://syntology.ai/paper/2311.12255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.12255"}},"official":{"repos":["silencex12138/time-granularity-on-temporal-graphs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/easydgl-encode-train-and-interpret-for","slug":"easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","arxiv_id":"2303.12341","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/easydgl-encode-train-and-interpret-for#ran","syntology_url":"https://syntology.ai/paper/2303.12341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12341"}},"official":{"repos":["cchao0116/EasyDGL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dycsc-modeling-the-evolutionary-process-of","slug":"dycsc-modeling-the-evolutionary-process-of","title":"DyCSC: Modeling the Evolutionary Process of Dynamic Networks Based on Cluster Structure","date":"2022-10-23","arxiv_id":"2210.12690","repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-evaluation-for-dynamic-link","slug":"towards-better-evaluation-for-dynamic-link","title":"Towards Better Evaluation for Dynamic Link Prediction","date":"2022-07-20","arxiv_id":"2207.10128","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-better-evaluation-for-dynamic-link#ran","syntology_url":"https://syntology.ai/paper/2207.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10128"}},"official":{"repos":["fpour/dgb"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/euler-detecting-network-lateral-movement-via","slug":"euler-detecting-network-lateral-movement-via","title":"Euler: Detecting Network Lateral Movement via Scalable Temporal Link Prediction","date":"2022-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-self-modulating-attention-in","slug":"learning-self-modulating-attention-in","title":"Learning Self-Modulating Attention in Continuous Time Space with Applications to Sequential Recommendation","date":"2022-03-30","arxiv_id":"2204.06517","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/learning-self-modulating-attention-in#ran","syntology_url":"https://syntology.ai/paper/2204.06517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.06517"}},"official":{"repos":["cchao0116/CTSMA-ICML21"],"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/benchmarking-graph-neural-networks-on-dynamic","slug":"benchmarking-graph-neural-networks-on-dynamic","title":"Benchmarking Graph Neural Networks on Dynamic Link Prediction","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/190910367","slug":"190910367","title":"Learning Temporal Attention in Dynamic Graphs with Bilinear Interactions","date":"2019-09-23","arxiv_id":"1909.10367","repositories_listed":1,"syntology":null},{"url":"/paper/dyngraph2vec-capturing-network-dynamics-using","slug":"dyngraph2vec-capturing-network-dynamics-using","title":"dyngraph2vec: Capturing Network Dynamics using Dynamic Graph Representation Learning","date":"2018-09-07","arxiv_id":"1809.02657","repositories_listed":1,"syntology":null},{"url":null,"slug":"higher-order-structure-boosts-link-prediction","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","date":"2025-05-21","arxiv_id":"2505.15746","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pid-controlled-tensor-wheel-decomposition","title":"A PID-Controlled Tensor Wheel Decomposition Model for Dynamic Link Prediction","date":"2025-05-20","arxiv_id":"2505.14211","repositories_listed":0,"syntology":null},{"url":null,"slug":"predict-confidently-predict-right-abstention","title":"Predict Confidently, Predict Right: Abstention in Dynamic Graph Learning","date":"2025-01-14","arxiv_id":"2501.08397","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-link-and-flow-prediction-in-bank","title":"Dynamic Link and Flow Prediction in Bank Transfer Networks","date":"2024-09-13","arxiv_id":"2409.08718","repositories_listed":0,"syntology":null},{"url":"/paper/dyg-mamba-continuous-state-space-modeling-on","slug":"dyg-mamba-continuous-state-space-modeling-on","title":"DyG-Mamba: Continuous State Space Modeling on Dynamic Graphs","date":"2024-08-13","arxiv_id":"2408.06966","repositories_listed":0,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dyg-mamba-continuous-state-space-modeling-on#ran","syntology_url":"https://syntology.ai/paper/2408.06966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06966"}},"official":null}},{"url":null,"slug":"dygmamba-efficiently-modeling-long-term","title":"DyGMamba: Efficiently Modeling Long-Term Temporal Dependency on Continuous-Time Dynamic Graphs with State Space Models","date":"2024-08-08","arxiv_id":"2408.04713","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-neighbor-encoding-schema-a-light-cost","title":"Co-Neighbor Encoding Schema: A Light-cost Structure Encoding Method for Dynamic Link Prediction","date":"2024-07-30","arxiv_id":"2407.20871","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-link-prediction-to-forecasting","title":"From Link Prediction to Forecasting: Information Loss in Batch-based Temporal Graph Learning","date":"2024-06-07","arxiv_id":"2406.04897","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-graph-model-for-cross-domain-dynamic-link","title":"Enhancing Cross-domain Link Prediction via Evolution Process Modeling","date":"2024-02-03","arxiv_id":"2402.02168","repositories_listed":0,"syntology":null},{"url":null,"slug":"hot-higher-order-dynamic-graph-representation","title":"HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers","date":"2023-11-30","arxiv_id":"2311.18526","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-link-prediction-for-new-nodes-in","title":"Dynamic Link Prediction for New Nodes in Temporal Graph Networks","date":"2023-10-15","arxiv_id":"2310.09787","repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-transformer-for-dynamic-graph","title":"Dynamic Graph Representation Learning via Edge Temporal States Modeling and Structure-reinforced Transformer","date":"2023-04-20","arxiv_id":"2304.10079","repositories_listed":0,"syntology":null},{"url":null,"slug":"dbgdgm-dynamic-brain-graph-deep-generative","title":"DBGDGM: Dynamic Brain Graph Deep Generative Model","date":"2023-01-26","arxiv_id":"2301.11408","repositories_listed":0,"syntology":null},{"url":null,"slug":"dyn-backdoor-backdoor-attack-on-dynamic-link","title":"Dyn-Backdoor: Backdoor Attack on Dynamic Link Prediction","date":"2021-10-08","arxiv_id":"2110.03875","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-representation-over-dynamic-graph","title":"Learning Representation over Dynamic Graph using Aggregation-Diffusion Mechanism","date":"2021-06-03","arxiv_id":"2106.01678","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":"grade-graph-dynamic-embedding","title":"GRADE: Graph Dynamic Embedding","date":"2020-07-16","arxiv_id":"2007.08060","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundations-and-modelling-of-dynamic-networks","title":"Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A survey","date":"2020-05-13","arxiv_id":"2005.07496","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-over-dynamic-graphs","title":"Representation Learning over Dynamic Graphs","date":"2018-03-11","arxiv_id":"1803.04051","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-graph-embedding-approach-to","title":"Semi-supervised Graph Embedding Approach to Dynamic Link Prediction","date":"2016-10-14","arxiv_id":"1610.04351","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-link-prediction-accuracy-on","title":"Evaluating Link Prediction Accuracy on Dynamic Networks with Added and Removed Edges","date":"2016-07-25","arxiv_id":"1607.07330","repositories_listed":0,"syntology":null}],"syntology_records":10,"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":4,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/dynamic-link-prediction-on-enron","since_archive":"/sota/dynamic-link-prediction-on-enron#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/dynamic-link-prediction-on-lastfm","since_archive":"/sota/dynamic-link-prediction-on-lastfm#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/dynamic-link-prediction-on-mooc","since_archive":"/sota/dynamic-link-prediction-on-mooc#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/dynamic-link-prediction-on-reddit","since_archive":"/sota/dynamic-link-prediction-on-reddit#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/dynamic-link-prediction-on-uci","since_archive":"/sota/dynamic-link-prediction-on-uci#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/dynamic-link-prediction-on-wikipedia","since_archive":"/sota/dynamic-link-prediction-on-wikipedia#since-judged","papers_judged":2,"placed":0}]},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/task/dynamic-link-prediction/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-link-prediction/papers/ran/1","json":"/task/dynamic-link-prediction/papers/ran/1.json","rows":9}],"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":"b6bab3e5eb1bedf5c969da40f0bdf812715bd42a9e21cf2564902a5bec26b4ad","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}