{"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/temporal-knowledge-graph-completion","name":"Temporal Knowledge Graph Completion","slug":"temporal-knowledge-graph-completion","description_markdown":null,"categories":[{"name":"Knowledge Base","url":"/area/knowledge-base"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":42,"papers_with_code":22,"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":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":42,"of":42,"of_with_code":22,"tagged_in_all":42,"counts":{"archive_papers_tagged":42,"with_a_code_link":22,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":42,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/learning-sequence-encoders-for-temporal","slug":"learning-sequence-encoders-for-temporal","title":"Learning Sequence Encoders for Temporal Knowledge Graph Completion","date":"2018-09-10","arxiv_id":"1809.03202","repositories_listed":3,"syntology":null},{"url":"/paper/diachronic-embedding-for-temporal-knowledge","slug":"diachronic-embedding-for-temporal-knowledge","title":"Diachronic Embedding for Temporal Knowledge Graph Completion","date":"2019-07-06","arxiv_id":"1907.03143","repositories_listed":2,"syntology":null},{"url":"/paper/learning-granularity-representation-for","slug":"learning-granularity-representation-for","title":"Learning Granularity Representation for Temporal Knowledge Graph Completion","date":"2024-08-27","arxiv_id":"2408.15293","repositories_listed":1,"syntology":null},{"url":"/paper/simple-but-effective-compound-geometric","slug":"simple-but-effective-compound-geometric","title":"Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion","date":"2024-08-13","arxiv_id":"2408.06603","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-heterogeneity-among-factor-tensors","slug":"mitigating-heterogeneity-among-factor-tensors","title":"Mitigating Heterogeneity among Factor Tensors via Lie Group Manifolds for Tensor Decomposition Based Temporal Knowledge Graph Embedding","date":"2024-04-14","arxiv_id":"2404.09155","repositories_listed":1,"syntology":null},{"url":"/paper/re-temp-relation-aware-temporal","slug":"re-temp-relation-aware-temporal","title":"Re-Temp: Relation-Aware Temporal Representation Learning for Temporal Knowledge Graph Completion","date":"2023-10-24","arxiv_id":"2310.15722","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-pre-trained-language-models-for-2","slug":"leveraging-pre-trained-language-models-for-2","title":"Leveraging Pre-trained Language Models for Time Interval Prediction in Text-Enhanced Temporal Knowledge Graphs","date":"2023-09-28","arxiv_id":"2309.16357","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-temporal-knowledge-graph","slug":"a-survey-on-temporal-knowledge-graph","title":"A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and Prospects","date":"2023-08-04","arxiv_id":"2308.02457","repositories_listed":1,"syntology":null},{"url":"/paper/pre-trained-language-model-with-prompts-for","slug":"pre-trained-language-model-with-prompts-for","title":"Pre-trained Language Model with Prompts for Temporal Knowledge Graph Completion","date":"2023-05-13","arxiv_id":"2305.07912","repositories_listed":1,"syntology":null},{"url":"/paper/improving-few-shot-inductive-learning-on","slug":"improving-few-shot-inductive-learning-on","title":"Improving Few-Shot Inductive Learning on Temporal Knowledge Graphs using Confidence-Augmented Reinforcement Learning","date":"2023-04-02","arxiv_id":"2304.00613","repositories_listed":1,"syntology":null},{"url":"/paper/logic-and-commonsense-guided-temporal","slug":"logic-and-commonsense-guided-temporal","title":"Logic and Commonsense-Guided Temporal Knowledge Graph Completion","date":"2022-11-30","arxiv_id":"2211.16865","repositories_listed":1,"syntology":null},{"url":"/paper/search-to-pass-messages-for-temporal","slug":"search-to-pass-messages-for-temporal","title":"Search to Pass Messages for Temporal Knowledge Graph Completion","date":"2022-10-30","arxiv_id":"2210.16740","repositories_listed":1,"syntology":null},{"url":"/paper/along-the-time-timeline-traced-embedding-for","slug":"along-the-time-timeline-traced-embedding-for","title":"Along the Time: Timeline-traced Embedding for Temporal Knowledge Graph Completion","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tempcaps-a-capsule-network-based-embedding","slug":"tempcaps-a-capsule-network-based-embedding","title":"TempCaps: A Capsule Network-based Embedding Model for Temporal Knowledge Graph Completion","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-graph-reasoning-with-low","slug":"temporal-knowledge-graph-reasoning-with-low","title":"Temporal Knowledge Graph Reasoning with Low-rank and Model-agnostic Representations","date":"2022-04-10","arxiv_id":"2204.04783","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-graph-completion-using-box","slug":"temporal-knowledge-graph-completion-using-box","title":"Temporal Knowledge Graph Completion using Box Embeddings","date":"2021-09-18","arxiv_id":"2109.08970","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/temporal-knowledge-graph-completion-using-box#ran","syntology_url":"https://syntology.ai/paper/2109.08970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08970"}},"official":null}},{"url":"/paper/temporal-knowledge-graph-completion-using-a","slug":"temporal-knowledge-graph-completion-using-a","title":"Temporal Knowledge Graph Completion using a Linear Temporal Regularizer and Multivector Embeddings","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tie-a-framework-for-embedding-based","slug":"tie-a-framework-for-embedding-based","title":"TIE: A Framework for Embedding-based Incremental Temporal Knowledge Graph Completion","date":"2021-04-17","arxiv_id":"2104.08419","repositories_listed":1,"syntology":null},{"url":"/paper/tucker-decomposition-based-temporal-knowledge","slug":"tucker-decomposition-based-temporal-knowledge","title":"Tucker decomposition-based Temporal Knowledge Graph Completion","date":"2020-11-16","arxiv_id":"2011.07751","repositories_listed":1,"syntology":null},{"url":"/paper/dyernie-dynamic-evolution-of-riemannian","slug":"dyernie-dynamic-evolution-of-riemannian","title":"DyERNIE: Dynamic Evolution of Riemannian Manifold Embeddings for Temporal Knowledge Graph Completion","date":"2020-11-08","arxiv_id":"2011.03984","repositories_listed":1,"syntology":null},{"url":"/paper/temp-temporal-message-passing-for-temporal","slug":"temp-temporal-message-passing-for-temporal","title":"TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion","date":"2020-10-07","arxiv_id":"2010.03526","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-base-completion-new","slug":"temporal-knowledge-base-completion-new","title":"Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols","date":"2020-05-02","arxiv_id":"2005.05035","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":12,"phrase":"3 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; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/temporal-knowledge-base-completion-new#ran","syntology_url":"https://syntology.ai/paper/2005.05035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05035"}},"official":{"repos":["dair-iitd/tkbi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":null,"slug":"towards-pattern-aware-data-augmentation-for","title":"Towards Pattern-aware Data Augmentation for Temporal Knowledge Graph Completion","date":"2024-12-31","arxiv_id":"2501.00252","repositories_listed":0,"syntology":null},{"url":null,"slug":"ime-integrating-multi-curvature-shared-and","title":"IME: Integrating Multi-curvature Shared and Specific Embedding for Temporal Knowledge Graph Completion","date":"2024-03-28","arxiv_id":"2403.19881","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-knowledge-graph-completion-with-time","title":"Temporal Knowledge Graph Completion with Time-sensitive Relations in Hypercomplex Space","date":"2024-03-02","arxiv_id":"2403.02355","repositories_listed":0,"syntology":null},{"url":null,"slug":"chain-of-history-learning-and-forecasting","title":"Chain of History: Learning and Forecasting with LLMs for Temporal Knowledge Graph Completion","date":"2024-01-11","arxiv_id":"2401.06072","repositories_listed":0,"syntology":null},{"url":null,"slug":"history-repeats-overcoming-catastrophic","title":"History Repeats: Overcoming Catastrophic Forgetting For Event-Centric Temporal Knowledge Graph Completion","date":"2023-05-30","arxiv_id":"2305.18675","repositories_listed":0,"syntology":null},{"url":null,"slug":"neustip-a-novel-neuro-symbolic-model-for-link","title":"NeuSTIP: A Novel Neuro-Symbolic Model for Link and Time Prediction in Temporal Knowledge Graphs","date":"2023-05-15","arxiv_id":"2305.11301","repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-structured-sentences-with-time","title":"Incorporating Structured Sentences with Time-enhanced BERT for Fully-inductive Temporal Relation Prediction","date":"2023-04-10","arxiv_id":"2304.04717","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-inductive-learning-on-temporal","title":"Few-Shot Inductive Learning on Temporal Knowledge Graphs using Concept-Aware Information","date":"2022-11-15","arxiv_id":"2211.08169","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-knowledge-graph-completion-with","title":"Temporal Knowledge Graph Completion with Approximated Gaussian Process Embedding","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-temporal-knowledge-embeddings-with","title":"ECOLA: Enhanced Temporal Knowledge Embeddings with Contextualized Language Representations","date":"2022-03-17","arxiv_id":"2203.09590","repositories_listed":0,"syntology":null},{"url":"/paper/rotateqvs-representing-temporal-information","slug":"rotateqvs-representing-temporal-information","title":"RotateQVS: Representing Temporal Information as Rotations in Quaternion Vector Space for Temporal Knowledge Graph Completion","date":"2022-03-15","arxiv_id":"2203.07993","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-algebra-based-embeddings-for","title":"Geometric Algebra based Embeddings for Static and Temporal Knowledge Graph Completion","date":"2022-02-18","arxiv_id":"2202.09464","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-but-powerful-graph-encoder-for","title":"A Simple But Powerful Graph Encoder for Temporal Knowledge Graph Completion","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-knowledge-graph-completion-a-survey","title":"Temporal Knowledge Graph Completion: A Survey","date":"2022-01-16","arxiv_id":"2201.08236","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-but-powerful-graph-encoder-for-1","title":"A Simple But Powerful Graph Encoder for Temporal Knowledge Graph Completion","date":"2021-12-14","arxiv_id":"2112.07791","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-dependent-entity-embedding-is-not-all","title":"Time-dependent Entity Embedding is not All You Need: A Re-evaluation of Temporal Knowledge Graph Completion Models under a Unified Framework","date":"2021-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tace-time-aware-convolutional-embedding","title":"TaCE: Time-aware Convolutional Embedding Learning for Temporal Knowledge Graph Completion","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-temporal-knowledge-graph-completion-method","title":"A Temporal Knowledge Graph Completion Method Based on Balanced Timestamp Distribution","date":"2021-08-30","arxiv_id":"2108.13024","repositories_listed":0,"syntology":null},{"url":null,"slug":"t-gap-learning-to-walk-across-time-for","title":"T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion","date":"2020-12-19","arxiv_id":"2012.10595","repositories_listed":0,"syntology":null},{"url":null,"slug":"rtfe-a-recursive-temporal-fact-embedding","title":"RTFE: A Recursive Temporal Fact Embedding Framework for Temporal Knowledge Graph Completion","date":"2020-09-30","arxiv_id":"2009.14653","repositories_listed":0,"syntology":null}],"syntology_records":2,"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":2,"papers_where_code_ran_first_page":"/task/temporal-knowledge-graph-completion/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/temporal-knowledge-graph-completion/papers/ran/1","json":"/task/temporal-knowledge-graph-completion/papers/ran/1.json","rows":2}],"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":"edf07e5553796b96d8440f34704a24b7708d8b40098675abf71337e1f58f278d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}