{"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/graph-ranking","name":"Graph Ranking","slug":"graph-ranking","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":"archive_url"},"counts":{"papers_tagged":18,"papers_with_code":5,"benchmarks":4,"benchmark_tables_in_archive":4,"benchmark_tables_shown":4,"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":1,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-ranking-on-ogbg-molesol","slug":"graph-ranking-on-ogbg-molesol","dataset":"ogbg-molesol","dataset_url":null,"rows_in_archive":4,"metrics":["Kendall's Tau"],"first_row_in_archive_order":{"model":"2-WL-GNN + CmpNN","paper_title":"Ranking Structured Objects with Graph Neural Networks","paper_url":"/paper/ranking-structured-objects-with-graph-neural","paper_date":"2021-04-18","arxiv_id":"2104.08869","code_links":[{"title":"Cortys/rankgnn","url":"https://github.com/Cortys/rankgnn"}],"syntology":null}},{"leaderboard":"/sota/graph-ranking-on-ogbg-molfreesolv","slug":"graph-ranking-on-ogbg-molfreesolv","dataset":"ogbg-molfreesolv","dataset_url":null,"rows_in_archive":4,"metrics":["Kendall's Tau"],"first_row_in_archive_order":{"model":"2-WL-GNN + Utility Regression","paper_title":"Ranking Structured Objects with Graph Neural Networks","paper_url":"/paper/ranking-structured-objects-with-graph-neural","paper_date":"2021-04-18","arxiv_id":"2104.08869","code_links":[{"title":"Cortys/rankgnn","url":"https://github.com/Cortys/rankgnn"}],"syntology":null}},{"leaderboard":"/sota/graph-ranking-on-ogbg-mollipo","slug":"graph-ranking-on-ogbg-mollipo","dataset":"ogbg-mollipo","dataset_url":null,"rows_in_archive":4,"metrics":["Kendall's Tau"],"first_row_in_archive_order":{"model":"2-WL-GNN + Utility Regression","paper_title":"Ranking Structured Objects with Graph Neural Networks","paper_url":"/paper/ranking-structured-objects-with-graph-neural","paper_date":"2021-04-18","arxiv_id":"2104.08869","code_links":[{"title":"Cortys/rankgnn","url":"https://github.com/Cortys/rankgnn"}],"syntology":null}},{"leaderboard":"/sota/graph-ranking-on-zinc","slug":"graph-ranking-on-zinc","dataset":"ZINC","dataset_url":"/dataset/zinc","rows_in_archive":4,"metrics":["Kendall's Tau"],"first_row_in_archive_order":{"model":"2-WL-GNN + DirectRanker","paper_title":"Ranking Structured Objects with Graph Neural Networks","paper_url":"/paper/ranking-structured-objects-with-graph-neural","paper_date":"2021-04-18","arxiv_id":"2104.08869","code_links":[{"title":"Cortys/rankgnn","url":"https://github.com/Cortys/rankgnn"}],"syntology":null}}],"datasets":[{"url":"/dataset/zinc","name":"ZINC","full_name":"ZINC","num_papers_in_archive":251}],"subtasks":[],"parent_tasks":[],"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":18,"of":18,"of_with_code":5,"tagged_in_all":18,"counts":{"archive_papers_tagged":18,"with_a_code_link":5,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":18,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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/outlining-and-filling-hierarchical-query","slug":"outlining-and-filling-hierarchical-query","title":"Outlining and Filling: Hierarchical Query Graph Generation for Answering Complex Questions over Knowledge Graphs","date":"2021-11-01","arxiv_id":"2111.00732","repositories_listed":2,"syntology":null},{"url":"/paper/personalized-ranking-on-cascading-behavior","slug":"personalized-ranking-on-cascading-behavior","title":"Personalized Ranking on Cascading Behavior Graphs for Accurate Multi-Behavior Recommendation","date":"2025-02-17","arxiv_id":"2502.11335","repositories_listed":1,"syntology":null},{"url":"/paper/gusum-graph-based-unsupervised-summarization-1","slug":"gusum-graph-based-unsupervised-summarization-1","title":"GUSUM: Graph-based Unsupervised Summarization Using Sentence Features Scoring and Sentence-BERT","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ranking-structured-objects-with-graph-neural","slug":"ranking-structured-objects-with-graph-neural","title":"Ranking Structured Objects with Graph Neural Networks","date":"2021-04-18","arxiv_id":"2104.08869","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-query-graphs-for-complex","slug":"learning-to-rank-query-graphs-for-complex","title":"Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs","date":"2018-11-02","arxiv_id":"1811.01118","repositories_listed":1,"syntology":null},{"url":null,"slug":"advanced-academic-team-worker-recommendation","title":"Advanced Academic Team Worker Recommendation Models","date":"2024-02-07","arxiv_id":"2402.16876","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-we-really-need-contrastive-learning-for","title":"Graph Ranking Contrastive Learning: A Extremely Simple yet Efficient Method","date":"2023-10-23","arxiv_id":"2310.14525","repositories_listed":0,"syntology":null},{"url":null,"slug":"todd-topological-compound-fingerprinting-in","title":"ToDD: Topological Compound Fingerprinting in Computer-Aided Drug Discovery","date":"2022-11-07","arxiv_id":"2211.03808","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-method-of-query-graph-reranking-for","title":"A Method of Query Graph Reranking for Knowledge Base Question Answering","date":"2022-04-27","arxiv_id":"2204.12808","repositories_listed":0,"syntology":null},{"url":null,"slug":"gusum-graph-based-unsupervised-summarization","title":"GUSUM: Graph-Based Unsupervised Summarization using Sentence-BERT and Sentence Features","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-time-bias-in-bipartite-graph","title":"Addressing Time Bias in Bipartite Graph Ranking for Important Node Identification","date":"2019-11-28","arxiv_id":"1911.12558","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-coherent-and-graph-optimized","title":"Temporal Coherent and Graph Optimized Manifold Ranking for Visual Tracking","date":"2018-04-17","arxiv_id":"1804.06253","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-centrality-measures-for-boosting","title":"Graph Centrality Measures for Boosting Popularity-Based Entity Linking","date":"2017-11-30","arxiv_id":"1712.00044","repositories_listed":0,"syntology":null},{"url":null,"slug":"scir-qa-at-semeval-2017-task-3-cnn-model","title":"SCIR-QA at SemEval-2017 Task 3: CNN Model Based on Similar and Dissimilar Information between Keywords for Question Similarity","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-framework-for-multimodal-medical","title":"A Graph Framework for Multimodal Medical Information Processing","date":"2017-02-22","arxiv_id":"1608.00134","repositories_listed":0,"syntology":null},{"url":null,"slug":"collective-named-entity-disambiguation-using","title":"Collective Named Entity Disambiguation using Graph Ranking and Clique Partitioning Approaches","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"query-focused-multi-document-summarization-1","title":"Query-focused Multi-Document Summarization: Combining a Topic Model with Graph-based Semi-supervised Learning","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-ranking-for-collective-named-entity","title":"Graph Ranking for Collective Named Entity Disambiguation","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":0,"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":0,"papers_where_code_ran_first_page":null,"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":[],"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":"d6dc0791d048efff24a710352e8a532466068ffbc15666394d0b2541021a6300","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}