{"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/identitylayer","entry":"IdentityLayer","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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":8,"n_samples_ran":5,"n_samples_constructed":2,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":5,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":3},"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":"2410.10733","arxiv_id_is_arxiv":true,"paper":"/paper/deep-compression-autoencoder-for-efficient","title":"Deep Compression Autoencoder for Efficient High-Resolution Diffusion Models","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/efficientvit","path":"efficientvit/models/efficientvit/dc_ae.py","file_url":"https://github.com/mit-han-lab/efficientvit/blob/HEAD/efficientvit/models/efficientvit/dc_ae.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7d8080781cf3019c","code_sha256_prefix":"7d8080781cf3019c","mcp_get_code":{"code_sha256":"7d8080781cf3019c"}},{"arxiv_id":"2401.10474","arxiv_id_is_arxiv":true,"paper":"/paper/ldreg-local-dimensionality-regularized-self","title":"LDReg: Local Dimensionality Regularized Self-Supervised Learning","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoJoNing25/DDAug","path":"losses/ntxent_lidaug.py","file_url":"https://github.com/JoJoNing25/DDAug/blob/HEAD/losses/ntxent_lidaug.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dcb240bf1416737e","code_sha256_prefix":"dcb240bf1416737e","mcp_get_code":{"code_sha256":"dcb240bf1416737e"}},{"arxiv_id":"2206.00888","arxiv_id_is_arxiv":true,"paper":"/paper/squeezeformer-an-efficient-transformer-for","title":"Squeezeformer: An Efficient Transformer for Automatic Speech Recognition","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kssteven418/squeezeformer","path":"src/models/conformer_encoder.py","file_url":"https://github.com/kssteven418/squeezeformer/blob/HEAD/src/models/conformer_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d0d22b07f8f313e","code_sha256_prefix":"4d0d22b07f8f313e","mcp_get_code":{"code_sha256":"4d0d22b07f8f313e"}},{"arxiv_id":"2111.09098","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-heterogenous-electronic-health-1","title":"Unifying Heterogeneous Electronic Health Records Systems via Text-Based Code Embedding","date":"2021-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hoon9405/DescEmb","path":"models/descemb.py","file_url":"https://github.com/hoon9405/DescEmb/blob/HEAD/models/descemb.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d5bb2d6de37b3e23","code_sha256_prefix":"d5bb2d6de37b3e23","mcp_get_code":{"code_sha256":"d5bb2d6de37b3e23"}},{"arxiv_id":"2102.07954","arxiv_id_is_arxiv":true,"paper":"/paper/alphanet-improved-training-of-supernet-with","title":"AlphaNet: Improved Training of Supernets with Alpha-Divergence","date":"2021-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/AttentiveNAS","path":"models/attentive_nas_dynamic_model.py","file_url":"https://github.com/facebookresearch/AttentiveNAS/blob/HEAD/models/attentive_nas_dynamic_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/AttentiveNAS (NOASSERTION)","code_sha256":"0257146dc3978be2","code_sha256_prefix":"0257146dc3978be2","mcp_get_code":{"code_sha256":"0257146dc3978be2"}},{"arxiv_id":"2101.11986","arxiv_id_is_arxiv":true,"paper":"/paper/tokens-to-token-vit-training-vision","title":"Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNet","date":"2021-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"conceptofmind/Token-to-Token-ViT-flax","path":"t2t.py","file_url":"https://github.com/conceptofmind/Token-to-Token-ViT-flax/blob/HEAD/t2t.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":"e38ae21b52d727dd","code_sha256_prefix":"e38ae21b52d727dd","mcp_get_code":{"code_sha256":"e38ae21b52d727dd"}},{"arxiv_id":"2010.11929","arxiv_id_is_arxiv":true,"paper":"/paper/an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"conceptofmind/ViT-haiku","path":"vit.py","file_url":"https://github.com/conceptofmind/ViT-haiku/blob/HEAD/vit.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":"8006254bdcb47e21","code_sha256_prefix":"8006254bdcb47e21","mcp_get_code":{"code_sha256":"8006254bdcb47e21"}},{"arxiv_id":"2010.11929","arxiv_id_is_arxiv":true,"paper":"/paper/an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/vision_transformer","path":"vit_jax/models_vit.py","file_url":"https://github.com/google-research/vision_transformer/blob/HEAD/vit_jax/models_vit.py","status":"unverified","verification_level":0,"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":"145a84ea745a049d","code_sha256_prefix":"145a84ea745a049d","mcp_get_code":{"code_sha256":"145a84ea745a049d"}}],"record_sha256":"9b08f04cea679cd968848d1aed6625e2477c9916f79afff69fc8dfd9e6adf741","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}