{"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":"/dataset/dblp","name":"DBLP","full_name":"Citation Network Dataset","description_markdown":"The **DBLP** is a citation network dataset. The citation data is extracted from DBLP, ACM, MAG (Microsoft Academic Graph), and other sources. The first version contains 629,814 papers and 632,752 citations. Each paper is associated with abstract, authors, year, venue, and title.\r\nThe data set can be used for clustering with network and side information, studying influence in the citation network, finding the most influential papers, topic modeling analysis, etc.\r\n\r\nSource: [https://www.aminer.org/citation](https://www.aminer.org/citation)","description_withheld":null,"homepage":"https://www.aminer.org/citation","introduced_date":"2008-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"ArnetMiner: extraction and mining of academic social networks","first_author":null,"url":"https://doi.org/10.1145/1401890.1402008"},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"},{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Node Clustering","url":"/task/node-clustering","datasets_with_task":"/datasets/task/node-clustering"},{"name":"Community Detection","url":"/task/community-detection","datasets_with_task":"/datasets/task/community-detection"},{"name":"Heterogeneous Node Classification","url":"/task/heterogeneous-node-classification","datasets_with_task":"/datasets/task/heterogeneous-node-classification"}],"languages":[],"variants":["DBLP (PACT) 14k","DBLP"],"data_loaders":[{"repo":"https://github.com/HeXiax/SSGNN","url":"https://github.com/HeXiax/SSGNN","frameworks":["pytorch"]}],"num_papers_in_archive":218,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/heterogeneous-node-classification-on-dblp-1","task":"Heterogeneous Node Classification","dataset_variant":"DBLP (PACT) 14k","rows":14,"metrics":["Micro-F1 (20% training data)","Macro-F1 (20% training data)","Macro-F1 (60% training data)","Micro-F1 (80% training data)","Macro-F1 (80% training data)"],"first_row_in_archive_order":{"model":"HAN","paper":"/paper/heterogeneous-graph-attention-network","metrics":{"Macro-F1 (20% training data)":"92.24%","Macro-F1 (60% training data)":"93.70%","Macro-F1 (80% training data)":"93.08%","Micro-F1 (20% training data)":"93.11%","Micro-F1 (80% training data)":"93.99%"},"code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/han"},{"title":"Jhy1993/HAN","url":"https://github.com/Jhy1993/HAN"},{"title":"JasonZhangzy1757/Heterogeneous-Graph-Attention-Network-HAN-PyTorch","url":"https://github.com/JasonZhangzy1757/Heterogeneous-Graph-Attention-Network-HAN-PyTorch"},{"title":"calderkatyal/CPSC483FinalProject","url":"https://github.com/calderkatyal/CPSC483FinalProject"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-dblp","task":"Node Classification","dataset_variant":"DBLP","rows":6,"metrics":["Accuracy","Micro F1","Inference Time (ms)","Macro F1"],"first_row_in_archive_order":{"model":"GRACE","paper":"/paper/deep-graph-contrastive-representation","metrics":{"Accuracy":"84.2 ± 0.1"},"code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grace"},{"title":"CRIPAC-DIG/GRACE","url":"https://github.com/CRIPAC-DIG/GRACE"},{"title":"ycremar/DIG-SSL","url":"https://github.com/ycremar/DIG-SSL"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-dblp","task":"Link Prediction","dataset_variant":"DBLP","rows":3,"metrics":["AUC","AP"],"first_row_in_archive_order":{"model":"GLACE","paper":"/paper/gaussian-embedding-of-large-scale-attributed","metrics":{"AP":"98.4","AUC":"98.55"},"code_links":[{"title":"bhagya-hettige/GLACE","url":"https://github.com/bhagya-hettige/GLACE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/community-detection-on-dblp","task":"Community Detection","dataset_variant":"DBLP","rows":1,"metrics":["F1-Score"],"first_row_in_archive_order":{"model":"CommunityGAN","paper":"/paper/communitygan-community-detection-with","metrics":{"F1-Score":"0.153"},"code_links":[{"title":"SamJia/CommunityGAN","url":"https://github.com/SamJia/CommunityGAN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":12,"of":12,"counts":{"papers_with_a_benchmark_row":12,"with_a_code_link":12,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":12,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":1,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/faster-inference-time-for-gnns-using","slug":"faster-inference-time-for-gnns-using","title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","date":"2024-10-19","arxiv_id":"2410.15001","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/r-gcn-the-r-could-stand-for-random","slug":"r-gcn-the-r-could-stand-for-random","title":"R-GCN: The R Could Stand for Random","date":"2022-03-04","arxiv_id":"2203.02424","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["CRIPAC-DIG/GRACE"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}}}},{"paper":"/paper/bridging-the-gap-between-community-and-node","slug":"bridging-the-gap-between-community-and-node","title":"Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection","date":"2019-12-17","arxiv_id":"1912.08808","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/non-local-attention-learning-on-large","slug":"non-local-attention-learning-on-large","title":"Non-local Attention Learning on Large Heterogeneous Information Networks","date":"2019-12-12","arxiv_id":null,"rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/gaussian-embedding-of-large-scale-attributed","slug":"gaussian-embedding-of-large-scale-attributed","title":"Gaussian Embedding of Large-scale Attributed Graphs","date":"2019-12-02","arxiv_id":"1912.00536","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/learning-topological-representation-for","slug":"learning-topological-representation-for","title":"Learning Topological Representation for Networks via Hierarchical Sampling","date":"2019-02-15","arxiv_id":"1902.06684","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/representation-learning-for-heterogeneous","slug":"representation-learning-for-heterogeneous","title":"Representation Learning for Heterogeneous Information Networks via Embedding Events","date":"2019-01-29","arxiv_id":"1901.10234","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/communitygan-community-detection-with","slug":"communitygan-community-detection-with","title":"CommunityGAN: Community Detection with Generative Adversarial Nets","date":"2019-01-20","arxiv_id":"1901.06631","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/heterogeneous-graph-attention-network","slug":"heterogeneous-graph-attention-network","title":"Heterogeneous Graph Attention Network","date":null,"arxiv_id":"1903.07293","rows_on_this_dataset":9,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["Jhy1993/HAN"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/heterogeneous-graph-attention-network#ran","syntology_url":"https://syntology.ai/paper/1903.07293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07293"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/faster-inference-time-for-gnns-using","slug":"faster-inference-time-for-gnns-using","title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","date":"2024-10-19","arxiv_id":"2410.15001","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/r-gcn-the-r-could-stand-for-random","slug":"r-gcn-the-r-could-stand-for-random","title":"R-GCN: The R Could Stand for Random","date":"2022-03-04","arxiv_id":"2203.02424","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["CRIPAC-DIG/GRACE"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}}}},{"paper":"/paper/bridging-the-gap-between-community-and-node","slug":"bridging-the-gap-between-community-and-node","title":"Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection","date":"2019-12-17","arxiv_id":"1912.08808","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/non-local-attention-learning-on-large","slug":"non-local-attention-learning-on-large","title":"Non-local Attention Learning on Large Heterogeneous Information Networks","date":"2019-12-12","arxiv_id":null,"rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/gaussian-embedding-of-large-scale-attributed","slug":"gaussian-embedding-of-large-scale-attributed","title":"Gaussian Embedding of Large-scale Attributed Graphs","date":"2019-12-02","arxiv_id":"1912.00536","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/learning-topological-representation-for","slug":"learning-topological-representation-for","title":"Learning Topological Representation for Networks via Hierarchical Sampling","date":"2019-02-15","arxiv_id":"1902.06684","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/representation-learning-for-heterogeneous","slug":"representation-learning-for-heterogeneous","title":"Representation Learning for Heterogeneous Information Networks via Embedding Events","date":"2019-01-29","arxiv_id":"1901.10234","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/communitygan-community-detection-with","slug":"communitygan-community-detection-with","title":"CommunityGAN: Community Detection with Generative Adversarial Nets","date":"2019-01-20","arxiv_id":"1901.06631","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/heterogeneous-graph-attention-network","slug":"heterogeneous-graph-attention-network","title":"Heterogeneous Graph Attention Network","date":null,"arxiv_id":"1903.07293","rows_on_this_dataset":9,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["Jhy1993/HAN"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/heterogeneous-graph-attention-network#ran","syntology_url":"https://syntology.ai/paper/1903.07293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07293"}}}}],"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/dataset/dblp/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/dblp/papers/ran/1","json":"/dataset/dblp/papers/ran/1.json","rows":2}],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":2,"samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":2,"papers_with_a_run_with_no_instrument_failure":1,"papers_where_every_run_was_an_instrument_failure":1,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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/node-classification-on-dblp","since_archive":"/sota/node-classification-on-dblp#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/link-prediction-on-dblp","since_archive":"/sota/link-prediction-on-dblp#since-judged","papers_judged":1,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"87613d83c5cd9e6743c741079288e5939d5157ca1bb90e959fce0b9610ee9ed6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}