{"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":"/code/probe","entry":"Probe","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":5,"n_samples_ran":4,"n_samples_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":3,"n_places_pointer_only_link_open":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_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"key_notes":{"n_samples_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_samples_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)"},"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":"2605.20286","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20286","title":"Adaptive Probe-based Steering for Robust LLM Jailbreaking","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"MuyuenLP/AdaSteer","path":"adasteer/extract/Probing/probe.py","file_url":"https://github.com/MuyuenLP/AdaSteer/blob/HEAD/adasteer/extract/Probing/probe.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e28a1152efcc1dac","code_sha256_prefix":"e28a1152efcc1dac","mcp_get_code":{"code_sha256":"e28a1152efcc1dac"}},{"arxiv_id":"2109.09234","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-probing-measuring-usable","title":"Conditional probing: measuring usable information beyond a baseline","date":"2021-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"john-hewitt/conditional-probing","path":"vinfo/probe.py","file_url":"https://github.com/john-hewitt/conditional-probing/blob/HEAD/vinfo/probe.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"30e38ea2ab97d520","code_sha256_prefix":"30e38ea2ab97d520","mcp_get_code":{"code_sha256":"30e38ea2ab97d520"}},{"arxiv_id":"2104.03869","arxiv_id_is_arxiv":true,"paper":"/paper/probing-bert-in-hyperbolic-spaces-1","title":"Probing BERT in Hyperbolic Spaces","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FranxYao/PoincareProbe","path":"SyntaxProbe/probe/hyper.py","file_url":"https://github.com/FranxYao/PoincareProbe/blob/HEAD/SyntaxProbe/probe/hyper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FranxYao/PoincareProbe when it was checked","code_sha256":"9df3a1ce2f824692","code_sha256_prefix":"9df3a1ce2f824692","mcp_get_code":{"code_sha256":"9df3a1ce2f824692"}},{"arxiv_id":"2005.04511","arxiv_id_is_arxiv":true,"paper":"/paper/finding-universal-grammatical-relations-in","title":"Finding Universal Grammatical Relations in Multilingual BERT","date":"2020-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethanachi/multilingual-probing-visualization","path":"probing/probe.py","file_url":"https://github.com/ethanachi/multilingual-probing-visualization/blob/HEAD/probing/probe.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ethanachi/multilingual-probing-visualization (NOASSERTION)","code_sha256":"531c09dd4b6edea7","code_sha256_prefix":"531c09dd4b6edea7","mcp_get_code":{"code_sha256":"531c09dd4b6edea7"}},{"arxiv_id":"2003.12298","arxiv_id_is_arxiv":true,"paper":"/paper/information-theoretic-probing-with-minimum","title":"Information-Theoretic Probing with Minimum Description Length","date":"2020-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lena-voita/description-length-probing","path":"control_tasks/control_tasks/probe.py","file_url":"https://github.com/lena-voita/description-length-probing/blob/HEAD/control_tasks/control_tasks/probe.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lena-voita/description-length-probing when it was checked","code_sha256":"f5f58450c18992a1","code_sha256_prefix":"f5f58450c18992a1","mcp_get_code":{"code_sha256":"f5f58450c18992a1"}}],"record_sha256":"d10186613a1bf04566993b28992b57dc1e4f7b0492735bdf6770ad04d7e453b7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}