{"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-layer1d","entry":"norm_layer1d","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":6,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":6,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"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":1,"ran_fixture":0,"ran":0,"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":"2407.00278","arxiv_id_is_arxiv":true,"paper":"/paper/peract2-a-perceiver-actor-framework-for","title":"PerAct2: Benchmarking and Learning for Robotic Bimanual Manipulation Tasks","date":"2024-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markusgrotz/peract_bimanual","path":"helpers/network_utils.py","file_url":"https://github.com/markusgrotz/peract_bimanual/blob/HEAD/helpers/network_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ed9933be23b28a5","code_sha256_prefix":"9ed9933be23b28a5","mcp_get_code":{"code_sha256":"9ed9933be23b28a5"}},{"arxiv_id":"2402.14407","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-actionless-video-pre-training-via","title":"Learning an Actionable Discrete Diffusion Policy via Large-Scale Actionless Video Pre-Training","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peract/peract","path":"helpers/network_utils.py","file_url":"https://github.com/peract/peract/blob/HEAD/helpers/network_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ed9933be23b28a5","code_sha256_prefix":"9ed9933be23b28a5","mcp_get_code":{"code_sha256":"9ed9933be23b28a5"}},{"arxiv_id":"2308.16891","arxiv_id_is_arxiv":true,"paper":"/paper/gnfactor-multi-task-real-robot-learning-with","title":"GNFactor: Multi-Task Real Robot Learning with Generalizable Neural Feature Fields","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YanjieZe/GNFactor","path":"GNFactor/helpers/network_utils.py","file_url":"https://github.com/YanjieZe/GNFactor/blob/HEAD/GNFactor/helpers/network_utils.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":"9ed9933be23b28a5","code_sha256_prefix":"9ed9933be23b28a5","mcp_get_code":{"code_sha256":"9ed9933be23b28a5"}},{"arxiv_id":"2306.10474","arxiv_id_is_arxiv":true,"paper":"/paper/a-universal-semantic-geometric-representation","title":"A Universal Semantic-Geometric Representation for Robotic Manipulation","date":"2023-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TongZhangTHU/sgr","path":"helpers/network_utils.py","file_url":"https://github.com/TongZhangTHU/sgr/blob/HEAD/helpers/network_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ed9933be23b28a5","code_sha256_prefix":"9ed9933be23b28a5","mcp_get_code":{"code_sha256":"9ed9933be23b28a5"}},{"arxiv_id":"2304.04321","arxiv_id_is_arxiv":true,"paper":"/paper/arnold-a-benchmark-for-language-grounded-task","title":"ARNOLD: A Benchmark for Language-Grounded Task Learning With Continuous States in Realistic 3D Scenes","date":"2023-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnold-benchmark/arnold","path":"bc_z/blocks.py","file_url":"https://github.com/arnold-benchmark/arnold/blob/HEAD/bc_z/blocks.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":"9ed9933be23b28a5","code_sha256_prefix":"9ed9933be23b28a5","mcp_get_code":{"code_sha256":"9ed9933be23b28a5"}},{"arxiv_id":"2207.11514","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-abstraction-open-world-3d-scene","title":"Semantic Abstraction: Open-World 3D Scene Understanding from 2D Vision-Language Models","date":"2022-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"columbia-ai-robotics/semantic-abstraction","path":"arm/network_utils.py","file_url":"https://github.com/columbia-ai-robotics/semantic-abstraction/blob/HEAD/arm/network_utils.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":"9ed9933be23b28a5","code_sha256_prefix":"9ed9933be23b28a5","mcp_get_code":{"code_sha256":"9ed9933be23b28a5"}}],"record_sha256":"47d046435ef671496489221d617a47fbe83a8d89f1f4f878dd2769a5eeecff2b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}