{"url":"/task/relation-prediction","name":"Relation Prediction","slug":"relation-prediction","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":187,"papers_with_code":89,"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":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/maven-arg","name":"MAVEN-Arg","full_name":"MAVEN-Arguments","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"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":30,"of":89,"tagged_in_all":187,"items":[{"url":"/paper/inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/nodepiece-compositional-and-parameter","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","date":"2021-06-23","arxiv_id":"2106.12144","repositories_listed":4,"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/structured-sparse-r-cnn-for-direct-scene","title":"Structured Sparse R-CNN for Direct Scene Graph Generation","date":"2021-06-21","arxiv_id":"2106.10815","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/entity-context-and-relational-paths-for","title":"Relational Message Passing for Knowledge Graph Completion","date":"2020-02-17","arxiv_id":"2002.06757","repositories_listed":4,"syntology":{"n":18,"n_ran":1,"n_unverified":17,"n_pointer_only":0}},{"url":"/paper/weakly-supervised-deep-anomaly-detection-with","title":"Deep Weakly-supervised Anomaly Detection","date":"2019-10-30","arxiv_id":"1910.13601","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/dissent-sentence-representation-learning-from","title":"DisSent: Sentence Representation Learning from Explicit Discourse Relations","date":"2017-10-12","arxiv_id":"1710.04334","repositories_listed":3,"syntology":null},{"url":"/paper/solving-inequality-proofs-with-large-language","title":"Solving Inequality Proofs with Large Language Models","date":"2025-06-09","arxiv_id":"2506.07927","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/rethinking-the-role-of-llms-for-document","title":"Rethinking the Role of LLMs for Document-level Relation Extraction: a Refiner with Task Distribution and Probability Fusion","date":"2025-04-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/1st-place-solution-for-psg-competition-with","title":"1st Place Solution for PSG competition with ECCV'22 SenseHuman Workshop","date":"2023-02-06","arxiv_id":"2302.02651","repositories_listed":2,"syntology":null},{"url":"/paper/deepdrug-a-general-graph-based-deep-learning","title":"DeepDrug: A General Graph-Based Deep Learning Framework for Drug Relation Prediction","date":"2022-02-10","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/enteval-a-holistic-evaluation-benchmark-for","title":"EntEval: A Holistic Evaluation Benchmark for Entity Representations","date":"2019-08-31","arxiv_id":"1909.00137","repositories_listed":2,"syntology":null},{"url":"/paper/learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","arxiv_id":"1906.01195","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/unihdsa-a-unified-relation-prediction","title":"UniHDSA: A Unified Relation Prediction Approach for Hierarchical Document Structure Analysis","date":"2025-03-20","arxiv_id":"2503.15893","repositories_listed":1,"syntology":null},{"url":"/paper/trix-a-more-expressive-model-for-zero-shot","title":"TRIX: A More Expressive Model for Zero-shot Domain Transfer in Knowledge Graphs","date":"2025-02-26","arxiv_id":"2502.19512","repositories_listed":1,"syntology":null},{"url":"/paper/pathe-leveraging-entity-agnostic-paths-for","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","date":"2025-01-31","arxiv_id":"2501.19095","repositories_listed":1,"syntology":null},{"url":"/paper/from-primes-to-paths-enabling-fast-multi","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","date":"2024-11-17","arxiv_id":"2411.11149","repositories_listed":1,"syntology":null},{"url":"/paper/replacing-paths-with-connection-biased","title":"Replacing Paths with Connection-Biased Attention for Knowledge Graph Completion","date":"2024-10-01","arxiv_id":"2410.00876","repositories_listed":1,"syntology":null},{"url":"/paper/konstruktor-a-strong-baseline-for-simple","title":"Konstruktor: A Strong Baseline for Simple Knowledge Graph Question Answering","date":"2024-09-24","arxiv_id":"2409.15902","repositories_listed":1,"syntology":null},{"url":"/paper/learning-rule-induced-subgraph-1","title":"Learning Rule-Induced Subgraph Representations for Inductive Relation Prediction","date":"2024-08-09","arxiv_id":"2408.07088","repositories_listed":1,"syntology":null},{"url":"/paper/openpsg-open-set-panoptic-scene-graph","title":"OpenPSG: Open-set Panoptic Scene Graph Generation via Large Multimodal Models","date":"2024-07-15","arxiv_id":"2407.11213","repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-graph-based-cross-document","title":"Towards Better Graph-based Cross-document Relation Extraction via Non-bridge Entity Enhancement and Prediction Debiasing","date":"2024-06-24","arxiv_id":"2406.16529","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-scene-graph-generation","title":"REACT: Real-time Efficiency and Accuracy Compromise for Tradeoffs in Scene Graph Generation","date":"2024-05-25","arxiv_id":"2405.16116","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-completion-using-structural","title":"Knowledge Graph Completion using Structural and Textual Embeddings","date":"2024-04-24","arxiv_id":"2404.16206","repositories_listed":1,"syntology":null},{"url":"/paper/grapher-a-structure-aware-text-to-graph-model","title":"GraphER: A Structure-aware Text-to-Graph Model for Entity and Relation Extraction","date":"2024-04-18","arxiv_id":"2404.12491","repositories_listed":1,"syntology":null},{"url":"/paper/anchoring-path-for-inductive-relation","title":"Anchoring Path for Inductive Relation Prediction in Knowledge Graphs","date":"2023-12-21","arxiv_id":"2312.13596","repositories_listed":1,"syntology":null},{"url":"/paper/vlprompt-vision-language-prompting-for","title":"VLPrompt: Vision-Language Prompting for Panoptic Scene Graph Generation","date":"2023-11-27","arxiv_id":"2311.16492","repositories_listed":1,"syntology":null},{"url":"/paper/kbioxlm-a-knowledge-anchored-biomedical","title":"KBioXLM: A Knowledge-anchored Biomedical Multilingual Pretrained Language Model","date":"2023-11-20","arxiv_id":"2311.11564","repositories_listed":1,"syntology":null},{"url":"/paper/extending-transductive-knowledge-graph","title":"Extending Transductive Knowledge Graph Embedding Models for Inductive Logical Relational Inference","date":"2023-09-07","arxiv_id":"2309.03773","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-large-language-models-for-knowledge","title":"Exploring Large Language Models for Knowledge Graph Completion","date":"2023-08-26","arxiv_id":"2308.13916","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}}],"syntology_records":9,"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"}}