{"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/silu-2","entry":"SiLU","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":8,"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":9,"n_samples_ran":9,"n_samples_constructed":2,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":8,"n_places":9,"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":0,"ran":9,"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":"2602.16198","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16198","title":"Training-Free Adaptation of Diffusion Models via Doob's h-Transform","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"liamyzq/Doob_training_free_adaptation","path":"search/doob_search.py","file_url":"https://github.com/liamyzq/Doob_training_free_adaptation/blob/HEAD/search/doob_search.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liamyzq/Doob_training_free_adaptation when it was checked","code_sha256":"bf39bc92e363e115","code_sha256_prefix":"bf39bc92e363e115","mcp_get_code":{"code_sha256":"bf39bc92e363e115"}},{"arxiv_id":"2601.22631","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22631","title":"A Multivariate Parameter-Efficient Fine-Tuning Framework for Few-shot Remaining Useful Life Prediction based on Cross-domain Time Series Representation Model","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"fuen1590/PEFT-MuTS","path":"models/peft_muts.py","file_url":"https://github.com/fuen1590/PEFT-MuTS/blob/HEAD/models/peft_muts.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fuen1590/PEFT-MuTS when it was checked","code_sha256":"a3d089fd48ef0b7b","code_sha256_prefix":"a3d089fd48ef0b7b","mcp_get_code":{"code_sha256":"a3d089fd48ef0b7b"}},{"arxiv_id":"2310.15587","arxiv_id_is_arxiv":true,"paper":"/paper/scandl-a-diffusion-model-for-generating","title":"ScanDL: A Diffusion Model for Generating Synthetic Scanpaths on Texts","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DiLi-Lab/ScanDL","path":"scandl/sp_transformer_model.py","file_url":"https://github.com/DiLi-Lab/ScanDL/blob/HEAD/scandl/sp_transformer_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DiLi-Lab/ScanDL when it was checked","code_sha256":"f378e3c2e0e7259f","code_sha256_prefix":"f378e3c2e0e7259f","mcp_get_code":{"code_sha256":"f378e3c2e0e7259f"}},{"arxiv_id":"2305.15399","arxiv_id_is_arxiv":true,"paper":"/paper/sin3dm-learning-a-diffusion-model-from-a","title":"Sin3DM: Learning a Diffusion Model from a Single 3D Textured Shape","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sin3dm/sin3dm","path":"src/diffusion/unet_triplane.py","file_url":"https://github.com/sin3dm/sin3dm/blob/HEAD/src/diffusion/unet_triplane.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5465fa33e2f8631e","code_sha256_prefix":"5465fa33e2f8631e","mcp_get_code":{"code_sha256":"5465fa33e2f8631e"}},{"arxiv_id":"2303.17189","arxiv_id_is_arxiv":true,"paper":"/paper/layoutdiffusion-controllable-diffusion-model","title":"LayoutDiffusion: Controllable Diffusion Model for Layout-to-image Generation","date":"2023-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zgctroy/layoutdiffusion","path":"layout_diffusion/layout_diffusion_unet.py","file_url":"https://github.com/zgctroy/layoutdiffusion/blob/HEAD/layout_diffusion/layout_diffusion_unet.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":"52fcaa6065df3ee1","code_sha256_prefix":"52fcaa6065df3ee1","mcp_get_code":{"code_sha256":"52fcaa6065df3ee1"}},{"arxiv_id":"2105.05233","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-beat-gans-on-image-synthesis","title":"Diffusion Models Beat GANs on Image Synthesis","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Janspiry/Palette-Image-to-Image-Diffusion-Models","path":"models/guided_diffusion_modules/unet.py","file_url":"https://github.com/Janspiry/Palette-Image-to-Image-Diffusion-Models/blob/HEAD/models/guided_diffusion_modules/unet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1da15c720fdd1b92","code_sha256_prefix":"1da15c720fdd1b92","mcp_get_code":{"code_sha256":"1da15c720fdd1b92"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/rexnet","path":"rexnetv1.py","file_url":"https://github.com/clovaai/rexnet/blob/HEAD/rexnetv1.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":"042c12e604840fe5","code_sha256_prefix":"042c12e604840fe5","mcp_get_code":{"code_sha256":"042c12e604840fe5"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/pycls","path":"pycls/models/effnet.py","file_url":"https://github.com/facebookresearch/pycls/blob/HEAD/pycls/models/effnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec1871ecab27eb74","code_sha256_prefix":"ec1871ecab27eb74","mcp_get_code":{"code_sha256":"ec1871ecab27eb74"}},{"arxiv_id":"1611.05431","arxiv_id_is_arxiv":true,"paper":"/paper/aggregated-residual-transformations-for-deep","title":"Aggregated Residual Transformations for Deep Neural Networks","date":"2016-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/pycls","path":"pycls/models/anynet.py","file_url":"https://github.com/facebookresearch/pycls/blob/HEAD/pycls/models/anynet.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":"6d6a7258c7deca90","code_sha256_prefix":"6d6a7258c7deca90","mcp_get_code":{"code_sha256":"6d6a7258c7deca90"}}],"record_sha256":"ea91cb7b30b985eb67f6c6a4bc41daf58df601f9212481e5ef0a0d462d7bc672","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}