{"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/getattr-recursive","entry":"getattr_recursive","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":7,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":2,"unverified":0},"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":"2607.19317","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-19317","title":"Circuit Discovery, Evaluation, and Application Toolkit for Mechanistic Interpretability","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Lexsi-Labs/CircuitKIT","path":"src/circuitkit/applications/arch_utils.py","file_url":"https://github.com/Lexsi-Labs/CircuitKIT/blob/HEAD/src/circuitkit/applications/arch_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Lexsi-Labs/CircuitKIT (NOASSERTION)","code_sha256":"9fc7b1c51adfb37d","code_sha256_prefix":"9fc7b1c51adfb37d","mcp_get_code":{"code_sha256":"9fc7b1c51adfb37d"}},{"arxiv_id":"2503.02597","arxiv_id_is_arxiv":true,"paper":"/paper/seeing-is-understanding-unlocking-causal","title":"Seeing is Understanding: Unlocking Causal Attention into Modality-Mutual Attention for Multimodal LLMs","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sony/aki","path":"codes/open_flamingo/src/modeling_aki.py","file_url":"https://github.com/sony/aki/blob/HEAD/codes/open_flamingo/src/modeling_aki.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sony/aki (NOASSERTION)","code_sha256":"fe68fff801021b23","code_sha256_prefix":"fe68fff801021b23","mcp_get_code":{"code_sha256":"fe68fff801021b23"}},{"arxiv_id":"2408.11051","arxiv_id_is_arxiv":true,"paper":"/paper/flame-learning-to-navigate-with-multimodal","title":"FLAME: Learning to Navigate with Multimodal LLM in Urban Environments","date":"2024-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xyz9911/FLAME","path":"llm_nav/model/modeling_flamingo.py","file_url":"https://github.com/xyz9911/FLAME/blob/HEAD/llm_nav/model/modeling_flamingo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from sony/aki, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"fe68fff801021b23","code_sha256_prefix":"fe68fff801021b23","mcp_get_code":{"code_sha256":"fe68fff801021b23"}},{"arxiv_id":"2408.05926","arxiv_id_is_arxiv":true,"paper":"/paper/bi-mdrg-bridging-image-history-in-multimodal","title":"BI-MDRG: Bridging Image History in Multimodal Dialogue Response Generation","date":"2024-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hee-suk-yoon/BI-MDRG","path":"open_flamingo-main/open_flamingo/src/utils.py","file_url":"https://github.com/hee-suk-yoon/BI-MDRG/blob/HEAD/open_flamingo-main/open_flamingo/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from sony/aki, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"fe68fff801021b23","code_sha256_prefix":"fe68fff801021b23","mcp_get_code":{"code_sha256":"fe68fff801021b23"}},{"arxiv_id":"2403.17064","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-subject-specific-attribute-control","title":"Continuous, Subject-Specific Attribute Control in T2I Models by Identifying Semantic Directions","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"compvis/attribute-control","path":"attribute_control/utils.py","file_url":"https://github.com/compvis/attribute-control/blob/HEAD/attribute_control/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":"ea59d5891e818a8c","code_sha256_prefix":"ea59d5891e818a8c","mcp_get_code":{"code_sha256":"ea59d5891e818a8c"}},{"arxiv_id":"2310.00647","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-task-performance-evaluating-and","title":"Beyond Task Performance: Evaluating and Reducing the Flaws of Large Multimodal Models with In-Context Learning","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mshukor/EvALign-ICL","path":"open_flamingo/src/utils.py","file_url":"https://github.com/mshukor/EvALign-ICL/blob/HEAD/open_flamingo/src/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, mshukor/EvALign-ICL when it was checked","code_sha256":"fe68fff801021b23","code_sha256_prefix":"fe68fff801021b23","mcp_get_code":{"code_sha256":"fe68fff801021b23"}},{"arxiv_id":"2308.02463","arxiv_id_is_arxiv":true,"paper":"/paper/towards-generalist-foundation-model-for","title":"Towards Generalist Foundation Model for Radiology by Leveraging Web-scale 2D&3D Medical Data","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaoyi-wu/radfm","path":"Quick_demo/Model/RadFM/utils.py","file_url":"https://github.com/chaoyi-wu/radfm/blob/HEAD/Quick_demo/Model/RadFM/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from sony/aki, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"fe68fff801021b23","code_sha256_prefix":"fe68fff801021b23","mcp_get_code":{"code_sha256":"fe68fff801021b23"}},{"arxiv_id":"2003.02609","arxiv_id_is_arxiv":true,"paper":"/paper/uav-coverage-path-planning-under-varying","title":"UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2020-03","title_source":"archive","repo":"theilem/uavSim","path":"utils.py","file_url":"https://github.com/theilem/uavSim/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4909cfbe907bd79","code_sha256_prefix":"b4909cfbe907bd79","mcp_get_code":{"code_sha256":"b4909cfbe907bd79"}},{"arxiv_id":"2003.02609","arxiv_id_is_arxiv":true,"paper":"/paper/uav-coverage-path-planning-under-varying","title":"UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2020-03","title_source":"archive","repo":"XGX-CURRY/uavSim","path":"utils.py","file_url":"https://github.com/XGX-CURRY/uavSim/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e4b9c8f2263b5b24","code_sha256_prefix":"e4b9c8f2263b5b24","mcp_get_code":{"code_sha256":"e4b9c8f2263b5b24"}}],"record_sha256":"cb6ad85439002a7b2d8c741f21ebe2fb2e0fd4371beb814741391a61633705a2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}