{"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/recursive-getattr","entry":"recursive_getattr","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":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"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":"2603.01376","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01376","title":"3BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"mazumder-lab/3BASiL","path":"models/lora_utils.py","file_url":"https://github.com/mazumder-lab/3BASiL/blob/HEAD/models/lora_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52c33281ab55761a","code_sha256_prefix":"52c33281ab55761a","mcp_get_code":{"code_sha256":"52c33281ab55761a"}},{"arxiv_id":"2510.24061","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-24061","title":"FALQON: Accelerating LoRA Fine-tuning with Low-Bit Floating-Point Arithmetic","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"iamkanghyunchoi/falqon","path":"lm-evaluation-harness/lm_eval/models/huggingface_falqon.py","file_url":"https://github.com/iamkanghyunchoi/falqon/blob/HEAD/lm-evaluation-harness/lm_eval/models/huggingface_falqon.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":"f1f5513508755a29","code_sha256_prefix":"f1f5513508755a29","mcp_get_code":{"code_sha256":"f1f5513508755a29"}},{"arxiv_id":"2504.06231","arxiv_id_is_arxiv":true,"paper":"/paper/orb-v3-atomistic-simulation-at-scale","title":"Orb-v3: atomistic simulation at scale","date":null,"month_inferred_from_arxiv_id":"2025-04","title_source":"archive","repo":"orbital-materials/orb-models","path":"orb_models/common/dataset/property_definitions.py","file_url":"https://github.com/orbital-materials/orb-models/blob/HEAD/orb_models/common/dataset/property_definitions.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":"194c0dace6847212","code_sha256_prefix":"194c0dace6847212","mcp_get_code":{"code_sha256":"194c0dace6847212"}},{"arxiv_id":"2404.11534","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-and-editing-predictions-by","title":"Decomposing and Editing Predictions by Modeling Model Computation","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"madrylab/modelcomponents","path":"coar/src/models/mini_resnet.py","file_url":"https://github.com/madrylab/modelcomponents/blob/HEAD/coar/src/models/mini_resnet.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":"95e672abb8e098da","code_sha256_prefix":"95e672abb8e098da","mcp_get_code":{"code_sha256":"95e672abb8e098da"}},{"arxiv_id":"2404.05621","arxiv_id_is_arxiv":true,"paper":"/paper/multiflow-shifting-towards-task-agnostic","title":"MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FarinaMatteo/multiflow","path":"pruners/multiflow.py","file_url":"https://github.com/FarinaMatteo/multiflow/blob/HEAD/pruners/multiflow.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, FarinaMatteo/multiflow when it was checked","code_sha256":"b12707e343eb192f","code_sha256_prefix":"b12707e343eb192f","mcp_get_code":{"code_sha256":"b12707e343eb192f"}},{"arxiv_id":"2211.02247","arxiv_id_is_arxiv":true,"paper":"/paper/music-mixing-style-transfer-a-contrastive","title":"Music Mixing Style Transfer: A Contrastive Learning Approach to Disentangle Audio Effects","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhtonykoo/music_mixing_style_transfer","path":"mixing_style_transfer/mixing_manipulator/common_miscellaneous.py","file_url":"https://github.com/jhtonykoo/music_mixing_style_transfer/blob/HEAD/mixing_style_transfer/mixing_manipulator/common_miscellaneous.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97b236cd195f653f","code_sha256_prefix":"97b236cd195f653f","mcp_get_code":{"code_sha256":"97b236cd195f653f"}},{"arxiv_id":"2208.11428","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-music-mixing-with-deep-learning-and","title":"Automatic music mixing with deep learning and out-of-domain data","date":"2022-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sony/fxnorm-automix","path":"automix/common_miscellaneous.py","file_url":"https://github.com/sony/fxnorm-automix/blob/HEAD/automix/common_miscellaneous.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97b236cd195f653f","code_sha256_prefix":"97b236cd195f653f","mcp_get_code":{"code_sha256":"97b236cd195f653f"}},{"arxiv_id":"2109.08925","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-the-combinatorial","title":"Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphs","date":"2021-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/efo-1-qa-benchmark","path":"validation.py","file_url":"https://github.com/hkust-knowcomp/efo-1-qa-benchmark/blob/HEAD/validation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ee25729d2bff9f9","code_sha256_prefix":"3ee25729d2bff9f9","mcp_get_code":{"code_sha256":"3ee25729d2bff9f9"}}],"record_sha256":"2494f13054d0b466006cf181069be4b0048c998fe12bbf46461264eb237ff7d5","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}