{"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/convnet-2","entry":"convnet","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":2,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":0,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":8,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":5},"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":"2411.13731","arxiv_id_is_arxiv":true,"paper":"/paper/delta-influence-unlearning-poisons-via","title":"Delta-Influence: Unlearning Poisons via Influence Functions","date":"2024-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ruby-a07/delta-influence","path":"forest/victims/models.py","file_url":"https://github.com/Ruby-a07/delta-influence/blob/HEAD/forest/victims/models.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":"d2f5607b54df5b75","code_sha256_prefix":"d2f5607b54df5b75","mcp_get_code":{"code_sha256":"d2f5607b54df5b75"}},{"arxiv_id":"2211.00801","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-reinforcement-learning-for-13","title":"Multi-Agent Reinforcement Learning for Adaptive Mesh Refinement","date":"2022-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"011235813/marl-amr","path":"marl_amr/alg/networks.py","file_url":"https://github.com/011235813/marl-amr/blob/HEAD/marl_amr/alg/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4f6852981fd5e95","code_sha256_prefix":"c4f6852981fd5e95","mcp_get_code":{"code_sha256":"c4f6852981fd5e95"}},{"arxiv_id":"2201.12328","arxiv_id_is_arxiv":true,"paper":"/paper/toward-training-at-imagenet-scale-with","title":"Toward Training at ImageNet Scale with Differential Privacy","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/dp-imagenet","path":"benchmark/cifar10_opacus.py","file_url":"https://github.com/google-research/dp-imagenet/blob/HEAD/benchmark/cifar10_opacus.py","status":"ran","verification_level":1,"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":"bb017e937333f8cb","code_sha256_prefix":"bb017e937333f8cb","mcp_get_code":{"code_sha256":"bb017e937333f8cb"}},{"arxiv_id":"2110.05323","arxiv_id_is_arxiv":true,"paper":"/paper/progfed-effective-communication-and-1","title":"ProgFed: Effective, Communication, and Computation Efficient Federated Learning by Progressive Training","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hui-po-wang/progfed","path":"models/convnet.py","file_url":"https://github.com/hui-po-wang/progfed/blob/HEAD/models/convnet.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":"18e31c431c76dd56","code_sha256_prefix":"18e31c431c76dd56","mcp_get_code":{"code_sha256":"18e31c431c76dd56"}},{"arxiv_id":"2109.03082","arxiv_id_is_arxiv":true,"paper":"/paper/perceptual-video-compression-with-recurrent","title":"Perceptual Learned Video Compression with Recurrent Conditional GAN","date":"2021-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RenYang-home/OpenDVC","path":"motion.py","file_url":"https://github.com/RenYang-home/OpenDVC/blob/HEAD/motion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35bc39682880bf95","code_sha256_prefix":"35bc39682880bf95","mcp_get_code":{"code_sha256":"35bc39682880bf95"}},{"arxiv_id":"2006.13560","arxiv_id_is_arxiv":true,"paper":"/paper/learning-for-video-compression-with-recurrent","title":"Learning for Video Compression with Recurrent Auto-Encoder and Recurrent Probability Model","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RenYang-home/RLVC","path":"motion.py","file_url":"https://github.com/RenYang-home/RLVC/blob/HEAD/motion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35bc39682880bf95","code_sha256_prefix":"35bc39682880bf95","mcp_get_code":{"code_sha256":"35bc39682880bf95"}},{"arxiv_id":"2006.06051","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-incentivize-other-learning-agents","title":"Learning to Incentivize Other Learning Agents","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"011235813/lio","path":"lio/alg/lio_ac.py","file_url":"https://github.com/011235813/lio/blob/HEAD/lio/alg/lio_ac.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":"cdfe44b4e9b56c5a","code_sha256_prefix":"cdfe44b4e9b56c5a","mcp_get_code":{"code_sha256":"cdfe44b4e9b56c5a"}},{"arxiv_id":"1809.05188","arxiv_id_is_arxiv":true,"paper":"/paper/cm3-cooperative-multi-goal-multi-stage-multi","title":"CM3: Cooperative Multi-goal Multi-stage Multi-agent Reinforcement Learning","date":"2018-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"011235813/cm3","path":"alg/networks.py","file_url":"https://github.com/011235813/cm3/blob/HEAD/alg/networks.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":"1c28a1c3d2124c04","code_sha256_prefix":"1c28a1c3d2124c04","mcp_get_code":{"code_sha256":"1c28a1c3d2124c04"}}],"record_sha256":"7bd246d0dd874046287d41d4babc7fb574fdd73f41d1c387ec3097e47e7b31ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}