{"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/set-logging","entry":"set_logging","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":3,"ran_fixture":0,"ran":1,"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":"2510.17633","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-17633","title":"SARSteer: Safeguarding Large Audio-Language Models via Safe-Ablated Refusal Steering","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"linweiii/SARSteer","path":"utils/utils.py","file_url":"https://github.com/linweiii/SARSteer/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1a9f7ea3f01093ea","code_sha256_prefix":"1a9f7ea3f01093ea","mcp_get_code":{"code_sha256":"1a9f7ea3f01093ea"}},{"arxiv_id":"2403.07369","arxiv_id_is_arxiv":true,"paper":"/paper/textual-knowledge-matters-cross-modality-co","title":"Textual Knowledge Matters: Cross-Modality Co-Teaching for Generalized Visual Class Discovery","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haiyangzheng/textgcd","path":"utils/general_utils.py","file_url":"https://github.com/haiyangzheng/textgcd/blob/HEAD/utils/general_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, haiyangzheng/textgcd when it was checked","code_sha256":"b14783f90aebfa6a","code_sha256_prefix":"b14783f90aebfa6a","mcp_get_code":{"code_sha256":"b14783f90aebfa6a"}},{"arxiv_id":"2311.07387","arxiv_id_is_arxiv":true,"paper":"/paper/assessing-logical-puzzle-solving-in-large","title":"Assessing Logical Puzzle Solving in Large Language Models: Insights from a Minesweeper Case Study","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yinghao-li/minesweeper-for-llm","path":"src/io.py","file_url":"https://github.com/yinghao-li/minesweeper-for-llm/blob/HEAD/src/io.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ba9f44b7102f7983","code_sha256_prefix":"ba9f44b7102f7983","mcp_get_code":{"code_sha256":"ba9f44b7102f7983"}},{"arxiv_id":"2211.03003","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-annotate-part-segmentation-with-1","title":"Learning to Annotate Part Segmentation with Gradient Matching","date":"2022-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyu12/lagm","path":"downstream_seg.py","file_url":"https://github.com/yangyu12/lagm/blob/HEAD/downstream_seg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"63df326991f2f738","code_sha256_prefix":"63df326991f2f738","mcp_get_code":{"code_sha256":"63df326991f2f738"}},{"arxiv_id":"2211.02744","arxiv_id_is_arxiv":true,"paper":"/paper/kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibpa/kglm","path":"src/utils/logging.py","file_url":"https://github.com/ibpa/kglm/blob/HEAD/src/utils/logging.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":"23a2b85946f4ccc3","code_sha256_prefix":"23a2b85946f4ccc3","mcp_get_code":{"code_sha256":"23a2b85946f4ccc3"}},{"arxiv_id":"2024.naacl-long.4","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.naacl-long.4","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Yinghao-Li/Minesweeper-for-LLM","path":"src/io.py","file_url":"https://github.com/Yinghao-Li/Minesweeper-for-LLM/blob/HEAD/src/io.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ba9f44b7102f7983","code_sha256_prefix":"ba9f44b7102f7983","mcp_get_code":{"code_sha256":"ba9f44b7102f7983"}}],"record_sha256":"86ffb7763dd09c38f95b9807847492085c8c62c87f1209ed04c6b84e5c3bc4c4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}