{"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/batchnorm2d","entry":"BatchNorm2d","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":8,"n_samples_constructed":6,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":5,"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":8,"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":"2403.03077","arxiv_id_is_arxiv":true,"paper":"/paper/mikasa-multi-key-anchor-scene-aware","title":"MiKASA: Multi-Key-Anchor & Scene-Aware Transformer for 3D Visual Grounding","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dfki-av/mikasa-3dvg","path":"models/MiKASA_transformer.py","file_url":"https://github.com/dfki-av/mikasa-3dvg/blob/HEAD/models/MiKASA_transformer.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, dfki-av/mikasa-3dvg when it was checked","code_sha256":"c9ea4b32ab8ee01d","code_sha256_prefix":"c9ea4b32ab8ee01d","mcp_get_code":{"code_sha256":"c9ea4b32ab8ee01d"}},{"arxiv_id":"2307.16184","arxiv_id_is_arxiv":true,"paper":"/paper/unified-model-for-image-video-audio-and","title":"UnIVAL: Unified Model for Image, Video, Audio and Language Tasks","date":"2023-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mshukor/unival","path":"models/unival/unify_transformer.py","file_url":"https://github.com/mshukor/unival/blob/HEAD/models/unival/unify_transformer.py","status":"ran","verification_level":1,"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":"f18199d037514305","code_sha256_prefix":"f18199d037514305","mcp_get_code":{"code_sha256":"f18199d037514305"}},{"arxiv_id":"2306.02115","arxiv_id_is_arxiv":true,"paper":"/paper/table-and-image-generation-for-investigating","title":"Table and Image Generation for Investigating Knowledge of Entities in Pre-trained Vision and Language Models","date":"2023-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OFA-Sys/OFA","path":"models/ofa/unify_transformer.py","file_url":"https://github.com/OFA-Sys/OFA/blob/HEAD/models/ofa/unify_transformer.py","status":"ran","verification_level":1,"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":"f18199d037514305","code_sha256_prefix":"f18199d037514305","mcp_get_code":{"code_sha256":"f18199d037514305"}},{"arxiv_id":"2302.07387","arxiv_id_is_arxiv":true,"paper":"/paper/polyformer-referring-image-segmentation-as","title":"PolyFormer: Referring Image Segmentation as Sequential Polygon Generation","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/polygon-transformer","path":"models/polyformer/unify_transformer.py","file_url":"https://github.com/amazon-science/polygon-transformer/blob/HEAD/models/polyformer/unify_transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, amazon-science/polygon-transformer, 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":"f18199d037514305","code_sha256_prefix":"f18199d037514305","mcp_get_code":{"code_sha256":"f18199d037514305"}},{"arxiv_id":"2210.04458","arxiv_id_is_arxiv":true,"paper":"/paper/ogc-unsupervised-3d-object-segmentation-from","title":"OGC: Unsupervised 3D Object Segmentation from Rigid Dynamics of Point Clouds","date":"2022-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlar-group/ogc","path":"models/segnet_ogcdr.py","file_url":"https://github.com/vlar-group/ogc/blob/HEAD/models/segnet_ogcdr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","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, vlar-group/ogc (NOASSERTION)","code_sha256":"ea90589983c7d4fb","code_sha256_prefix":"ea90589983c7d4fb","mcp_get_code":{"code_sha256":"ea90589983c7d4fb"}},{"arxiv_id":"2006.05467","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-neural-networks-without-any-data-by","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iurada/px-ntk-pruning","path":"lib/pruners.py","file_url":"https://github.com/iurada/px-ntk-pruning/blob/HEAD/lib/pruners.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, iurada/px-ntk-pruning when it was checked","code_sha256":"bd2e9ef9ef047b34","code_sha256_prefix":"bd2e9ef9ef047b34","mcp_get_code":{"code_sha256":"bd2e9ef9ef047b34"}},{"arxiv_id":"1911.09070","arxiv_id_is_arxiv":true,"paper":"/paper/efficientdet-scalable-and-efficient-object","title":"EfficientDet: Scalable and Efficient Object Detection","date":"2019-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SharifElfouly/easy-model-zoo","path":"easy_model_zoo/bisenet/bisenet.py","file_url":"https://github.com/SharifElfouly/easy-model-zoo/blob/HEAD/easy_model_zoo/bisenet/bisenet.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":"d3697beae5965412","code_sha256_prefix":"d3697beae5965412","mcp_get_code":{"code_sha256":"d3697beae5965412"}},{"arxiv_id":"1706.02413","arxiv_id_is_arxiv":true,"paper":"/paper/pointnet-deep-hierarchical-feature-learning","title":"PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyang-ur/SAT","path":"referit3d/external_tools/pointnet2/pointnet2_modules.py","file_url":"https://github.com/zyang-ur/SAT/blob/HEAD/referit3d/external_tools/pointnet2/pointnet2_modules.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1eb36d9951cd4e0a","code_sha256_prefix":"1eb36d9951cd4e0a","mcp_get_code":{"code_sha256":"1eb36d9951cd4e0a"}},{"arxiv_id":"1706.02413","arxiv_id_is_arxiv":true,"paper":"/paper/pointnet-deep-hierarchical-feature-learning","title":"PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"referit3d/referit3d","path":"referit3d/models/backbone/point_net_pp.py","file_url":"https://github.com/referit3d/referit3d/blob/HEAD/referit3d/models/backbone/point_net_pp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f9032ebfafd355b4","code_sha256_prefix":"f9032ebfafd355b4","mcp_get_code":{"code_sha256":"f9032ebfafd355b4"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmu2/PyTorch-MAML","path":"models/maml.py","file_url":"https://github.com/fmu2/PyTorch-MAML/blob/HEAD/models/maml.py","status":"ran","verification_level":1,"contract_check":null,"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, fmu2/PyTorch-MAML when it was checked","code_sha256":"8bdb2b9d394d85bf","code_sha256_prefix":"8bdb2b9d394d85bf","mcp_get_code":{"code_sha256":"8bdb2b9d394d85bf"}}],"record_sha256":"9fde90fa8054e9cdbe248cb503304ab0724e4232f2226b196cf39fa39651d085","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}