{"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/build-models","entry":"build_models","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":2,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":6,"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":2,"ran_fixture":0,"ran":0,"unverified":7},"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":"2605.25750","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25750","title":"Invariant-Based Weight Sharing for Message Passing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fseiffarth/SimpleGNN","path":"src/simplegnn/utils/param_count.py","file_url":"https://github.com/fseiffarth/SimpleGNN/blob/HEAD/src/simplegnn/utils/param_count.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":"1a9d768cdfaa2bdb","code_sha256_prefix":"1a9d768cdfaa2bdb","mcp_get_code":{"code_sha256":"1a9d768cdfaa2bdb"}},{"arxiv_id":"2604.23264","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-23264","title":"MotionHiFlow: Text-to-Motion via Hierarchical Flow Matching","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ai-lh/MotionHiFlow","path":"src/evaluators/t2m_eval_wrapper.py","file_url":"https://github.com/ai-lh/MotionHiFlow/blob/HEAD/src/evaluators/t2m_eval_wrapper.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, ai-lh/MotionHiFlow when it was checked","code_sha256":"0e89c3d7e91130b0","code_sha256_prefix":"0e89c3d7e91130b0","mcp_get_code":{"code_sha256":"0e89c3d7e91130b0"}},{"arxiv_id":"2509.25729","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-25729","title":"Controlled Generation for Private Synthetic Text","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zzhao71/Controlled-Generation-for-Private-Synthetic-Text","path":"masking.py","file_url":"https://github.com/zzhao71/Controlled-Generation-for-Private-Synthetic-Text/blob/HEAD/masking.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, zzhao71/Controlled-Generation-for-Private-Synthetic-Text when it was checked","code_sha256":"3ba14b3aa5391e79","code_sha256_prefix":"3ba14b3aa5391e79","mcp_get_code":{"code_sha256":"3ba14b3aa5391e79"}},{"arxiv_id":"2410.03644","arxiv_id_is_arxiv":true,"paper":"/paper/unlearnable-3d-point-clouds-class-wise","title":"Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/unlearnablepc","path":"reverse_train.py","file_url":"https://github.com/cgcl-codes/unlearnablepc/blob/HEAD/reverse_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"36efd318d37a6214","code_sha256_prefix":"36efd318d37a6214","mcp_get_code":{"code_sha256":"36efd318d37a6214"}},{"arxiv_id":"2312.16051","arxiv_id_is_arxiv":true,"paper":"/paper/inter-x-towards-versatile-human-human","title":"Inter-X: Towards Versatile Human-Human Interaction Analysis","date":"2023-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangxuy/Inter-X","path":"evaluation/text2motion/eval_comp_v6.py","file_url":"https://github.com/liangxuy/Inter-X/blob/HEAD/evaluation/text2motion/eval_comp_v6.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, liangxuy/Inter-X (NOASSERTION)","code_sha256":"9da2e386201e1a91","code_sha256_prefix":"9da2e386201e1a91","mcp_get_code":{"code_sha256":"9da2e386201e1a91"}},{"arxiv_id":"2312.00063","arxiv_id_is_arxiv":true,"paper":"/paper/momask-generative-masked-modeling-of-3d-human","title":"MoMask: Generative Masked Modeling of 3D Human Motions","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EricGuo5513/momask-codes","path":"models/t2m_eval_wrapper.py","file_url":"https://github.com/EricGuo5513/momask-codes/blob/HEAD/models/t2m_eval_wrapper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ai-lh/MotionHiFlow, and GitHub detected no licence in that repository when it was checked","code_sha256":"0e89c3d7e91130b0","code_sha256_prefix":"0e89c3d7e91130b0","mcp_get_code":{"code_sha256":"0e89c3d7e91130b0"}},{"arxiv_id":"2304.05684","arxiv_id_is_arxiv":true,"paper":"/paper/intergen-diffusion-based-multi-human-motion","title":"InterGen: Diffusion-based Multi-human Motion Generation under Complex Interactions","date":"2023-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tr3e/intergen","path":"tools/infer.py","file_url":"https://github.com/tr3e/intergen/blob/HEAD/tools/infer.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, tr3e/intergen when it was checked","code_sha256":"1c2aad96b9ed4cab","code_sha256_prefix":"1c2aad96b9ed4cab","mcp_get_code":{"code_sha256":"1c2aad96b9ed4cab"}},{"arxiv_id":"2203.11593","arxiv_id_is_arxiv":true,"paper":"/paper/unified-negative-pair-generation-toward-well","title":"Unified Negative Pair Generation toward Well-discriminative Feature Space for Face Recognition","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jung-jun-uk/unpg","path":"recognition/models/build.py","file_url":"https://github.com/jung-jun-uk/unpg/blob/HEAD/recognition/models/build.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":"6f437f153ac1b10c","code_sha256_prefix":"6f437f153ac1b10c","mcp_get_code":{"code_sha256":"6f437f153ac1b10c"}},{"arxiv_id":"1505.07818","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AKASH2907/Forgery-Classification-via-Domain-Adaptation","path":"DANN/dann_keras.py","file_url":"https://github.com/AKASH2907/Forgery-Classification-via-Domain-Adaptation/blob/HEAD/DANN/dann_keras.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, AKASH2907/Forgery-Classification-via-Domain-Adaptation when it was checked","code_sha256":"f9776e8c18b947b6","code_sha256_prefix":"f9776e8c18b947b6","mcp_get_code":{"code_sha256":"f9776e8c18b947b6"}},{"arxiv_id":"Li_Learning_Hierarchical_Line_Buffer_for_Image_Processing_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_Learning_Hierarchical_Line_Buffer_for_Image_Processing_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SonyResearch/LineBufferNet","path":"train_denoise_raw.py","file_url":"https://github.com/SonyResearch/LineBufferNet/blob/HEAD/train_denoise_raw.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":"4ba5bed43cf8e01f","code_sha256_prefix":"4ba5bed43cf8e01f","mcp_get_code":{"code_sha256":"4ba5bed43cf8e01f"}}],"record_sha256":"4f2fd426a89d6053c0ffee6bca6ab9d4fe5d7c1a61b4abe49b51d1460aa61d2f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}