{"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/attention-forward","entry":"attention_forward","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":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":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"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":0,"ran_fixture":2,"ran":1,"unverified":2},"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":"2411.13918","arxiv_id_is_arxiv":true,"paper":"/paper/quantization-without-tears","title":"Quantization without Tears","date":"2024-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujx2001/QwT","path":"QwT-cls-RepQ-ViT/utils/build_model.py","file_url":"https://github.com/wujx2001/QwT/blob/HEAD/QwT-cls-RepQ-ViT/utils/build_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"537453ba638574e2","code_sha256_prefix":"537453ba638574e2","mcp_get_code":{"code_sha256":"537453ba638574e2"}},{"arxiv_id":"2404.07470","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-language-model-with-generalized","title":"Scalable Language Model with Generalized Continual Learning","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pbihao/slm","path":"SLM-bert/models/bert.py","file_url":"https://github.com/pbihao/slm/blob/HEAD/SLM-bert/models/bert.py","status":"ran","verification_level":1,"contract_check":null,"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, pbihao/slm when it was checked","code_sha256":"5bd1a404bf01d36d","code_sha256_prefix":"5bd1a404bf01d36d","mcp_get_code":{"code_sha256":"5bd1a404bf01d36d"}},{"arxiv_id":"2307.14460","arxiv_id_is_arxiv":true,"paper":"/paper/midas-v3-1-a-model-zoo-for-robust-monocular","title":"MiDaS v3.1 -- A Model Zoo for Robust Monocular Relative Depth Estimation","date":"2023-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"cc0b35f6d7118df1","code_sha256_prefix":"cc0b35f6d7118df1","mcp_get_code":{"code_sha256":"cc0b35f6d7118df1"}},{"arxiv_id":"2209.05687","arxiv_id_is_arxiv":true,"paper":"/paper/psaq-vit-v2-towards-accurate-and-general-data","title":"PSAQ-ViT V2: Towards Accurate and General Data-Free Quantization for Vision Transformers","date":"2022-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zkkli/psaq-vit","path":"utils/build_model.py","file_url":"https://github.com/zkkli/psaq-vit/blob/HEAD/utils/build_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3bf709271b1e8d32","code_sha256_prefix":"3bf709271b1e8d32","mcp_get_code":{"code_sha256":"3bf709271b1e8d32"}},{"arxiv_id":"2103.13413","arxiv_id_is_arxiv":true,"paper":"/paper/vision-transformers-for-dense-prediction","title":"Vision Transformers for Dense Prediction","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"cc0b35f6d7118df1","code_sha256_prefix":"cc0b35f6d7118df1","mcp_get_code":{"code_sha256":"cc0b35f6d7118df1"}},{"arxiv_id":"1907.01341","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-monocular-depth-estimation","title":"Towards Robust Monocular Depth Estimation: Mixing Datasets for Zero-shot Cross-dataset Transfer","date":"2019-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isl-org/MiDaS","path":"midas/backbones/beit.py","file_url":"https://github.com/isl-org/MiDaS/blob/HEAD/midas/backbones/beit.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":"cc0b35f6d7118df1","code_sha256_prefix":"cc0b35f6d7118df1","mcp_get_code":{"code_sha256":"cc0b35f6d7118df1"}},{"arxiv_id":"Li_RepQ-ViT_Scale_Reparameterization_for_Post-Training_Quantization_of_Vision_Transformers_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_RepQ-ViT_Scale_Reparameterization_for_Post-Training_Quantization_of_Vision_Transformers_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zkkli/RepQ-ViT","path":"classification/utils/build_model.py","file_url":"https://github.com/zkkli/RepQ-ViT/blob/HEAD/classification/utils/build_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"537453ba638574e2","code_sha256_prefix":"537453ba638574e2","mcp_get_code":{"code_sha256":"537453ba638574e2"}},{"arxiv_id":"2025.naacl-long.237","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.naacl-long.237","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nbasyl/LLM-FP4","path":"utils/models.py","file_url":"https://github.com/nbasyl/LLM-FP4/blob/HEAD/utils/models.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":"abb7359aebf4ff5a","code_sha256_prefix":"abb7359aebf4ff5a","mcp_get_code":{"code_sha256":"abb7359aebf4ff5a"}}],"record_sha256":"195505dc27bcb513bad0464168558613d59d90ab8c53ed64d23256c9cec850ca","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}