{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/kgemodel","entry":"KGEModel","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","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)"},"n_papers":7,"n_papers_ran":3,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":7,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":4},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2405.08540","paper":"/paper/generalizing-knowledge-graph-embedding-with","title":"Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xxrep/golde","path":"codes/model.py","file_url":"https://github.com/xxrep/golde/blob/HEAD/codes/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4eba98263e698b6c","mcp_get_code":{"code_sha256":"4eba98263e698b6c"}},{"arxiv_id":"2305.14126","paper":"/paper/to-copy-rather-than-memorize-a-vertical","title":"To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rui9812/VLP","path":"codes/model.py","file_url":"https://github.com/rui9812/VLP/blob/HEAD/codes/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1fa05e69ad41f900","mcp_get_code":{"code_sha256":"1fa05e69ad41f900"}},{"arxiv_id":"2205.14209","paper":"/paper/stargraph-a-coarse-to-fine-representation","title":"StarGraph: Knowledge Representation Learning based on Incomplete Two-hop Subgraph","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzli-ucas/stargraph","path":"model.py","file_url":"https://github.com/hzli-ucas/stargraph/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d5b8c7847df8264d","mcp_get_code":{"code_sha256":"d5b8c7847df8264d"}},{"arxiv_id":"2204.13221","paper":"/paper/transher-translating-knowledge-graph","title":"TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction","date":"2022-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yizhilll/TranSHER","path":"codes/model.py","file_url":"https://github.com/yizhilll/TranSHER/blob/HEAD/codes/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3dabd476ff99d238","mcp_get_code":{"code_sha256":"3dabd476ff99d238"}},{"arxiv_id":"2203.13965","paper":"/paper/augmenting-knowledge-graphs-for-better-link","title":"Augmenting Knowledge Graphs for Better Link Prediction","date":"2022-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Otamio/KGA","path":"rotate/model.py","file_url":"https://github.com/Otamio/KGA/blob/HEAD/rotate/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ad2c09af18624995","mcp_get_code":{"code_sha256":"ad2c09af18624995"}},{"arxiv_id":"2202.07919","paper":"/paper/house-knowledge-graph-embedding-with","title":"HousE: Knowledge Graph Embedding with Householder Parameterization","date":"2022-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anrep/house","path":"codes/model.py","file_url":"https://github.com/anrep/house/blob/HEAD/codes/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"953b9e21de9e14f2","mcp_get_code":{"code_sha256":"953b9e21de9e14f2"}},{"arxiv_id":"2104.07869","paper":"/paper/faithfully-explainable-recommendation-via","title":"Faithfully Explainable Recommendation via Neural Logic Reasoning","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orcax/LOGER","path":"kge/model.py","file_url":"https://github.com/orcax/LOGER/blob/HEAD/kge/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1d50c240edf62800","mcp_get_code":{"code_sha256":"1d50c240edf62800"}}]}