{"url":"/task/dynamic-node-classification","name":"Dynamic Node Classification","slug":"dynamic-node-classification","description_markdown":"node classification on temporal graphs","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":10,"papers_with_code":5,"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":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/node-classification","name":"Node Classification"}],"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":5,"of":5,"tagged_in_all":10,"items":[{"url":"/paper/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":1,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/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/enhancing-the-expressivity-of-temporal-graph","title":"Enhancing the Expressivity of Temporal Graph Networks through Source-Target Identification","date":"2024-11-06","arxiv_id":"2411.03596","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":2}},{"url":"/paper/less-can-be-more-unsupervised-graph-pruning","title":"Less Can Be More: Unsupervised Graph Pruning for Large-scale Dynamic Graphs","date":"2023-05-18","arxiv_id":"2305.10673","repositories_listed":1,"syntology":null},{"url":"/paper/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":0,"n_unverified":8,"n_pointer_only":0}}],"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"}}