{"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":"/paper/hitter-hierarchical-transformers-for","title":"HittER: Hierarchical Transformers for Knowledge Graph Embeddings","arxiv_id":"2008.12813","date":"2020-08-28","proceeding":"EMNLP 2021 11","authors":["Sanxing Chen","Xiaodong Liu","Jianfeng Gao","Jian Jiao","Ruofei Zhang","Yangfeng Ji"],"abstract":"This paper examines the challenging problem of learning representations of entities and relations in a complex multi-relational knowledge graph. We propose HittER, a Hierarchical Transformer model to jointly learn Entity-relation composition and Relational contextualization based on a source entity's neighborhood. Our proposed model consists of two different Transformer blocks: the bottom block extracts features of each entity-relation pair in the local neighborhood of the source entity and the top block aggregates the relational information from outputs of the bottom block. We further design a masked entity prediction task to balance information from the relational context and the source entity itself. Experimental results show that HittER achieves new state-of-the-art results on multiple link prediction datasets. We additionally propose a simple approach to integrate HittER into BERT and demonstrate its effectiveness on two Freebase factoid question answering datasets.","url_abs":"https://arxiv.org/abs/2008.12813v2","url_pdf":"https://arxiv.org/pdf/2008.12813v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"hitter-hierarchical-transformers-for","repo_url":"https://github.com/microsoft/HittER","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"hitter-hierarchical-transformers-for","repo_url":"https://github.com/seeyourmind/tkgelib","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"hitter-hierarchical-transformers-for","repo_url":"https://github.com/zjunlp/relphormer","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"knowledge-graph-embeddings","task_name":"Knowledge Graph Embeddings"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":null,"task_name":"Relation"}],"methods":[{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"label-smoothing","method_name":"Label Smoothing"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"position-wise-feed-forward-layer","method_name":"Position-Wise Feed-Forward Layer"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"transformer","method_name":"Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-fb15k-237","task":"Link Prediction","dataset":"FB15k-237","model":"HittER","rank_in_archive_order":57,"of":75,"metrics":{"Hit@1":"0.279","Hit@10":"0.558","Hits@3":"0.409","MRR":"0.373"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18rr","task":"Link Prediction","dataset":"WN18RR","model":"HittER","rank_in_archive_order":21,"of":75,"metrics":{"Hits@1":"0.462","Hits@10":"0.584","Hits@3":"0.516","MRR":"0.503"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2008.12813","atlas_url":"https://app.syntology.ai/?focus=2008.12813","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.12813"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2008.12813"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2008.12813"},"call":"get_harvested_code_for_paper(arxiv_id=\"2008.12813\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2008.12813"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2008.12813\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2008.12813"},"call":"get_concepts_for_paper(arxiv_id=\"2008.12813\")"}],"by_repo":[{"repo":"microsoft/HittER","kind":"listed","samples":6,"ran":6,"instrument":0,"unverified":0},{"repo":"seeyourmind/tkgelib","kind":"listed","samples":1,"ran":1,"instrument":0,"unverified":0},{"repo":"zjunlp/relphormer","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2205.10852"],"harvested_for_calls":[{"arxiv_id":"2205.10852","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2205.10852"},"call":"get_harvested_code_for_paper(arxiv_id=\"2205.10852\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2008.12813.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2008.12813.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/seeyourmind/tkgelib","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zjunlp/relphormer","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/microsoft/HittER","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":7},"n_samples":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"listed":{"samples":7,"ran":7,"n_ran_checked":7,"n_instrument":0,"repositories":2}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":7,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"4ca15d3df7072836","code_sha256_prefix":"4ca15d3df7072836","entry":"filename_in_module","repo":"microsoft/HittER","repo_kind":"listed","path":"kge/misc.py","file_url":"https://github.com/microsoft/HittER/blob/HEAD/kge/misc.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"module_or_module_list:module/0/?, filename:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4ca15d3df7072836"}},{"code_sha256":"6064ed3d652179ac","code_sha256_prefix":"6064ed3d652179ac","entry":"index_KvsAll","repo":"microsoft/HittER","repo_kind":"listed","path":"kge/indexing.py","file_url":"https://github.com/microsoft/HittER/blob/HEAD/kge/indexing.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dataset:MockDataset/0/?, split:str/0/str, key:str/0/str","fixture_out_type":"OrderedDict","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6064ed3d652179ac"}},{"code_sha256":"ef8ff474ebd295a8","code_sha256_prefix":"ef8ff474ebd295a8","entry":"index_KvsAll_to_torch","repo":"microsoft/HittER","repo_kind":"listed","path":"kge/indexing.py","file_url":"https://github.com/microsoft/HittER/blob/HEAD/kge/indexing.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"index:dict/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ef8ff474ebd295a8"}},{"code_sha256":"48fd41e4af6e88db","code_sha256_prefix":"48fd41e4af6e88db","entry":"index_frequency_percent","repo":"seeyourmind/tkgelib","repo_kind":"listed","path":"kge/indexing.py","file_url":"https://github.com/seeyourmind/tkgelib/blob/HEAD/kge/indexing.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dataset:MockDataset/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, seeyourmind/tkgelib, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","mcp_get_code":{"code_sha256":"48fd41e4af6e88db"}},{"code_sha256":"60a0dd5eb91604d4","code_sha256_prefix":"60a0dd5eb91604d4","entry":"index_neighbor","repo":"microsoft/HittER","repo_kind":"listed","path":"kge/indexing.py","file_url":"https://github.com/microsoft/HittER/blob/HEAD/kge/indexing.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dataset:MockDataset/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"60a0dd5eb91604d4"}},{"code_sha256":"3087bb1d9186ca95","code_sha256_prefix":"3087bb1d9186ca95","entry":"is_number","repo":"microsoft/HittER","repo_kind":"listed","path":"kge/misc.py","file_url":"https://github.com/microsoft/HittER/blob/HEAD/kge/misc.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"s:str/0/str, number_type:callable/0/?","fixture_out_type":"bool","level_recorded_at":"2026-09-25T12:08:31.494501+00:00","code_page":"/code/is-number","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3087bb1d9186ca95"}},{"code_sha256":"5ebd841a3319a390","code_sha256_prefix":"5ebd841a3319a390","entry":"which","repo":"microsoft/HittER","repo_kind":"listed","path":"kge/misc.py","file_url":"https://github.com/microsoft/HittER/blob/HEAD/kge/misc.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"program:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-25T12:08:31.494501+00:00","retrieve_with":{"tool":"get_code","code_sha256":"5ebd841a3319a390"},"code_page":"/code/which","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5ebd841a3319a390"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2d85e1858e3b7e32a69e5c799096365b553e966575bd40a5de1d7bf27c5c85d5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}