{"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/recover","entry":"recover","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":6,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":1,"unverified":2},"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":"2405.04312","arxiv_id_is_arxiv":true,"paper":"/paper/inf-dit-upsampling-any-resolution-image-with","title":"Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient Diffusion Transformer","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/inf-dit","path":"dit/torch_dct.py","file_url":"https://github.com/thudm/inf-dit/blob/HEAD/dit/torch_dct.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"298f40d70a5d2ee4","code_sha256_prefix":"298f40d70a5d2ee4","mcp_get_code":{"code_sha256":"298f40d70a5d2ee4"}},{"arxiv_id":"2403.17460","arxiv_id_is_arxiv":true,"paper":"/paper/building-bridges-across-spatial-and-temporal","title":"Building Bridges across Spatial and Temporal Resolutions: Reference-Based Super-Resolution via Change Priors and Conditional Diffusion Model","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongrunmin/RefDiff","path":"torch_utils/torch_dct.py","file_url":"https://github.com/dongrunmin/RefDiff/blob/HEAD/torch_utils/torch_dct.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, dongrunmin/RefDiff when it was checked","code_sha256":"0faba4c223f38153","code_sha256_prefix":"0faba4c223f38153","mcp_get_code":{"code_sha256":"0faba4c223f38153"}},{"arxiv_id":"2312.04992","arxiv_id_is_arxiv":true,"paper":"/paper/pfllib-personalized-federated-learning","title":"PFLlib: A Beginner-Friendly and Comprehensive Personalized Federated Learning Library and Benchmark","date":"2023-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TsingZ0/HtFL","path":"system/flcore/clients/clientkd.py","file_url":"https://github.com/TsingZ0/HtFL/blob/HEAD/system/flcore/clients/clientkd.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":"77fd3aefd63cfad0","code_sha256_prefix":"77fd3aefd63cfad0","mcp_get_code":{"code_sha256":"77fd3aefd63cfad0"}},{"arxiv_id":"2305.14233","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-chat-language-models-by-scaling","title":"Enhancing Chat Language Models by Scaling High-quality Instructional Conversations","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/UltraChat","path":"UltraLM/weight_diff.py","file_url":"https://github.com/thunlp/UltraChat/blob/HEAD/UltraLM/weight_diff.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":"7be1b67f070ebca4","code_sha256_prefix":"7be1b67f070ebca4","mcp_get_code":{"code_sha256":"7be1b67f070ebca4"}},{"arxiv_id":"2209.10083","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-from-pre-trained-models-a","title":"Federated Learning from Pre-Trained Models: A Contrastive Learning Approach","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TsingZ0/GFL","path":"system/flcore/clients/clientkd.py","file_url":"https://github.com/TsingZ0/GFL/blob/HEAD/system/flcore/clients/clientkd.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":"77fd3aefd63cfad0","code_sha256_prefix":"77fd3aefd63cfad0","mcp_get_code":{"code_sha256":"77fd3aefd63cfad0"}},{"arxiv_id":"1911.08432","arxiv_id_is_arxiv":true,"paper":"/paper/defective-convolutional-layers-learn-robust-1","title":"Defective Convolutional Networks","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiangeluo/DefectiveCNN","path":"Attacks/attacks.py","file_url":"https://github.com/tiangeluo/DefectiveCNN/blob/HEAD/Attacks/attacks.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a44754831d4334a0","code_sha256_prefix":"a44754831d4334a0","mcp_get_code":{"code_sha256":"a44754831d4334a0"}}],"record_sha256":"d780a4e68dc477e8057ec4a1bb62e94d462b1f177fdbbe615f9ee07d2018dfd8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}