{"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/norm-layer","entry":"norm_layer","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":17,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":12,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":8,"n_places_pointer_only_link_open":4,"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":2,"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":"2505.17412","arxiv_id_is_arxiv":true,"paper":"/paper/direct3d-s2-gigascale-3d-generation-made-easy","title":"Direct3D-S2: Gigascale 3D Generation Made Easy with Spatial Sparse Attention","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DreamTechAI/Direct3D-S2","path":"direct3d_s2/models/autoencoders/dense_vae.py","file_url":"https://github.com/DreamTechAI/Direct3D-S2/blob/HEAD/direct3d_s2/models/autoencoders/dense_vae.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":"6818f26f5c2a59a4","code_sha256_prefix":"6818f26f5c2a59a4","mcp_get_code":{"code_sha256":"6818f26f5c2a59a4"}},{"arxiv_id":"2412.01506","arxiv_id_is_arxiv":true,"paper":"/paper/structured-3d-latents-for-scalable-and","title":"Structured 3D Latents for Scalable and Versatile 3D Generation","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/TRELLIS","path":"trellis/models/sparse_structure_vae.py","file_url":"https://github.com/Microsoft/TRELLIS/blob/HEAD/trellis/models/sparse_structure_vae.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":"6818f26f5c2a59a4","code_sha256_prefix":"6818f26f5c2a59a4","mcp_get_code":{"code_sha256":"6818f26f5c2a59a4"}},{"arxiv_id":"2409.14538","arxiv_id_is_arxiv":true,"paper":"/paper/towards-model-agnostic-dataset-condensation","title":"Towards Model-Agnostic Dataset Condensation by Heterogeneous Models","date":"2024-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KHU-AGI/HMDC","path":"gcn_lib/torch_nn.py","file_url":"https://github.com/KHU-AGI/HMDC/blob/HEAD/gcn_lib/torch_nn.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, KHU-AGI/HMDC when it was checked","code_sha256":"09e6ddb17c0adf28","code_sha256_prefix":"09e6ddb17c0adf28","mcp_get_code":{"code_sha256":"09e6ddb17c0adf28"}},{"arxiv_id":"2407.12538","arxiv_id_is_arxiv":true,"paper":"/paper/high-frequency-matters-uncertainty-guided","title":"High Frequency Matters: Uncertainty Guided Image Compression with Wavelet Diffusion","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hejiaxiang1/wavelet-diffusion","path":"diffusion/ddpm.py","file_url":"https://github.com/hejiaxiang1/wavelet-diffusion/blob/HEAD/diffusion/ddpm.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, hejiaxiang1/wavelet-diffusion when it was checked","code_sha256":"cc5995af43962fc0","code_sha256_prefix":"cc5995af43962fc0","mcp_get_code":{"code_sha256":"cc5995af43962fc0"}},{"arxiv_id":"2405.17022","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-few-shot-class-incremental","title":"Compositional Few-Shot Class-Incremental Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zoilsen/comp-fscil","path":"models/resnet12.py","file_url":"https://github.com/zoilsen/comp-fscil/blob/HEAD/models/resnet12.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":"f36ac42575cd46ee","code_sha256_prefix":"f36ac42575cd46ee","mcp_get_code":{"code_sha256":"f36ac42575cd46ee"}},{"arxiv_id":"2312.00276","arxiv_id_is_arxiv":true,"paper":"/paper/automating-continual-learning","title":"Automating Continual Learning","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idsia/automated-cl","path":"utils_other/resnet_impl.py","file_url":"https://github.com/idsia/automated-cl/blob/HEAD/utils_other/resnet_impl.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":"319332ad3d5e39b1","code_sha256_prefix":"319332ad3d5e39b1","mcp_get_code":{"code_sha256":"319332ad3d5e39b1"}},{"arxiv_id":"2304.04269","arxiv_id_is_arxiv":true,"paper":"/paper/humansd-a-native-skeleton-guided-diffusion","title":"HumanSD: A Native Skeleton-Guided Diffusion Model for Human Image Generation","date":"2023-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangchenyin/grpose","path":"gcn_lib/torch_nn.py","file_url":"https://github.com/xiangchenyin/grpose/blob/HEAD/gcn_lib/torch_nn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from gswycf/signgraph, and GitHub detected no licence in that repository when it was checked","code_sha256":"09e6ddb17c0adf28","code_sha256_prefix":"09e6ddb17c0adf28","mcp_get_code":{"code_sha256":"09e6ddb17c0adf28"}},{"arxiv_id":"2206.00272","arxiv_id_is_arxiv":true,"paper":"/paper/vision-gnn-an-image-is-worth-graph-of-nodes","title":"Vision GNN: An Image is Worth Graph of Nodes","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gswycf/signgraph","path":"modules/gcn_lib/torch_vertex.py","file_url":"https://github.com/gswycf/signgraph/blob/HEAD/modules/gcn_lib/torch_vertex.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, gswycf/signgraph when it was checked","code_sha256":"09e6ddb17c0adf28","code_sha256_prefix":"09e6ddb17c0adf28","mcp_get_code":{"code_sha256":"09e6ddb17c0adf28"}},{"arxiv_id":"2111.00064","arxiv_id_is_arxiv":true,"paper":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elichienxD/deep_gcns_torch","path":"gcn_lib/dense/torch_nn.py","file_url":"https://github.com/elichienxD/deep_gcns_torch/blob/HEAD/gcn_lib/dense/torch_nn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 gswycf/signgraph, and GitHub detected no licence in that repository when it was checked","code_sha256":"09e6ddb17c0adf28","code_sha256_prefix":"09e6ddb17c0adf28","mcp_get_code":{"code_sha256":"09e6ddb17c0adf28"}},{"arxiv_id":"2106.07476","arxiv_id_is_arxiv":true,"paper":"/paper/training-graph-neural-networks-with-1000","title":"Training Graph Neural Networks with 1000 Layers","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lightaime/deep_gcns_torch","path":"gcn_lib/dense/torch_nn.py","file_url":"https://github.com/lightaime/deep_gcns_torch/blob/HEAD/gcn_lib/dense/torch_nn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 gswycf/signgraph, and GitHub detected no licence in that repository when it was checked","code_sha256":"09e6ddb17c0adf28","code_sha256_prefix":"09e6ddb17c0adf28","mcp_get_code":{"code_sha256":"09e6ddb17c0adf28"}},{"arxiv_id":"2106.07476","arxiv_id_is_arxiv":true,"paper":"/paper/training-graph-neural-networks-with-1000","title":"Training Graph Neural Networks with 1000 Layers","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lightaime/deep_gcns_torch","path":"gcn_lib/sparse/torch_nn.py","file_url":"https://github.com/lightaime/deep_gcns_torch/blob/HEAD/gcn_lib/sparse/torch_nn.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":"34c1fc07af3538f8","code_sha256_prefix":"34c1fc07af3538f8","mcp_get_code":{"code_sha256":"34c1fc07af3538f8"}},{"arxiv_id":"2010.09891","arxiv_id_is_arxiv":true,"paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devnkong/FLAG","path":"deep_gcns_torch/gcn_lib/dense/torch_nn.py","file_url":"https://github.com/devnkong/FLAG/blob/HEAD/deep_gcns_torch/gcn_lib/dense/torch_nn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 gswycf/signgraph, and GitHub detected no licence in that repository when it was checked","code_sha256":"09e6ddb17c0adf28","code_sha256_prefix":"09e6ddb17c0adf28","mcp_get_code":{"code_sha256":"09e6ddb17c0adf28"}},{"arxiv_id":"2010.00763","arxiv_id_is_arxiv":true,"paper":"/paper/bongard-logo-a-new-benchmark-for-human-level","title":"Bongard-LOGO: A New Benchmark for Human-Level Concept Learning and Reasoning","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/Bongard-LOGO","path":"Bongard-LOGO_Baselines/models/resnet12.py","file_url":"https://github.com/NVlabs/Bongard-LOGO/blob/HEAD/Bongard-LOGO_Baselines/models/resnet12.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":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, NVlabs/Bongard-LOGO, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"f36ac42575cd46ee","code_sha256_prefix":"f36ac42575cd46ee","mcp_get_code":{"code_sha256":"f36ac42575cd46ee"}},{"arxiv_id":"2009.04960","arxiv_id_is_arxiv":true,"paper":"/paper/prototype-completion-with-primitive-knowledge","title":"Prototype Completion with Primitive Knowledge for Few-Shot Learning","date":"2020-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangbq-research/Prototype_Completion_for_FSL","path":"models/resnet12_2.py","file_url":"https://github.com/zhangbq-research/Prototype_Completion_for_FSL/blob/HEAD/models/resnet12_2.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":"f36ac42575cd46ee","code_sha256_prefix":"f36ac42575cd46ee","mcp_get_code":{"code_sha256":"f36ac42575cd46ee"}},{"arxiv_id":"2006.10704","arxiv_id_is_arxiv":true,"paper":"/paper/latent-video-transformer","title":"Latent Video Transformer","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rakhimovv/lvt","path":"vidgen/layers/wrappers.py","file_url":"https://github.com/rakhimovv/lvt/blob/HEAD/vidgen/layers/wrappers.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":"e50af06007f00579","code_sha256_prefix":"e50af06007f00579","mcp_get_code":{"code_sha256":"e50af06007f00579"}},{"arxiv_id":"2003.04390","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-meta-baseline-for-few-shot-learning","title":"Meta-Baseline: Exploring Simple Meta-Learning for Few-Shot Learning","date":"2020-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cyvius96/few-shot-meta-baseline","path":"meta-dataset/models/resnet12.py","file_url":"https://github.com/cyvius96/few-shot-meta-baseline/blob/HEAD/meta-dataset/models/resnet12.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":"f36ac42575cd46ee","code_sha256_prefix":"f36ac42575cd46ee","mcp_get_code":{"code_sha256":"f36ac42575cd46ee"}},{"arxiv_id":"aaai_28607","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28607","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"GuangmingZhu/SketchESC","path":"models/graph_model.py","file_url":"https://github.com/GuangmingZhu/SketchESC/blob/HEAD/models/graph_model.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":"0ac550c1cace9548","code_sha256_prefix":"0ac550c1cace9548","mcp_get_code":{"code_sha256":"0ac550c1cace9548"}},{"arxiv_id":"Li_Language-Driven_Anchors_for_Zero-Shot_Adversarial_Robustness_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_Language-Driven_Anchors_for_Zero-Shot_Adversarial_Robustness_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LixiaoTHU/LAAT","path":"models/resnet12.py","file_url":"https://github.com/LixiaoTHU/LAAT/blob/HEAD/models/resnet12.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":"f36ac42575cd46ee","code_sha256_prefix":"f36ac42575cd46ee","mcp_get_code":{"code_sha256":"f36ac42575cd46ee"}}],"record_sha256":"273087fdb6f8529ecaf2952c6d31950a0cb81db51340339c8d2ebf535e7c90ad","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}