{"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/probe","entry":"Probe","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":5,"n_papers_ran":4,"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_fingerprinted":1,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"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","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,"code_sha256_prefix":"e28a1152efcc1dac","mcp_get_code":{"code_sha256":"e28a1152efcc1dac"}},{"arxiv_id":"2109.09234","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,"code_sha256_prefix":"30e38ea2ab97d520","mcp_get_code":{"code_sha256":"30e38ea2ab97d520"}},{"arxiv_id":"2104.03869","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,"code_sha256_prefix":"9df3a1ce2f824692","mcp_get_code":{"code_sha256":"9df3a1ce2f824692"}},{"arxiv_id":"2005.04511","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,"code_sha256_prefix":"531c09dd4b6edea7","mcp_get_code":{"code_sha256":"531c09dd4b6edea7"}},{"arxiv_id":"2003.12298","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,"code_sha256_prefix":"f5f58450c18992a1","mcp_get_code":{"code_sha256":"f5f58450c18992a1"}}]}