{"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-2","entry":"Norm","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":13,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"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":13,"n_samples_ran":10,"n_samples_constructed":5,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":5,"n_places":13,"n_places_pointer_only":8,"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":10,"unverified":3},"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":"2508.06214","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-06214","title":"Reparameterization Proximal Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"etaoxing/mineral","path":"mineral/nets/mlp.py","file_url":"https://github.com/etaoxing/mineral/blob/HEAD/mineral/nets/mlp.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":"28f2a00675369999","code_sha256_prefix":"28f2a00675369999","mcp_get_code":{"code_sha256":"28f2a00675369999"}},{"arxiv_id":"2504.11054","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-whole-body-humanoid-control-via","title":"Zero-Shot Whole-Body Humanoid Control via Behavioral Foundation Models","date":"2025-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/metamotivo","path":"metamotivo/fb/model.py","file_url":"https://github.com/facebookresearch/metamotivo/blob/HEAD/metamotivo/fb/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/metamotivo (NOASSERTION)","code_sha256":"cc09fe08b93015a6","code_sha256_prefix":"cc09fe08b93015a6","mcp_get_code":{"code_sha256":"cc09fe08b93015a6"}},{"arxiv_id":"2503.04151","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2503.04151","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":null,"repo":"SubmissionsIn/RML","path":"RML+NRCH/RML_network.py","file_url":"https://github.com/SubmissionsIn/RML/blob/HEAD/RML%2BNRCH/RML_network.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a87c34abb9f3bffe","code_sha256_prefix":"a87c34abb9f3bffe","mcp_get_code":{"code_sha256":"a87c34abb9f3bffe"}},{"arxiv_id":"2407.05649","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-with-random-rewiring","title":"Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grass-gnn/grass","path":"grass/gnn.py","file_url":"https://github.com/grass-gnn/grass/blob/HEAD/grass/gnn.py","status":"unverified","verification_level":0,"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, grass-gnn/grass (NOASSERTION)","code_sha256":"dc679bb58f026c39","code_sha256_prefix":"dc679bb58f026c39","mcp_get_code":{"code_sha256":"dc679bb58f026c39"}},{"arxiv_id":"2304.13976","arxiv_id_is_arxiv":true,"paper":"/paper/moderately-distributional-exploration-for","title":"Moderately Distributional Exploration for Domain Generalization","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rxsw/mode","path":"utils/MODE.py","file_url":"https://github.com/rxsw/mode/blob/HEAD/utils/MODE.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, rxsw/mode when it was checked","code_sha256":"a771d0b68c0db3cd","code_sha256_prefix":"a771d0b68c0db3cd","mcp_get_code":{"code_sha256":"a771d0b68c0db3cd"}},{"arxiv_id":"2303.07180","arxiv_id_is_arxiv":true,"paper":"/paper/incomplete-multi-view-multi-label-learning","title":"Incomplete Multi-View Multi-Label Learning via Label-Guided Masked View- and Category-Aware Transformers","date":"2023-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justsmart/LMVCAT","path":"model.py","file_url":"https://github.com/justsmart/LMVCAT/blob/HEAD/model.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, justsmart/LMVCAT when it was checked","code_sha256":"98ce7e15064e79c0","code_sha256_prefix":"98ce7e15064e79c0","mcp_get_code":{"code_sha256":"98ce7e15064e79c0"}},{"arxiv_id":"2207.02206","arxiv_id_is_arxiv":true,"paper":"/paper/segmenting-moving-objects-via-an-object","title":"Segmenting Moving Objects via an Object-Centric Layered Representation","date":"2022-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jyxarthur/OCLR_model","path":"models/oclr.py","file_url":"https://github.com/Jyxarthur/OCLR_model/blob/HEAD/models/oclr.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":"55e3d071afe4d46b","code_sha256_prefix":"55e3d071afe4d46b","mcp_get_code":{"code_sha256":"55e3d071afe4d46b"}},{"arxiv_id":"2203.04279","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-warp-consistency-for-weakly","title":"Probabilistic Warp Consistency for Weakly-Supervised Semantic Correspondences","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PruneTruong/DenseMatching","path":"training/losses/probabilistic_warp_consistency_losses.py","file_url":"https://github.com/PruneTruong/DenseMatching/blob/HEAD/training/losses/probabilistic_warp_consistency_losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-2.1","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-2.1, as GitHub detects it on this paper's repository, PruneTruong/DenseMatching, is not in the permissive set Syntology serves inline","code_sha256":"5a05b45173a6074c","code_sha256_prefix":"5a05b45173a6074c","mcp_get_code":{"code_sha256":"5a05b45173a6074c"}},{"arxiv_id":"2009.03294","arxiv_id_is_arxiv":true,"paper":"/paper/graphnorm-a-principled-approach-to","title":"GraphNorm: A Principled Approach to Accelerating Graph Neural Network Training","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lsj2408/GraphNorm","path":"GraphNorm_ws/gnn_ws/gnn_example/model/Norm/norm.py","file_url":"https://github.com/lsj2408/GraphNorm/blob/HEAD/GraphNorm_ws/gnn_ws/gnn_example/model/Norm/norm.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":"b733c5c8edfb291f","code_sha256_prefix":"b733c5c8edfb291f","mcp_get_code":{"code_sha256":"b733c5c8edfb291f"}},{"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":"pierrickch/textureautoencoder","path":"code/models.py","file_url":"https://github.com/pierrickch/textureautoencoder/blob/HEAD/code/models.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, pierrickch/textureautoencoder when it was checked","code_sha256":"c3bef6513922d06a","code_sha256_prefix":"c3bef6513922d06a","mcp_get_code":{"code_sha256":"c3bef6513922d06a"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"semicontinuity/nlp","path":"lopuhin_transformer_lm/lm/model.py","file_url":"https://github.com/semicontinuity/nlp/blob/HEAD/lopuhin_transformer_lm/lm/model.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, semicontinuity/nlp when it was checked","code_sha256":"a1e01890f6449f83","code_sha256_prefix":"a1e01890f6449f83","mcp_get_code":{"code_sha256":"a1e01890f6449f83"}},{"arxiv_id":"1704.04368","arxiv_id_is_arxiv":true,"paper":"/paper/get-to-the-point-summarization-with-pointer","title":"Get To The Point: Summarization with Pointer-Generator Networks","date":"2017-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NirmalenduPrakash/DocumentSummarizer","path":"summarizer_transformer.py","file_url":"https://github.com/NirmalenduPrakash/DocumentSummarizer/blob/HEAD/summarizer_transformer.py","status":"unverified","verification_level":0,"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, NirmalenduPrakash/DocumentSummarizer when it was checked","code_sha256":"c614959d211eacfc","code_sha256_prefix":"c614959d211eacfc","mcp_get_code":{"code_sha256":"c614959d211eacfc"}},{"arxiv_id":"1703.06868","arxiv_id_is_arxiv":true,"paper":"/paper/arbitrary-style-transfer-in-real-time-with","title":"Arbitrary Style Transfer in Real-time with Adaptive Instance Normalization","date":"2017-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongkwani/upcsc","path":"trainers/adain/adain.py","file_url":"https://github.com/dongkwani/upcsc/blob/HEAD/trainers/adain/adain.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":"70413403e7bd4032","code_sha256_prefix":"70413403e7bd4032","mcp_get_code":{"code_sha256":"70413403e7bd4032"}}],"record_sha256":"cb514e6a5d01fd005d316f252fb33aa3bc6a762e36af82e14bd92986c18c25dd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}