{"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/model-forward","entry":"model_forward","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":10,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":11,"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":1,"ran_fixture":1,"ran":5,"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":"2602.02108","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02108","title":"Out of the Memory Barrier: A Highly Memory Efficient Training System for LLMs with Million-Token Contexts","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"wenhaoli-xmu/OOMB","path":"chunkoptim/modifiers/train_baseline.py","file_url":"https://github.com/wenhaoli-xmu/OOMB/blob/HEAD/chunkoptim/modifiers/train_baseline.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, wenhaoli-xmu/OOMB when it was checked","code_sha256":"952eba1e718deb55","code_sha256_prefix":"952eba1e718deb55","mcp_get_code":{"code_sha256":"952eba1e718deb55"}},{"arxiv_id":"2602.02108","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02108","title":"Out of the Memory Barrier: A Highly Memory Efficient Training System for LLMs with Million-Token Contexts","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"wenhaoli-xmu/OOMB","path":"chunkoptim/modifiers/train_baseline_tp.py","file_url":"https://github.com/wenhaoli-xmu/OOMB/blob/HEAD/chunkoptim/modifiers/train_baseline_tp.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, wenhaoli-xmu/OOMB when it was checked","code_sha256":"ea3731b70689fdbd","code_sha256_prefix":"ea3731b70689fdbd","mcp_get_code":{"code_sha256":"ea3731b70689fdbd"}},{"arxiv_id":"2410.07671","arxiv_id_is_arxiv":true,"paper":"/paper/disco-a-hierarchical-disentangled-cognitive","title":"DISCO: A Hierarchical Disentangled Cognitive Diagnosis Framework for Interpretable Job Recommendation","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LabyrinthineLeo/DISCO","path":"utils/train_model.py","file_url":"https://github.com/LabyrinthineLeo/DISCO/blob/HEAD/utils/train_model.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, LabyrinthineLeo/DISCO when it was checked","code_sha256":"9346385946c7a5ed","code_sha256_prefix":"9346385946c7a5ed","mcp_get_code":{"code_sha256":"9346385946c7a5ed"}},{"arxiv_id":"2408.00724","arxiv_id_is_arxiv":true,"paper":"/paper/2408-00724","title":"Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models","date":"2024-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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":"63f447f7130d312a","code_sha256_prefix":"63f447f7130d312a","mcp_get_code":{"code_sha256":"63f447f7130d312a"}},{"arxiv_id":"2407.09450","arxiv_id_is_arxiv":true,"paper":"/paper/human-like-episodic-memory-for-infinite","title":"Human-like Episodic Memory for Infinite Context LLMs","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"em-llm/EM-LLM-model","path":"em_llm/utils/patch_hf.py","file_url":"https://github.com/em-llm/EM-LLM-model/blob/HEAD/em_llm/utils/patch_hf.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":"c32ff1ae851680ef","code_sha256_prefix":"c32ff1ae851680ef","mcp_get_code":{"code_sha256":"c32ff1ae851680ef"}},{"arxiv_id":"2406.12465","arxiv_id_is_arxiv":true,"paper":"/paper/rigl-a-unified-reciprocal-approach-for","title":"RIGL: A Unified Reciprocal Approach for Tracing the Independent and Group Learning Processes","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labyrinthineleo/rigl","path":"utils/train_model.py","file_url":"https://github.com/labyrinthineleo/rigl/blob/HEAD/utils/train_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, labyrinthineleo/rigl when it was checked","code_sha256":"fdc3031f2d1fa702","code_sha256_prefix":"fdc3031f2d1fa702","mcp_get_code":{"code_sha256":"fdc3031f2d1fa702"}},{"arxiv_id":"2403.09472","arxiv_id_is_arxiv":true,"paper":"/paper/easy-to-hard-generalization-scalable","title":"Easy-to-Hard Generalization: Scalable Alignment Beyond Human Supervision","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edward-sun/easy-to-hard","path":"train_rl_dpo.py","file_url":"https://github.com/edward-sun/easy-to-hard/blob/HEAD/train_rl_dpo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"63f447f7130d312a","code_sha256_prefix":"63f447f7130d312a","mcp_get_code":{"code_sha256":"63f447f7130d312a"}},{"arxiv_id":"2212.08062","arxiv_id_is_arxiv":true,"paper":"/paper/metaportrait-identity-preserving-talking-head","title":"MetaPortrait: Identity-Preserving Talking Head Generation with Fast Personalized Adaptation","date":"2022-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Meta-Portrait/MetaPortrait","path":"base_model/inference.py","file_url":"https://github.com/Meta-Portrait/MetaPortrait/blob/HEAD/base_model/inference.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cab73f2a83280796","code_sha256_prefix":"cab73f2a83280796","mcp_get_code":{"code_sha256":"cab73f2a83280796"}},{"arxiv_id":"2209.13258","arxiv_id_is_arxiv":true,"paper":"/paper/osdp-optimal-sharded-data-parallel-for","title":"OSDP: Optimal Sharded Data Parallel for Distributed Deep Learning","date":null,"month_inferred_from_arxiv_id":"2022-09","title_source":"archive","repo":"youhe-jiang/ijcai2023-optimalshardeddataparallel","path":"bert/train_bert_large_communication_with_groups.py","file_url":"https://github.com/youhe-jiang/ijcai2023-optimalshardeddataparallel/blob/HEAD/bert/train_bert_large_communication_with_groups.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":"65a4b47eb53d0834","code_sha256_prefix":"65a4b47eb53d0834","mcp_get_code":{"code_sha256":"65a4b47eb53d0834"}},{"arxiv_id":"2111.14874","arxiv_id_is_arxiv":true,"paper":"/paper/weighing-the-milky-way-and-andromeda-with","title":"Weighing the Milky Way and Andromeda with Artificial Intelligence","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PabloVD/HaloGraphNet","path":"captumtest.py","file_url":"https://github.com/PabloVD/HaloGraphNet/blob/HEAD/captumtest.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":"3fde415c52287650","code_sha256_prefix":"3fde415c52287650","mcp_get_code":{"code_sha256":"3fde415c52287650"}},{"arxiv_id":"1907.10326","arxiv_id_is_arxiv":true,"paper":"/paper/from-big-to-small-multi-scale-local-planar","title":"From Big to Small: Multi-Scale Local Planar Guidance for Monocular Depth Estimation","date":"2019-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ku-cvlab/maskingdepth","path":"loss.py","file_url":"https://github.com/ku-cvlab/maskingdepth/blob/HEAD/loss.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":"6ee3f3744ec86804","code_sha256_prefix":"6ee3f3744ec86804","mcp_get_code":{"code_sha256":"6ee3f3744ec86804"}}],"record_sha256":"ab16376d6e88042a82cbe66181b607137d37201ed1a7879b44aab01801d8201d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}