{"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/implicit-relations","name":"Implicit Relations","slug":"implicit-relations","description_markdown":null,"categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":67,"papers_with_code":20,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":1},"benchmarks":[{"leaderboard":"/sota/implicit-relations-on-big-bench","slug":"implicit-relations-on-big-bench","dataset":"BIG-bench","dataset_url":"/dataset/big-bench","rows_in_archive":2,"metrics":["Accuracy "],"first_row_in_archive_order":{"model":"Chinchilla-70B (few-shot, k=5)","paper_title":"Training Compute-Optimal Large Language Models","paper_url":"/paper/training-compute-optimal-large-language","paper_date":"2022-03-29","arxiv_id":"2203.15556","code_links":[{"title":"karpathy/llama2.c","url":"https://github.com/karpathy/llama2.c"},{"title":"nkluge-correa/teenytinyllama","url":"https://github.com/nkluge-correa/teenytinyllama"}],"syntology":{"n":11,"n_ran":8,"n_constructed":3,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/training-compute-optimal-large-language#ran","syntology_url":"https://syntology.ai/paper/2203.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15556"}},"official":null}}}],"datasets":[{"url":"/dataset/big-bench","name":"BIG-bench","full_name":"Beyond the Imitation Game Benchmark","num_papers_in_archive":349}],"subtasks":[],"parent_tasks":[{"url":"/task/reading-comprehension","name":"Reading Comprehension"}],"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":67,"of":67,"of_with_code":20,"tagged_in_all":67,"counts":{"archive_papers_tagged":67,"with_a_code_link":20,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":67,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":5,"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 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/scaling-language-models-methods-analysis-1","slug":"scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","arxiv_id":"2112.11446","repositories_listed":3,"syntology":null},{"url":"/paper/training-compute-optimal-large-language","slug":"training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","arxiv_id":"2203.15556","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":3,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/training-compute-optimal-large-language#ran","syntology_url":"https://syntology.ai/paper/2203.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15556"}},"official":null}},{"url":"/paper/commonsense-for-generative-multi-hop-question","slug":"commonsense-for-generative-multi-hop-question","title":"Commonsense for Generative Multi-Hop Question Answering Tasks","date":"2018-09-17","arxiv_id":"1809.06309","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/commonsense-for-generative-multi-hop-question#ran","syntology_url":"https://syntology.ai/paper/1809.06309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.06309"}},"official":{"repos":["yicheng-w/CommonSenseMultiHopQA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/kg-qagen-a-knowledge-graph-based-framework","slug":"kg-qagen-a-knowledge-graph-based-framework","title":"KG-QAGen: A Knowledge-Graph-Based Framework for Systematic Question Generation and Long-Context LLM Evaluation","date":"2025-05-18","arxiv_id":"2505.12495","repositories_listed":1,"syntology":null},{"url":"/paper/ask-questions-with-double-hints-visual","slug":"ask-questions-with-double-hints-visual","title":"Ask Questions with Double Hints: Visual Question Generation with Answer-awareness and Region-reference","date":"2024-07-06","arxiv_id":"2407.05100","repositories_listed":1,"syntology":null},{"url":"/paper/magiclens-self-supervised-image-retrieval","slug":"magiclens-self-supervised-image-retrieval","title":"MagicLens: Self-Supervised Image Retrieval with Open-Ended Instructions","date":"2024-03-28","arxiv_id":"2403.19651","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":0,"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/magiclens-self-supervised-image-retrieval#ran","syntology_url":"https://syntology.ai/paper/2403.19651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.19651"}},"official":{"repos":["google-deepmind/magiclens"],"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/a-generalized-deep-markov-random-fields","slug":"a-generalized-deep-markov-random-fields","title":"A Generalized Deep Markov Random Fields Framework for Fake News Detection.","date":"2023-08-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/anchor-prediction-automatic-refinement-of","slug":"anchor-prediction-automatic-refinement-of","title":"Anchor Prediction: Automatic Refinement of Internet Links","date":"2023-05-23","arxiv_id":"2305.14337","repositories_listed":1,"syntology":null},{"url":"/paper/conreader-exploring-implicit-relations-in","slug":"conreader-exploring-implicit-relations-in","title":"ConReader: Exploring Implicit Relations in Contracts for Contract Clause Extraction","date":"2022-10-17","arxiv_id":"2210.08697","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-implicit-relations-with-language","slug":"inferring-implicit-relations-with-language","title":"Inferring Implicit Relations in Complex Questions with Language Models","date":"2022-04-28","arxiv_id":"2204.13778","repositories_listed":1,"syntology":null},{"url":"/paper/mukea-multimodal-knowledge-extraction-and","slug":"mukea-multimodal-knowledge-extraction-and","title":"MuKEA: Multimodal Knowledge Extraction and Accumulation for Knowledge-based Visual Question Answering","date":"2022-03-17","arxiv_id":"2203.09138","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mukea-multimodal-knowledge-extraction-and#ran","syntology_url":"https://syntology.ai/paper/2203.09138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09138"}},"official":{"repos":["andersonstra/mukea"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stock-movement-prediction-based-on-bi-typed-1","slug":"stock-movement-prediction-based-on-bi-typed-1","title":"Stock Movement Prediction Based on Bi-typed Hybrid-relational Market Knowledge Graph via Dual Attention Networks","date":"2022-01-11","arxiv_id":"2201.04965","repositories_listed":1,"syntology":null},{"url":"/paper/improving-embedded-knowledge-graph-multi-hop","slug":"improving-embedded-knowledge-graph-multi-hop","title":"Improving Embedded Knowledge Graph Multi-hop Question Answering by introducing Relational Chain Reasoning","date":"2021-10-25","arxiv_id":"2110.12679","repositories_listed":1,"syntology":null},{"url":"/paper/graformer-graph-convolution-transformer-for","slug":"graformer-graph-convolution-transformer-for","title":"GraFormer: Graph Convolution Transformer for 3D Pose Estimation","date":"2021-09-17","arxiv_id":"2109.08364","repositories_listed":1,"syntology":null},{"url":"/paper/local-explanation-of-dialogue-response","slug":"local-explanation-of-dialogue-response","title":"Local Explanation of Dialogue Response Generation","date":"2021-06-11","arxiv_id":"2106.06528","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/local-explanation-of-dialogue-response#ran","syntology_url":"https://syntology.ai/paper/2106.06528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06528"}},"official":{"repos":["Pascalson/LERG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-an-lstm-based-predictive-framework","slug":"towards-an-lstm-based-predictive-framework","title":"Mining Temporal Evolution of Knowledge Graph and Genealogical Features for Literature-based Discovery Prediction","date":"2019-07-22","arxiv_id":"1907.09395","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-discourse-relation-identification","slug":"implicit-discourse-relation-identification","title":"Implicit Discourse Relation Identification for Open-domain Dialogues","date":"2019-07-09","arxiv_id":"1907.03975","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/implicit-discourse-relation-identification#ran","syntology_url":"https://syntology.ai/paper/1907.03975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.03975"}},"official":{"repos":["derekmma/dialogue-discourse-relation"],"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/old-is-gold-linguistic-driven-approach-for","slug":"old-is-gold-linguistic-driven-approach-for","title":"Old is Gold: Linguistic Driven Approach for Entity and Relation Linking of Short Text","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/relation-aware-graph-attention-network-for","slug":"relation-aware-graph-attention-network-for","title":"Relation-Aware Graph Attention Network for Visual Question Answering","date":"2019-03-29","arxiv_id":"1903.12314","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relation-aware-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1903.12314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12314"}},"official":{"repos":["linjieli222/VQA_ReGAT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploiting-explicit-paths-for-multi-hop","slug":"exploiting-explicit-paths-for-multi-hop","title":"Exploiting Explicit Paths for Multi-hop Reading Comprehension","date":"2018-11-02","arxiv_id":"1811.01127","repositories_listed":1,"syntology":null},{"url":null,"slug":"ckmdiff-a-generative-diffusion-model-for-ckm","title":"CKMDiff: A Generative Diffusion Model for CKM Construction via Inverse Problems with Learned Priors","date":"2025-04-24","arxiv_id":"2504.17323","repositories_listed":0,"syntology":null},{"url":null,"slug":"gobert-gene-ontology-graph-informed-bert-for","title":"GoBERT: Gene Ontology Graph Informed BERT for Universal Gene Function Prediction","date":"2025-01-03","arxiv_id":"2501.01930","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-based-motion-generation-with-multi","title":"Hypergraph-based Motion Generation with Multi-modal Interaction Relational Reasoning","date":"2024-09-18","arxiv_id":"2409.11676","repositories_listed":0,"syntology":null},{"url":null,"slug":"relation-extraction-with-fine-tuned-large","title":"Relation Extraction with Fine-Tuned Large Language Models in Retrieval Augmented Generation Frameworks","date":"2024-06-20","arxiv_id":"2406.14745","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-enhanced-relational-metric-learning","title":"Semantic-Enhanced Relational Metric Learning for Recommender Systems","date":"2024-06-07","arxiv_id":"2406.10246","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-understand-support-an-implicit","title":"How to Understand \"Support\"? An Implicit-enhanced Causal Inference Approach for Weakly-supervised Phrase Grounding","date":"2024-02-29","arxiv_id":"2402.19116","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-balanced-explicit-and-implicit","title":"Modeling Balanced Explicit and Implicit Relations with Contrastive Learning for Knowledge Concept Recommendation in MOOCs","date":"2024-02-13","arxiv_id":"2402.08256","repositories_listed":0,"syntology":null},{"url":null,"slug":"boundary-and-relation-distillation-for","title":"Towards Complementary Knowledge Distillation for Efficient Dense Image Prediction","date":"2024-01-24","arxiv_id":"2401.13174","repositories_listed":0,"syntology":null},{"url":null,"slug":"rsg-fast-learning-adaptive-skills-for","title":"Unlock Reliable Skill Inference for Quadruped Adaptive Behavior by Skill Graph","date":"2023-11-10","arxiv_id":"2311.06015","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-relation-alignment-for-composed-image","title":"Dual Relation Alignment for Composed Image Retrieval","date":"2023-09-05","arxiv_id":"2309.02169","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-diag-knowledge-enhanced-disease-diagnosis","title":"K-Diag: Knowledge-enhanced Disease Diagnosis in Radiographic Imaging","date":"2023-02-22","arxiv_id":"2302.11557","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-trained-sentence-embeddings-for-implicit","title":"Pre-trained Sentence Embeddings for Implicit Discourse Relation Classification","date":"2022-10-20","arxiv_id":"2210.11005","repositories_listed":0,"syntology":null},{"url":null,"slug":"tweetspin-fine-grained-propaganda-detection","title":"TWEETSPIN: Fine-grained Propaganda Detection in Social Media Using Multi-View Representations","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cup-curriculum-learning-based-prompt-tuning","title":"CUP: Curriculum Learning based Prompt Tuning for Implicit Event Argument Extraction","date":"2022-05-01","arxiv_id":"2205.00498","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowaugnet-multi-source-medical-knowledge","title":"KnowAugNet: Multi-Source Medical Knowledge Augmented Medication Prediction Network with Multi-Level Graph Contrastive Learning","date":"2022-04-25","arxiv_id":"2204.11736","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-information-network-based-1","title":"Heterogeneous Information Network based Default Analysis on Banking Micro and Small Enterprise Users","date":"2022-04-24","arxiv_id":"2204.11849","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-shallow-discourse-parsing-in-the-1","title":"Revisiting Shallow Discourse Parsing in the PDTB-3: Handling Intra-sentential Implicits","date":"2022-04-01","arxiv_id":"2204.00350","repositories_listed":0,"syntology":null},{"url":null,"slug":"lordbert-embedding-long-text-by-segment","title":"LordBERT: Embedding Long Text by Segment Ordering with BERT","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-distant-transfer-learning-for-pre","title":"Meta Distant Transfer Learning for Pre-trained Language Models","date":"2021-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gog-relation-aware-graph-over-graph-network","title":"GoG: Relation-aware Graph-over-Graph Network for Visual Dialog","date":"2021-09-17","arxiv_id":"2109.08475","repositories_listed":0,"syntology":null},{"url":null,"slug":"lets-be-explicit-about-that-distant","title":"Let’s be explicit about that: Distant supervision for implicit discourse relation classification via connective prediction","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"where-are-we-in-discourse-relation","title":"Where Are We in Discourse Relation Recognition?","date":"2021-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"let-s-be-explicit-about-that-distant","title":"Let's be explicit about that: Distant supervision for implicit discourse relation classification via connective prediction","date":"2021-06-06","arxiv_id":"2106.03192","repositories_listed":0,"syntology":null},{"url":null,"slug":"moc-gan-mixing-objects-and-captions-to","title":"MOC-GAN: Mixing Objects and Captions to Generate Realistic Images","date":"2021-06-06","arxiv_id":"2106.03128","repositories_listed":0,"syntology":null},{"url":null,"slug":"jointly-extracting-explicit-and-implicit","title":"Jointly Extracting Explicit and Implicit Relational Triples with Reasoning Pattern Enhanced Binary Pointer Network","date":"2021-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bass-boosting-abstractive-summarization-with","title":"BASS: Boosting Abstractive Summarization with Unified Semantic Graph","date":"2021-05-25","arxiv_id":"2105.12041","repositories_listed":0,"syntology":null},{"url":null,"slug":"namerec-highly-accurate-and-fine-grained","title":"NameRec*: Highly Accurate and Fine-grained Person Name Recognition","date":"2021-03-21","arxiv_id":"2103.11360","repositories_listed":0,"syntology":null},{"url":null,"slug":"extending-implicit-discourse-relation","title":"Extending Implicit Discourse Relation Recognition to the PDTB-3","date":"2020-10-13","arxiv_id":"2010.06294","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-spatial-relations-through-1","title":"Understanding Spatial Relations through Multiple Modalities","date":"2020-07-19","arxiv_id":"2007.09551","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-adversarial-domain-adaptation-3","title":"Unsupervised Adversarial Domain Adaptation for Implicit Discourse Relation Classification","date":"2020-03-04","arxiv_id":"2003.02244","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-cross-theory-discourse-relation","title":"Toward Cross-theory Discourse Relation Annotation","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-open-information-extraction-of","title":"Learning Open Information Extraction of Implicit Relations from Reading Comprehension Datasets","date":"2019-05-15","arxiv_id":"1905.07471","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-label-network-classification-via","title":"Multi-Label Network Classification via Weighted Personalized Factorizations","date":"2019-02-25","arxiv_id":"1902.09294","repositories_listed":0,"syntology":null},{"url":null,"slug":"discourse-coherence-concurrent-explicit-and","title":"Discourse Coherence: Concurrent Explicit and Implicit Relations","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"translating-implicit-discourse-connectives","title":"Translating Implicit Discourse Connectives Based on Cross-lingual Annotation and Alignment","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-full-text-shallow-discourse-relation","title":"Towards Full Text Shallow Discourse Relation Annotation: Experiments with Cross-Paragraph Implicit Relations in the PDTB","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bootstrapping-for-numerical-open-ie","title":"Bootstrapping for Numerical Open IE","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-compatible-are-our-discourse-annotations","title":"How compatible are our discourse annotations? Insights from mapping RST-DT and PDTB annotations","date":"2017-04-28","arxiv_id":"1704.08893","repositories_listed":0,"syntology":null},{"url":null,"slug":"tdb-11-extensions-on-turkish-discourse-bank","title":"TDB 1.1: Extensions on Turkish Discourse Bank","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-contribution-of-word-embeddings-to","title":"On the contribution of word embeddings to temporal relation classification","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-a-deep-neural-approach-for-knowledge","title":"Toward a Deep Neural Approach for Knowledge-Based IR","date":"2016-06-23","arxiv_id":"1606.07211","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-open-knowledge-acquisition-via-long","title":"Automatic Open Knowledge Acquisition via Long Short-Term Memory Networks with Feedback Negative Sampling","date":"2016-05-25","arxiv_id":"1605.07918","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-english-universal-dependencies-an","title":"Enhanced English Universal Dependencies: An Improved Representation for Natural Language Understanding Tasks","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-on-the-attention-based-rnn-model-and","title":"Survey on the attention based RNN model and its applications in computer vision","date":"2016-01-25","arxiv_id":"1601.06823","repositories_listed":0,"syntology":null},{"url":null,"slug":"mined-semantic-analysis-a-new-concept-space","title":"Mined Semantic Analysis: A New Concept Space Model for Semantic Representation of Textual Data","date":"2015-12-10","arxiv_id":"1512.03465","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-job-offers-for-candidates-learning","title":"Ranking Job Offers for Candidates: learning hidden knowledge from Big Data","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"data-mining-using-unguided-symbolic","title":"Data Mining using Unguided Symbolic Regression on a Blast Furnace Dataset","date":"2013-09-23","arxiv_id":"1309.5931","repositories_listed":0,"syntology":null}],"syntology_records":7,"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":6,"papers_where_code_ran_first_page":"/task/implicit-relations/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":"ran","page":1,"of":1,"url":"/task/implicit-relations/papers/ran/1","json":"/task/implicit-relations/papers/ran/1.json","rows":6}],"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":"f8eeec7712e488d18fb46a493a4a1f92fb2365e572738da34d81d0990e263cf5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}