{"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/instancenorm","entry":"InstanceNorm","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":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":6,"n_samples_ran":5,"n_samples_constructed":4,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":4,"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":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.04430","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-04430","title":"Flowers: A Warp Drive for Neural PDE Solvers","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"t-muser/flowers","path":"flowers/models/flower.py","file_url":"https://github.com/t-muser/flowers/blob/HEAD/flowers/models/flower.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, t-muser/flowers (NOASSERTION)","code_sha256":"118556b23415993a","code_sha256_prefix":"118556b23415993a","mcp_get_code":{"code_sha256":"118556b23415993a"}},{"arxiv_id":"2602.11550","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11550","title":"TS-Memory: Plug-and-Play Memory for Time Series Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"sisuolv/TS-Memory","path":"src/models/memory_ts_quantile.py","file_url":"https://github.com/sisuolv/TS-Memory/blob/HEAD/src/models/memory_ts_quantile.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":"6a8cf45ffffc94c9","code_sha256_prefix":"6a8cf45ffffc94c9","mcp_get_code":{"code_sha256":"6a8cf45ffffc94c9"}},{"arxiv_id":"2405.02795","arxiv_id_is_arxiv":true,"paper":"/paper/graph-as-point-set","title":"Graph as Point Set","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GraphPKU/GraphAsSet","path":"PST.py","file_url":"https://github.com/GraphPKU/GraphAsSet/blob/HEAD/PST.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, GraphPKU/GraphAsSet when it was checked","code_sha256":"e4a9148d065dfe3f","code_sha256_prefix":"e4a9148d065dfe3f","mcp_get_code":{"code_sha256":"e4a9148d065dfe3f"}},{"arxiv_id":"2110.02905","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-and-physical-quantities-improve-e-3","title":"Geometric and Physical Quantities Improve E(3) Equivariant Message Passing","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robdhess/steerable-e3-gnn","path":"models/segnn/segnn.py","file_url":"https://github.com/robdhess/steerable-e3-gnn/blob/HEAD/models/segnn/segnn.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":"1171171b62e0ac43","code_sha256_prefix":"1171171b62e0ac43","mcp_get_code":{"code_sha256":"1171171b62e0ac43"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ialhashim/StyleGAN-Tensorflow2","path":"stylegan.py","file_url":"https://github.com/ialhashim/StyleGAN-Tensorflow2/blob/HEAD/stylegan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ialhashim/StyleGAN-Tensorflow2, is not in the permissive set Syntology serves inline","code_sha256":"c674eeff49365829","code_sha256_prefix":"c674eeff49365829","mcp_get_code":{"code_sha256":"c674eeff49365829"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AyushAniket/ResNET-and-various-normalizations","path":"train_cifar.py","file_url":"https://github.com/AyushAniket/ResNET-and-various-normalizations/blob/HEAD/train_cifar.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, AyushAniket/ResNET-and-various-normalizations when it was checked","code_sha256":"a924a32db84a4d40","code_sha256_prefix":"a924a32db84a4d40","mcp_get_code":{"code_sha256":"a924a32db84a4d40"}}],"record_sha256":"9b2fe21fd56f023845b4526ee6589ed6dd425722266a78533bf202e4d03c14c5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}