{"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_unverified":3,"n_pointer_only":4}}}],"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 (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":20,"of":20,"tagged_in_all":67,"items":[{"url":"/paper/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","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_unverified":3,"n_pointer_only":4}},{"url":"/paper/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":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/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","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","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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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":2,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/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","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","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","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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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_unverified":1,"n_pointer_only":0}},{"url":"/paper/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","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_unverified":0,"n_pointer_only":2}},{"url":"/paper/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}],"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"},"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"}}