{"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/identifying-linear-relational-concepts-in","title":"Identifying Linear Relational Concepts in Large Language Models","arxiv_id":"2311.08968","date":"2023-11-15","proceeding":null,"authors":["David Chanin","Anthony Hunter","Oana-Maria Camburu"],"abstract":"Transformer language models (LMs) have been shown to represent concepts as directions in the latent space of hidden activations. However, for any human-interpretable concept, how can we find its direction in the latent space? We present a technique called linear relational concepts (LRC) for finding concept directions corresponding to human-interpretable concepts by first modeling the relation between subject and object as a linear relational embedding (LRE). We find that inverting the LRE and using earlier object layers results in a powerful technique for finding concept directions that outperforms standard black-box probing classifiers. We evaluate LRCs on their performance as concept classifiers as well as their ability to causally change model output.","url_abs":"https://arxiv.org/abs/2311.08968v2","url_pdf":"https://arxiv.org/pdf/2311.08968v2.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":"identifying-linear-relational-concepts-in","repo_url":"https://github.com/chanind/linear-relational-concepts","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"identifying-linear-relational-concepts-in","repo_url":"https://github.com/chanind/linear-relational","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"object","task_name":"Object"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2311.08968","atlas_url":"https://app.syntology.ai/?focus=2311.08968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.08968"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2311.08968"},"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":"2311.08968"},"call":"get_harvested_code_for_paper(arxiv_id=\"2311.08968\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2311.08968"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2311.08968\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2311.08968"},"call":"get_concepts_for_paper(arxiv_id=\"2311.08968\")"}],"by_repo":[{"repo":"chanind/linear-relational-concepts","kind":"official","samples":4,"ran":3,"instrument":0,"unverified":1},{"repo":"chanind/linear-relational","kind":"listed","samples":4,"ran":4,"instrument":0,"unverified":0}],"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/2311.08968.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/2311.08968.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/chanind/linear-relational-concepts","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/chanind/linear-relational","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":7,"unverified":1},"n_samples":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"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":{"official":{"samples":4,"ran":3,"n_ran_checked":3,"n_instrument":0,"repositories":1},"listed":{"samples":4,"ran":4,"n_ran_checked":4,"n_instrument":0,"repositories":1}},"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":0,"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-24","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"},"samples":[{"code_sha256":"866dc1684b92eaf5","code_sha256_prefix":"866dc1684b92eaf5","entry":"cache_key","repo":"chanind/linear-relational","repo_kind":"listed","path":"linear_relational/PromptValidator.py","file_url":"https://github.com/chanind/linear-relational/blob/HEAD/linear_relational/PromptValidator.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"prompt_text:str/0/str, answer:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","retrieve_with":{"tool":"get_code","code_sha256":"866dc1684b92eaf5"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"866dc1684b92eaf5"}},{"code_sha256":"bb5cfab078201dc0","code_sha256_prefix":"bb5cfab078201dc0","entry":"chain_modifiers","repo":"chanind/linear-relational-concepts","repo_kind":"official","path":"linear_relational_concepts/PromptGenerator.py","file_url":"https://github.com/chanind/linear-relational-concepts/blob/HEAD/linear_relational_concepts/PromptGenerator.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"modifiers:list/1/callable","fixture_out_type":"function","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bb5cfab078201dc0"}},{"code_sha256":"b43c1516c16b8870","code_sha256_prefix":"b43c1516c16b8870","entry":"collect_matching_layers","repo":"chanind/linear-relational","repo_kind":"listed","path":"linear_relational/lib/layer_matching.py","file_url":"https://github.com/chanind/linear-relational/blob/HEAD/linear_relational/lib/layer_matching.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"model:callable/0/?, layer_matcher:str/0/str","fixture_out_type":"list","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":"b43c1516c16b8870"}},{"code_sha256":"0cc534ba632ea333","code_sha256_prefix":"0cc534ba632ea333","entry":"first_token_estimator","repo":"chanind/linear-relational-concepts","repo_kind":"official","path":"linear_relational_concepts/MultitokenEstimator.py","file_url":"https://github.com/chanind/linear-relational-concepts/blob/HEAD/linear_relational_concepts/MultitokenEstimator.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"object_activations:list/1/tuple","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0cc534ba632ea333"}},{"code_sha256":"4430146df8492ce2","code_sha256_prefix":"4430146df8492ce2","entry":"fix_neg_layer_num","repo":"chanind/linear-relational","repo_kind":"listed","path":"linear_relational/lib/layer_matching.py","file_url":"https://github.com/chanind/linear-relational/blob/HEAD/linear_relational/lib/layer_matching.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"model:callable/0/?, layer_matcher:str/0/str, layer_num:int/0/int","fixture_out_type":"int","level_recorded_at":"2026-09-24T23:25:36.931776+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4430146df8492ce2"}},{"code_sha256":"88c0a12555c2f232","code_sha256_prefix":"88c0a12555c2f232","entry":"get_layer_name","repo":"chanind/linear-relational","repo_kind":"listed","path":"linear_relational/lib/layer_matching.py","file_url":"https://github.com/chanind/linear-relational/blob/HEAD/linear_relational/lib/layer_matching.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"model:callable/0/?, layer_matcher:str/0/str, layer_num:int/0/int","fixture_out_type":"str","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":"88c0a12555c2f232"}},{"code_sha256":"481fa6a8c4bfa067","code_sha256_prefix":"481fa6a8c4bfa067","entry":"weighted_mean_estimator","repo":"chanind/linear-relational-concepts","repo_kind":"official","path":"linear_relational_concepts/MultitokenEstimator.py","file_url":"https://github.com/chanind/linear-relational-concepts/blob/HEAD/linear_relational_concepts/MultitokenEstimator.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"object_activations:list/1/tuple","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"481fa6a8c4bfa067"}},{"code_sha256":"848b29453a3340a4","code_sha256_prefix":"848b29453a3340a4","entry":"mean_estimator","repo":"chanind/linear-relational-concepts","repo_kind":"official","path":"linear_relational_concepts/MultitokenEstimator.py","file_url":"https://github.com/chanind/linear-relational-concepts/blob/HEAD/linear_relational_concepts/MultitokenEstimator.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"848b29453a3340a4"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"76e0513e91e9682758108e37575aec5ec3a676813ac6689223f89b94e5e580f9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}