{"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":"/method/reldiff","slug":"reldiff","name":"RelDiff","full_name":"RelDiff","full_name_withheld":false,"description_markdown":"RelDiff generates entity-relation-entity embeddings in a single embedding space. RelDiff adopts two fundamental vector algebraic operators to transform entity and relation embeddings from knowledge graphs into entity-relation-entity embeddings. In particular, RelDiff can encode finer-grained information about the relations than is captured when separate embeddings are learned for the entities and the relations.","description_state":"present","introduced_year":null,"introduced_by":{"title":"RelDiff: Enriching Knowledge Graph Relation Representations for Sensitivity Classification","paper":"/paper/reldiff-enriching-knowledge-graph-relation","first_author":"Hitarth Narvala","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/reldiff-enriching-knowledge-graph-relation"},"source":{"url":"https://aclanthology.org/2021.findings-emnlp.311","title":"RelDiff: Enriching Knowledge Graph Relation Representations for Sensitivity Classification","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/reldiff-enriching-knowledge-graph-relation","slug":"reldiff-enriching-knowledge-graph-relation","title":"RelDiff: Enriching Knowledge Graph Relation Representations for Sensitivity Classification","date":"2021-11-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":1,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":1,"with_a_code_link":0,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":1,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/entity-embeddings","name":"Entity Embeddings","papers":1},{"task":"/task/knowledge-graph-embeddings","name":"Knowledge Graph Embeddings","papers":1},{"task":null,"name":"Relation","papers":1},{"task":"/task/sensitivity","name":"Sensitivity","papers":1},{"task":"/task/sensitivity-classification","name":"Sensitivity Classification","papers":1},{"task":"/task/text-classification","name":"Text Classification","papers":1}],"tasks_shown":6,"n_tasks":6,"usage_by_year":[{"year":"2021","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/reldiff"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=RelDiff","read_at":"2026-10-05T01:01:03+00:00","query":"RelDiff","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":3,"served":null,"leading_other_bearer":{"arxiv_id":"2506.00710","title":"RelDiff: Relational Data Generative Modeling with Graph-Based Diffusion Models","citations":4,"named_by":["title_prefix"],"bearer_name":"RelDiff: Relational Data Generative Modeling with Graph-Based Diffusion Models","ask_with":"have('2506.00710')"},"n_other_bearers_listed":3,"note":"Nothing resolved to 'RelDiff' by name, but 3 thing(s) here DECLARE that name -- most cited: the paper 'RelDiff: Relational Data Generative Modeling with Graph-Based Diffusion Models' (arXiv:2506.00710, 4 citations). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 3 entries in Syntology's graph carry it; the most cited is the paper “RelDiff: Relational Data Generative Modeling with Graph-Based Diffusion Models” (arXiv:2506.00710, 4 citations). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"726cc04b8838b0a3fc900b1da1395032a5f08c5ba336068facf01caaff9750e1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}