{"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/copy-state-dict","entry":"copy_state_dict","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"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":"2412.11569","arxiv_id_is_arxiv":true,"paper":"/paper/the-dark-side-of-the-forces-assessing-non","title":"The dark side of the forces: assessing non-conservative force models for atomistic machine learning","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MDIL-SNU/SevenNet","path":"sevenn/checkpoint.py","file_url":"https://github.com/MDIL-SNU/SevenNet/blob/HEAD/sevenn/checkpoint.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":"ad1feb9952020ba2","code_sha256_prefix":"ad1feb9952020ba2","mcp_get_code":{"code_sha256":"ad1feb9952020ba2"}},{"arxiv_id":"2402.03789","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-parallel-algorithm-for-graph-neural","title":"Scalable Parallel Algorithm for Graph Neural Network Interatomic Potentials in Molecular Dynamics Simulations","date":null,"month_inferred_from_arxiv_id":"2024-02","title_source":"archive","repo":"mdil-snu/sevennet","path":"sevenn/checkpoint.py","file_url":"https://github.com/mdil-snu/sevennet/blob/HEAD/sevenn/checkpoint.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":"ad1feb9952020ba2","code_sha256_prefix":"ad1feb9952020ba2","mcp_get_code":{"code_sha256":"ad1feb9952020ba2"}},{"arxiv_id":"2304.09502","arxiv_id_is_arxiv":true,"paper":"/paper/sampling-is-matter-point-guided-3d-human-mesh-1","title":"Sampling is Matter: Point-guided 3D Human Mesh Reconstruction","date":"2023-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DCVL-3D/PointHMR_release","path":"src/modeling/model/network.py","file_url":"https://github.com/DCVL-3D/PointHMR_release/blob/HEAD/src/modeling/model/network.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da69a7ce867e0cd6","code_sha256_prefix":"da69a7ce867e0cd6","mcp_get_code":{"code_sha256":"da69a7ce867e0cd6"}},{"arxiv_id":"2105.09701","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-vehicle-re","title":"An Empirical Study of Vehicle Re-Identification on the AI City Challenge","date":"2021-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michuanhaohao/AICITY2021_Track2_DMT","path":"train_stage2_v1.py","file_url":"https://github.com/michuanhaohao/AICITY2021_Track2_DMT/blob/HEAD/train_stage2_v1.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":"fcfe83b90ec34b09","code_sha256_prefix":"fcfe83b90ec34b09","mcp_get_code":{"code_sha256":"fcfe83b90ec34b09"}},{"arxiv_id":"1904.01941","arxiv_id_is_arxiv":true,"paper":"/paper/character-region-awareness-for-text-detection","title":"Character Region Awareness for Text Detection","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jakartaresearch/receipt-ocr","path":"src/text_detector/load_model.py","file_url":"https://github.com/jakartaresearch/receipt-ocr/blob/HEAD/src/text_detector/load_model.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":"57a0fb73bcfe67fa","code_sha256_prefix":"57a0fb73bcfe67fa","mcp_get_code":{"code_sha256":"57a0fb73bcfe67fa"}},{"arxiv_id":"1903.11306","arxiv_id_is_arxiv":true,"paper":"/paper/linkage-based-face-clustering-via-graph","title":"Linkage Based Face Clustering via Graph Convolution Network","date":"2019-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhongdao/gcn_clustering","path":"utils/serialization.py","file_url":"https://github.com/Zhongdao/gcn_clustering/blob/HEAD/utils/serialization.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":"43879b49d0ac5101","code_sha256_prefix":"43879b49d0ac5101","mcp_get_code":{"code_sha256":"43879b49d0ac5101"}},{"arxiv_id":"1807.07860","arxiv_id_is_arxiv":true,"paper":"/paper/talking-face-generation-by-adversarially","title":"Talking Face Generation by Adversarially Disentangled Audio-Visual Representation","date":"2018-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hangz-nju-cuhk/Talking-Face-Generation-DAVS","path":"embedding_utils.py","file_url":"https://github.com/Hangz-nju-cuhk/Talking-Face-Generation-DAVS/blob/HEAD/embedding_utils.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":"167513eefb3a1218","code_sha256_prefix":"167513eefb3a1218","mcp_get_code":{"code_sha256":"167513eefb3a1218"}}],"record_sha256":"f42bd4e4b7f3b40dfae68f68fd6e0c9d462d3d9f8ac31667d0d361963dde8322","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}