{"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/layernorm-2","entry":"layernorm","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":8,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"unverified":4},"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":"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, facebookresearch/metamotivo (NOASSERTION)","code_sha256":"ee57a886c99dd0b1","code_sha256_prefix":"ee57a886c99dd0b1","mcp_get_code":{"code_sha256":"ee57a886c99dd0b1"}},{"arxiv_id":"2501.12392","arxiv_id_is_arxiv":true,"paper":"/paper/learning-segmentation-from-point-trajectories","title":"Learning segmentation from point trajectories","date":"2025-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/tapnet","path":"tapnet/models/tapir_model.py","file_url":"https://github.com/google-deepmind/tapnet/blob/HEAD/tapnet/models/tapir_model.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":"23e304fbbc8fabfe","code_sha256_prefix":"23e304fbbc8fabfe","mcp_get_code":{"code_sha256":"23e304fbbc8fabfe"}},{"arxiv_id":"2411.09821","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-classification-of-general-movements","title":"Automatic Classification of General Movements in Newborns","date":"2024-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chopardda/GMA","path":"tapnet/tapir_model.py","file_url":"https://github.com/chopardda/GMA/blob/HEAD/tapnet/tapir_model.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, chopardda/GMA when it was checked","code_sha256":"64c885d6b9f4fd57","code_sha256_prefix":"64c885d6b9f4fd57","mcp_get_code":{"code_sha256":"64c885d6b9f4fd57"}},{"arxiv_id":"2307.01197","arxiv_id_is_arxiv":true,"paper":"/paper/segment-anything-meets-point-tracking","title":"Segment Anything Meets Point Tracking","date":"2023-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syscv/sam-pt","path":"sam_pt/point_tracker/tapir/tapir_model.py","file_url":"https://github.com/syscv/sam-pt/blob/HEAD/sam_pt/point_tracker/tapir/tapir_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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 chopardda/GMA, and GitHub detected no licence in that repository when it was checked","code_sha256":"64c885d6b9f4fd57","code_sha256_prefix":"64c885d6b9f4fd57","mcp_get_code":{"code_sha256":"64c885d6b9f4fd57"}},{"arxiv_id":"2303.12341","arxiv_id_is_arxiv":true,"paper":"/paper/easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cchao0116/EasyDGL","path":"src/model/Base.py","file_url":"https://github.com/cchao0116/EasyDGL/blob/HEAD/src/model/Base.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":"a3c3f11075934dfa","code_sha256_prefix":"a3c3f11075934dfa","mcp_get_code":{"code_sha256":"a3c3f11075934dfa"}},{"arxiv_id":"2211.03726","arxiv_id_is_arxiv":true,"paper":"/paper/tap-vid-a-benchmark-for-tracking-any-point-in","title":"TAP-Vid: A Benchmark for Tracking Any Point in a Video","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"23e304fbbc8fabfe","code_sha256_prefix":"23e304fbbc8fabfe","mcp_get_code":{"code_sha256":"23e304fbbc8fabfe"}},{"arxiv_id":"2204.00752","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-dynamic-user-preference-via-1","title":"Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation","date":"2022-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cchao0116/S2PNM-TKDE2021","path":"src/model/Base.py","file_url":"https://github.com/cchao0116/S2PNM-TKDE2021/blob/HEAD/src/model/Base.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":"5b095cb6e45831ff","code_sha256_prefix":"5b095cb6e45831ff","mcp_get_code":{"code_sha256":"5b095cb6e45831ff"}},{"arxiv_id":"2204.00752","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-dynamic-user-preference-via-1","title":"Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation","date":"2022-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cchao0116/S2PNM-TKDE2021","path":"src/module/normalize.py","file_url":"https://github.com/cchao0116/S2PNM-TKDE2021/blob/HEAD/src/module/normalize.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":"7c8f71c269748452","code_sha256_prefix":"7c8f71c269748452","mcp_get_code":{"code_sha256":"7c8f71c269748452"}},{"arxiv_id":"2111.07117","arxiv_id_is_arxiv":true,"paper":"/paper/learning-object-centric-representations-of-1","title":"Learning Object-Centric Representations of Multi-Object Scenes from Multiple Views","date":"2021-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NanboLi/MulMON","path":"models/modules.py","file_url":"https://github.com/NanboLi/MulMON/blob/HEAD/models/modules.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":"8b0dfa4cca4a9a1f","code_sha256_prefix":"8b0dfa4cca4a9a1f","mcp_get_code":{"code_sha256":"8b0dfa4cca4a9a1f"}}],"record_sha256":"4f9d8f2857a4e2990a034b22775ca9cbf07be29ad59811bc9329be36511321e3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}