{"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/get-module-names","entry":"get_module_names","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":6,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":5,"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":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":4,"ran_fixture":0,"ran":1,"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":"2603.07523","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07523","title":"Breaking the Scale Barrier: One-Shot Knowledge Transfer via Frequency Transform","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"LUcy0505/FRONT","path":"front_init_deit.py","file_url":"https://github.com/LUcy0505/FRONT/blob/HEAD/front_init_deit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LUcy0505/FRONT when it was checked","code_sha256":"75d4b91b83b49d54","code_sha256_prefix":"75d4b91b83b49d54","mcp_get_code":{"code_sha256":"75d4b91b83b49d54"}},{"arxiv_id":"2411.09688","arxiv_id_is_arxiv":true,"paper":"/paper/squeezed-attention-accelerating-long-context","title":"Squeezed Attention: Accelerating Long Context Length LLM Inference","date":"2024-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SqueezeAILab/SqueezedAttention","path":"utils/model_parse.py","file_url":"https://github.com/SqueezeAILab/SqueezedAttention/blob/HEAD/utils/model_parse.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, SqueezeAILab/SqueezedAttention when it was checked","code_sha256":"b65e0b634a94c717","code_sha256_prefix":"b65e0b634a94c717","mcp_get_code":{"code_sha256":"b65e0b634a94c717"}},{"arxiv_id":"2312.03140","arxiv_id_is_arxiv":true,"paper":"/paper/flexmodel-a-framework-for-interpretability-of","title":"FlexModel: A Framework for Interpretability of Distributed Large Language Models","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VectorInstitute/flex_model","path":"demos/induction_heads_multigpu.py","file_url":"https://github.com/VectorInstitute/flex_model/blob/HEAD/demos/induction_heads_multigpu.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":"5fd7f383d759e3c4","code_sha256_prefix":"5fd7f383d759e3c4","mcp_get_code":{"code_sha256":"5fd7f383d759e3c4"}},{"arxiv_id":"2307.09288","arxiv_id_is_arxiv":true,"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"squeezeailab/squeezellm","path":"squeezellm/model_parse.py","file_url":"https://github.com/squeezeailab/squeezellm/blob/HEAD/squeezellm/model_parse.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 SqueezeAILab/SqueezedAttention, and GitHub detected no licence in that repository when it was checked","code_sha256":"b65e0b634a94c717","code_sha256_prefix":"b65e0b634a94c717","mcp_get_code":{"code_sha256":"b65e0b634a94c717"}},{"arxiv_id":"2211.01201","arxiv_id_is_arxiv":true,"paper":"/paper/human-alignment-of-neural-network","title":"Human alignment of neural network representations","date":"2022-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LukasMut/human_alignment","path":"main_model_triplet_eval.py","file_url":"https://github.com/LukasMut/human_alignment/blob/HEAD/main_model_triplet_eval.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":"bb17bfdc5d3daf61","code_sha256_prefix":"bb17bfdc5d3daf61","mcp_get_code":{"code_sha256":"bb17bfdc5d3daf61"}},{"arxiv_id":"136760331","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136760331 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"chang9711/BIPS","path":"ECCV2022/residual_network.py","file_url":"https://github.com/chang9711/BIPS/blob/HEAD/ECCV2022/residual_network.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":"5b6d637501f1e2d9","code_sha256_prefix":"5b6d637501f1e2d9","mcp_get_code":{"code_sha256":"5b6d637501f1e2d9"}}],"record_sha256":"d2abb33b1d1c96bb625c0ef44e46bed84ac706ec0569deb21b3ccad05f1f9f08","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}