{"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/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 (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":2,"rows_per_page":100,"shown":100,"of":187,"of_with_code":89,"tagged_in_all":187,"counts":{"archive_papers_tagged":187,"with_a_code_link":89,"where_syntology_ran_a_sample":20,"not_listed_spam_title":0,"listed":187,"listed_where_code_ran":20,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":6,"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/inductive-relation-prediction-on-knowledge","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"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/nodepiece-compositional-and-parameter","slug":"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":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/nodepiece-compositional-and-parameter#ran","syntology_url":"https://syntology.ai/paper/2106.12144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12144"}},"official":{"repos":["migalkin/NodePiece"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/structured-sparse-r-cnn-for-direct-scene","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-sparse-r-cnn-for-direct-scene#ran","syntology_url":"https://syntology.ai/paper/2106.10815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10815"}},"official":{"repos":["mcg-nju/structured-sparse-rcnn"],"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"]}}},{"url":"/paper/entity-context-and-relational-paths-for","slug":"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":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/entity-context-and-relational-paths-for#ran","syntology_url":"https://syntology.ai/paper/2002.06757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06757"}},"official":{"repos":["hwwang55/PathCon"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/weakly-supervised-deep-anomaly-detection-with","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/weakly-supervised-deep-anomaly-detection-with#ran","syntology_url":"https://syntology.ai/paper/1910.13601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13601"}},"official":{"repos":["mala-lab/prenet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/kg-bert-bert-for-knowledge-graph-completion","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}},"official":{"repos":["yao8839836/kg-bert"],"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/dissent-sentence-representation-learning-from","slug":"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","slug":"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_constructed":1,"n_ran_checked":5,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":4,"n_no_contract":1,"n_pointer_only":0,"phrase":"9 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 4 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/solving-inequality-proofs-with-large-language#ran","syntology_url":"https://syntology.ai/paper/2506.07927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07927"}},"official":{"repos":["lupantech/ineqmath"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-the-role-of-llms-for-document","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-attention-based-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1906.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01195"}},"official":{"repos":["deepakn97/relationPrediction"],"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/unihdsa-a-unified-relation-prediction","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-large-language-models-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2308.13916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13916"}},"official":{"repos":["yao8839836/kg-llm"],"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/care-co-attention-network-for-joint-entity","slug":"care-co-attention-network-for-joint-entity","title":"CARE: Co-Attention Network for Joint Entity and Relation Extraction","date":"2023-08-24","arxiv_id":"2308.12531","repositories_listed":1,"syntology":null},{"url":"/paper/crepe-learnable-prompting-with-clip-improves","slug":"crepe-learnable-prompting-with-clip-improves","title":"CREPE: Learnable Prompting With CLIP Improves Visual Relationship Prediction","date":"2023-07-10","arxiv_id":"2307.04838","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-representations-for-relation","slug":"explainable-representations-for-relation","title":"Explainable Representations for Relation Prediction in Knowledge Graphs","date":"2023-06-22","arxiv_id":"2306.12687","repositories_listed":1,"syntology":null},{"url":"/paper/re-2-region-aware-relation-extraction-from","slug":"re-2-region-aware-relation-extraction-from","title":"RE$^2$: Region-Aware Relation Extraction from Visually Rich Documents","date":"2023-05-24","arxiv_id":"2305.14590","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-learning-of-visual-1","slug":"weakly-supervised-learning-of-visual-1","title":"Weakly-Supervised Learning of Visual Relations in Multimodal Pretraining","date":"2023-05-23","arxiv_id":"2305.14281","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/weakly-supervised-learning-of-visual-1#ran","syntology_url":"https://syntology.ai/paper/2305.14281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14281"}},"official":{"repos":["e-bug/weak-relation-vlm"],"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/inductive-relation-prediction-from-relational","slug":"inductive-relation-prediction-from-relational","title":"Inductive Relation Prediction from Relational Paths and Context with Hierarchical Transformers","date":"2023-04-01","arxiv_id":"2304.00215","repositories_listed":1,"syntology":null},{"url":"/paper/taking-a-closer-look-at-visual-relation","slug":"taking-a-closer-look-at-visual-relation","title":"Taking A Closer Look at Visual Relation: Unbiased Video Scene Graph Generation with Decoupled Label Learning","date":"2023-03-23","arxiv_id":"2303.13209","repositories_listed":1,"syntology":null},{"url":"/paper/prototype-based-embedding-network-for-scene","slug":"prototype-based-embedding-network-for-scene","title":"Prototype-based Embedding Network for Scene Graph Generation","date":"2023-03-13","arxiv_id":"2303.07096","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/prototype-based-embedding-network-for-scene#ran","syntology_url":"https://syntology.ai/paper/2303.07096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.07096"}},"official":{"repos":["vl-group/penet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-aspect-explainable-inductive-relation","slug":"multi-aspect-explainable-inductive-relation","title":"Multi-Aspect Explainable Inductive Relation Prediction by Sentence Transformer","date":"2023-01-04","arxiv_id":"2301.01664","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-refinement-based-on-triplet","slug":"knowledge-graph-refinement-based-on-triplet","title":"Knowledge Graph Refinement based on Triplet BERT-Networks","date":"2022-11-18","arxiv_id":"2211.10460","repositories_listed":1,"syntology":null},{"url":"/paper/connprompt-connective-cloze-prompt-learning","slug":"connprompt-connective-cloze-prompt-learning","title":"ConnPrompt: Connective-cloze Prompt Learning for Implicit Discourse Relation Recognition","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-two-stage-method-for-chinese-amr-parsing","slug":"a-two-stage-method-for-chinese-amr-parsing","title":"A Two-Stage Method for Chinese AMR Parsing","date":"2022-09-29","arxiv_id":"2209.14512","repositories_listed":1,"syntology":null},{"url":"/paper/towards-general-purpose-representation","slug":"towards-general-purpose-representation","title":"Towards General-Purpose Representation Learning of Polygonal Geometries","date":"2022-09-29","arxiv_id":"2209.15458","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/towards-general-purpose-representation#ran","syntology_url":"https://syntology.ai/paper/2209.15458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15458"}},"official":{"repos":["gengchenmai/polygon_encoder"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/er-equivariance-regularizer-for-knowledge","slug":"er-equivariance-regularizer-for-knowledge","title":"ER: Equivariance Regularizer for Knowledge Graph Completion","date":"2022-06-24","arxiv_id":"2206.12142","repositories_listed":1,"syntology":null},{"url":"/paper/raat-relation-augmented-attention-transformer","slug":"raat-relation-augmented-attention-transformer","title":"RAAT: Relation-Augmented Attention Transformer for Relation Modeling in Document-Level Event Extraction","date":"2022-06-07","arxiv_id":"2206.03377","repositories_listed":1,"syntology":null},{"url":"/paper/r5-rule-discovery-with-reinforced-and-1","slug":"r5-rule-discovery-with-reinforced-and-1","title":"R5: Rule Discovery with Reinforced and Recurrent Relational Reasoning","date":"2022-05-13","arxiv_id":"2205.06454","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/r5-rule-discovery-with-reinforced-and-1#ran","syntology_url":"https://syntology.ai/paper/2205.06454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06454"}},"official":{"repos":["sluxsr/r5_graph_reasoning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/linkbert-pretraining-language-models-with","slug":"linkbert-pretraining-language-models-with","title":"LinkBERT: Pretraining Language Models with Document Links","date":"2022-03-29","arxiv_id":"2203.15827","repositories_listed":1,"syntology":{"n":14,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/linkbert-pretraining-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2203.15827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15827"}},"official":{"repos":["michiyasunaga/LinkBERT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/can-unsupervised-knowledge-transfer-from","slug":"can-unsupervised-knowledge-transfer-from","title":"Can Unsupervised Knowledge Transfer from Social Discussions Help Argument Mining?","date":"2022-03-24","arxiv_id":"2203.12881","repositories_listed":1,"syntology":null},{"url":"/paper/effective-token-graph-modeling-using-a-novel-1","slug":"effective-token-graph-modeling-using-a-novel-1","title":"Effective Token Graph Modeling using a Novel Labeling Strategy for Structured Sentiment Analysis","date":"2022-03-21","arxiv_id":"2203.10796","repositories_listed":1,"syntology":null},{"url":"/paper/relationformer-a-unified-framework-for-image","slug":"relationformer-a-unified-framework-for-image","title":"Relationformer: A Unified Framework for Image-to-Graph Generation","date":"2022-03-19","arxiv_id":"2203.10202","repositories_listed":1,"syntology":null},{"url":"/paper/cogalex-2-0-impact-of-data-quality-on-lexical","slug":"cogalex-2-0-impact-of-data-quality-on-lexical","title":"CogALex 2.0: Impact of Data Quality on Lexical-Semantic Relation Prediction","date":"2021-12-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/klmo-knowledge-graph-enhanced-pretrained","slug":"klmo-knowledge-graph-enhanced-pretrained","title":"KLMo: Knowledge Graph Enhanced Pretrained Language Model with Fine-Grained Relationships","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/standing-on-the-shoulders-of-predecessors","slug":"standing-on-the-shoulders-of-predecessors","title":"Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14170","repositories_listed":1,"syntology":null},{"url":"/paper/history-aware-multimodal-transformer-for","slug":"history-aware-multimodal-transformer-for","title":"History Aware Multimodal Transformer for Vision-and-Language Navigation","date":"2021-10-25","arxiv_id":"2110.13309","repositories_listed":1,"syntology":{"n":15,"n_ran":7,"n_constructed":3,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 3 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) · 8 unverified","sample_list":"/paper/history-aware-multimodal-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2110.13309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13309"}},"official":null}},{"url":"/paper/a-simple-strong-and-robust-baseline-for","slug":"a-simple-strong-and-robust-baseline-for","title":"PARE: A Simple and Strong Baseline for Monolingual and Multilingual Distantly Supervised Relation Extraction","date":"2021-10-14","arxiv_id":"2110.07415","repositories_listed":1,"syntology":null},{"url":"/paper/a-topological-view-of-rule-learning-in","slug":"a-topological-view-of-rule-learning-in","title":"Cycle Representation Learning for Inductive Relation Prediction","date":"2021-10-06","arxiv_id":"2110.02510","repositories_listed":1,"syntology":null},{"url":"/paper/relation-prediction-as-an-auxiliary-training","slug":"relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","repositories_listed":1,"syntology":null},{"url":"/paper/a-partition-filter-network-for-joint-entity","slug":"a-partition-filter-network-for-joint-entity","title":"A Partition Filter Network for Joint Entity and Relation Extraction","date":"2021-08-27","arxiv_id":"2108.12202","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-partition-filter-network-for-joint-entity#ran","syntology_url":"https://syntology.ai/paper/2108.12202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12202"}},"official":{"repos":["Coopercoppers/PFN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/target-adaptive-context-aggregation-for-video","slug":"target-adaptive-context-aggregation-for-video","title":"Target Adaptive Context Aggregation for Video Scene Graph Generation","date":"2021-08-18","arxiv_id":"2108.08121","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-scene-graph-relation-prediction","slug":"zero-shot-scene-graph-relation-prediction","title":"Zero-Shot Scene Graph Relation Prediction through Commonsense Knowledge Integration","date":"2021-07-11","arxiv_id":"2107.05080","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/zero-shot-scene-graph-relation-prediction#ran","syntology_url":"https://syntology.ai/paper/2107.05080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05080"}},"official":{"repos":["Wayfear/Coacher"],"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"]}}},{"url":"/paper/prgc-potential-relation-and-global","slug":"prgc-potential-relation-and-global","title":"PRGC: Potential Relation and Global Correspondence Based Joint Relational Triple Extraction","date":"2021-06-18","arxiv_id":"2106.09895","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 1 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/prgc-potential-relation-and-global#ran","syntology_url":"https://syntology.ai/paper/2106.09895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09895"}},"official":{"repos":["hy-struggle/PRGC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-time-series-classification-by","slug":"semi-supervised-time-series-classification-by","title":"Semi-supervised Time Series Classification by Temporal Relation Prediction","date":"2021-06-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/entity-concept-enhanced-few-shot-relation","slug":"entity-concept-enhanced-few-shot-relation","title":"Entity Concept-enhanced Few-shot Relation Extraction","date":"2021-06-04","arxiv_id":"2106.02401","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/entity-concept-enhanced-few-shot-relation#ran","syntology_url":"https://syntology.ai/paper/2106.02401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02401"}},"official":{"repos":["LittleGuoKe/ConceptFERE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/integrating-lexical-information-into-entity","slug":"integrating-lexical-information-into-entity","title":"Integrating Lexical Information into Entity Neighbourhood Representations for Relation Prediction","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/annotating-columns-with-pre-trained-language","slug":"annotating-columns-with-pre-trained-language","title":"Annotating Columns with Pre-trained Language Models","date":"2021-04-05","arxiv_id":"2104.01785","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/annotating-columns-with-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2104.01785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01785"}},"official":{"repos":["megagonlabs/doduo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-relation-prediction-by-bert","slug":"inductive-relation-prediction-by-bert","title":"Inductive Relation Prediction by BERT","date":"2021-03-12","arxiv_id":"2103.07102","repositories_listed":1,"syntology":null},{"url":"/paper/tcn-table-convolutional-network-for-web-table","slug":"tcn-table-convolutional-network-for-web-table","title":"TCN: Table Convolutional Network for Web Table Interpretation","date":"2021-02-17","arxiv_id":"2102.09460","repositories_listed":1,"syntology":null},{"url":"/paper/neural-relational-inference-with-efficient","slug":"neural-relational-inference-with-efficient","title":"Neural Relational Inference with Efficient Message Passing Mechanisms","date":"2021-01-23","arxiv_id":"2101.09486","repositories_listed":1,"syntology":null},{"url":"/paper/a-shallow-neural-model-for-relation","slug":"a-shallow-neural-model-for-relation","title":"A shallow neural model for relation prediction","date":"2021-01-22","arxiv_id":"2101.09090","repositories_listed":1,"syntology":null},{"url":"/paper/graphlog-a-benchmark-for-measuring-logical","slug":"graphlog-a-benchmark-for-measuring-logical","title":"GraphLog: A Benchmark for Measuring Logical Generalization in Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/communicative-message-passing-for-inductive","slug":"communicative-message-passing-for-inductive","title":"Communicative Message Passing for Inductive Relation Reasoning","date":"2020-12-16","arxiv_id":"2012.08911","repositories_listed":1,"syntology":null},{"url":"/paper/gdpnet-refining-latent-multi-view-graph-for","slug":"gdpnet-refining-latent-multi-view-graph-for","title":"GDPNet: Refining Latent Multi-View Graph for Relation Extraction","date":"2020-12-12","arxiv_id":"2012.06780","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-learning-for-knowledge-graph","slug":"multi-task-learning-for-knowledge-graph","title":"Multi-Task Learning for Knowledge Graph Completion with Pre-trained Language Models","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-brief-survey-and-comparative-study-of","slug":"a-brief-survey-and-comparative-study-of","title":"A Brief Survey and Comparative Study of Recent Development of Pronoun Coreference Resolution","date":"2020-09-27","arxiv_id":"2009.12721","repositories_listed":1,"syntology":null},{"url":"/paper/rationalizing-medical-relation-prediction","slug":"rationalizing-medical-relation-prediction","title":"Rationalizing Medical Relation Prediction from Corpus-level Statistics","date":"2020-05-02","arxiv_id":"2005.00889","repositories_listed":1,"syntology":null},{"url":"/paper/ampersand-argument-mining-for-persuasive-1","slug":"ampersand-argument-mining-for-persuasive-1","title":"AMPERSAND: Argument Mining for PERSuAsive oNline Discussions","date":"2020-04-30","arxiv_id":"2004.14677","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-importance-of-word-and-sentence","slug":"on-the-importance-of-word-and-sentence","title":"On the Importance of Word and Sentence Representation Learning in Implicit Discourse Relation Classification","date":"2020-04-27","arxiv_id":"2004.12617","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/on-the-importance-of-word-and-sentence#ran","syntology_url":"https://syntology.ai/paper/2004.12617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12617"}},"official":{"repos":["HKUST-KnowComp/BMGF-RoBERTa"],"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/r-vgae-relational-variational-graph","slug":"r-vgae-relational-variational-graph","title":"R-VGAE: Relational-variational Graph Autoencoder for Unsupervised Prerequisite Chain Learning","date":"2020-04-22","arxiv_id":"2004.10610","repositories_listed":1,"syntology":null},{"url":"/paper/relation-transformer-network","slug":"relation-transformer-network","title":"Relation Transformer Network","date":"2020-04-13","arxiv_id":"2004.06193","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-logical-generalization-in-graph","slug":"evaluating-logical-generalization-in-graph","title":"Evaluating Logical Generalization in Graph Neural Networks","date":"2020-03-14","arxiv_id":"2003.06560","repositories_listed":1,"syntology":null},{"url":"/paper/cascaded-human-object-interaction-recognition","slug":"cascaded-human-object-interaction-recognition","title":"Cascaded Human-Object Interaction Recognition","date":"2020-03-09","arxiv_id":"2003.04262","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-2-hop-distant-supervision-from","slug":"leveraging-2-hop-distant-supervision-from","title":"Leveraging 2-hop Distant Supervision from Table Entity Pairs for Relation Extraction","date":"2019-09-13","arxiv_id":"1909.06007","repositories_listed":1,"syntology":null},{"url":"/paper/semantically-regularized-logic-graph","slug":"semantically-regularized-logic-graph","title":"Embedding Symbolic Knowledge into Deep Networks","date":"2019-09-03","arxiv_id":"1909.01161","repositories_listed":1,"syntology":null},{"url":"/paper/linguistic-versus-latent-relations-for","slug":"linguistic-versus-latent-relations-for","title":"Linguistic Versus Latent Relations for Modeling Coherent Flow in Paragraphs","date":"2019-08-30","arxiv_id":"1908.11790","repositories_listed":1,"syntology":null},{"url":"/paper/dissent-learning-sentence-representations","slug":"dissent-learning-sentence-representations","title":"DisSent: Learning Sentence Representations from Explicit Discourse Relations","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fact-discovery-from-knowledge-base-via-facet","slug":"fact-discovery-from-knowledge-base-via-facet","title":"Fact Discovery from Knowledge Base via Facet Decomposition","date":"2019-04-21","arxiv_id":"1904.09540","repositories_listed":1,"syntology":null},{"url":"/paper/learning-dual-retrieval-module-for-semi","slug":"learning-dual-retrieval-module-for-semi","title":"Learning Dual Retrieval Module for Semi-supervised Relation Extraction","date":"2019-02-20","arxiv_id":"1902.07814","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":3,"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/learning-dual-retrieval-module-for-semi#ran","syntology_url":"https://syntology.ai/paper/1902.07814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07814"}},"official":{"repos":["INK-USC/DualRE"],"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/deep-enhanced-representation-for-implicit","slug":"deep-enhanced-representation-for-implicit","title":"Deep Enhanced Representation for Implicit Discourse Relation Recognition","date":"2018-07-13","arxiv_id":"1807.05154","repositories_listed":1,"syntology":null},{"url":"/paper/argument-mining-with-structured-svms-and-rnns","slug":"argument-mining-with-structured-svms-and-rnns","title":"Argument Mining with Structured SVMs and RNNs","date":"2017-04-23","arxiv_id":"1704.06869","repositories_listed":1,"syntology":null},{"url":null,"slug":"spade-spatial-aware-denoising-network-for","title":"SPADE: Spatial-Aware Denoising Network for Open-vocabulary Panoptic Scene Graph Generation with Long- and Local-range Context Reasoning","date":"2025-07-08","arxiv_id":"2507.05798","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-comprehensive-argument-analysis-in","title":"Towards Comprehensive Argument Analysis in Education: Dataset, Tasks, and Method","date":"2025-05-17","arxiv_id":"2505.12028","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-text-relation-prediction-for","title":"Image-Text Relation Prediction for Multilingual Tweets","date":"2025-05-08","arxiv_id":"2505.05040","repositories_listed":0,"syntology":null},{"url":null,"slug":"ctinexus-leveraging-optimized-llm-in-context","title":"CTINexus: Automatic Cyber Threat Intelligence Knowledge Graph Construction Using Large Language Models","date":"2024-10-28","arxiv_id":"2410.21060","repositories_listed":0,"syntology":null},{"url":null,"slug":"muse-integrating-multi-knowledge-for","title":"MUSE: Integrating Multi-Knowledge for Knowledge Graph Completion","date":"2024-09-26","arxiv_id":"2409.17536","repositories_listed":0,"syntology":null},{"url":null,"slug":"entity-aware-self-attention-and","title":"Entity-Aware Self-Attention and Contextualized GCN for Enhanced Relation Extraction in Long Sentences","date":"2024-09-15","arxiv_id":"2409.13755","repositories_listed":0,"syntology":null},{"url":null,"slug":"vired-prediction-of-visual-relations-in","title":"ViRED: Prediction of Visual Relations in Engineering Drawings","date":"2024-09-02","arxiv_id":"2409.00909","repositories_listed":0,"syntology":null},{"url":null,"slug":"muse-multi-knowledge-passing-on-the-edges","title":"MUSE: Multi-Knowledge Passing on the Edges, Boosting Knowledge Graph Completion","date":"2024-08-09","arxiv_id":"2408.05283","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-structured-sentiment-analysis-as","title":"Revisiting Structured Sentiment Analysis as Latent Dependency Graph Parsing","date":"2024-07-05","arxiv_id":"2407.04801","repositories_listed":0,"syntology":null},{"url":null,"slug":"srfund-a-multi-granularity-hierarchical","title":"SRFUND: A Multi-Granularity Hierarchical Structure Reconstruction Benchmark in Form Understanding","date":"2024-06-13","arxiv_id":"2406.08757","repositories_listed":0,"syntology":null},{"url":null,"slug":"dlaformer-an-end-to-end-transformer-for","title":"DLAFormer: An End-to-End Transformer For Document Layout Analysis","date":"2024-05-20","arxiv_id":"2405.11757","repositories_listed":0,"syntology":null}],"syntology_records":22,"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":20,"papers_where_code_ran_first_page":"/task/relation-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":"archive","page":2,"of":2,"url":"/task/relation-prediction/papers/2","json":"/task/relation-prediction/papers/2.json","rows":87},{"order":"ran","page":1,"of":1,"url":"/task/relation-prediction/papers/ran/1","json":"/task/relation-prediction/papers/ran/1.json","rows":20}],"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":"ee2df5264d629fc3dc9cfbe1c047e0cb5eb7af5e3bb2aea1b9e6290a89c6f1f2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}