{"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/compute-grad","entry":"compute_grad","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":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":5,"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":1,"ran_draft_wrong":3,"ran_fixture":0,"ran":3,"unverified":1},"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.11884","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11884","title":"Sobolev Regularized MMD Gradient Flow","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"FerdTian/SrMMD","path":"src/generative/student_teacher/losses.py","file_url":"https://github.com/FerdTian/SrMMD/blob/HEAD/src/generative/student_teacher/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, FerdTian/SrMMD when it was checked","code_sha256":"e33acb41b3863b52","code_sha256_prefix":"e33acb41b3863b52","mcp_get_code":{"code_sha256":"e33acb41b3863b52"}},{"arxiv_id":"2506.05454","arxiv_id_is_arxiv":true,"paper":"/paper/zeroth-order-optimization-finds-flat-minima","title":"Zeroth-Order Optimization Finds Flat Minima","date":"2025-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liang137/FlatZero","path":"svm_logreg/logreg.py","file_url":"https://github.com/Liang137/FlatZero/blob/HEAD/svm_logreg/logreg.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a373a6ed03c9cc41","code_sha256_prefix":"a373a6ed03c9cc41","mcp_get_code":{"code_sha256":"a373a6ed03c9cc41"}},{"arxiv_id":"2409.14980","arxiv_id_is_arxiv":true,"paper":"/paper/de-regularized-maximum-mean-discrepancy","title":"(De)-regularized Maximum Mean Discrepancy Gradient Flow","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hudsonchen/drmmd","path":"student_teacher/losses.py","file_url":"https://github.com/hudsonchen/drmmd/blob/HEAD/student_teacher/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, hudsonchen/drmmd when it was checked","code_sha256":"e33acb41b3863b52","code_sha256_prefix":"e33acb41b3863b52","mcp_get_code":{"code_sha256":"e33acb41b3863b52"}},{"arxiv_id":"2310.19248","arxiv_id_is_arxiv":true,"paper":"/paper/impress-evaluating-the-resilience-of","title":"IMPRESS: Evaluating the Resilience of Imperceptible Perturbations Against Unauthorized Data Usage in Diffusion-Based Generative AI","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AAAAAAsuka/Impress","path":"pg_mask_diff_helen.py","file_url":"https://github.com/AAAAAAsuka/Impress/blob/HEAD/pg_mask_diff_helen.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, AAAAAAsuka/Impress when it was checked","code_sha256":"5179edd3b2ef992c","code_sha256_prefix":"5179edd3b2ef992c","mcp_get_code":{"code_sha256":"5179edd3b2ef992c"}},{"arxiv_id":"2310.04687","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-adversarial","title":"Targeted Attack Improves Protection against Unauthorized Diffusion Customization","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caradryanliang/improvedadvdm","path":"benchmarks/photoguard+.py","file_url":"https://github.com/caradryanliang/improvedadvdm/blob/HEAD/benchmarks/photoguard%2B.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, caradryanliang/improvedadvdm when it was checked","code_sha256":"93c799084cc33809","code_sha256_prefix":"93c799084cc33809","mcp_get_code":{"code_sha256":"93c799084cc33809"}},{"arxiv_id":"2308.10027","arxiv_id_is_arxiv":true,"paper":"/paper/single-image-reflection-separation-via","title":"Single Image Reflection Separation via Component Synergy","date":"2023-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingcv/dsrnet","path":"models/losses.py","file_url":"https://github.com/mingcv/dsrnet/blob/HEAD/models/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0609d7bef0d31894","code_sha256_prefix":"0609d7bef0d31894","mcp_get_code":{"code_sha256":"0609d7bef0d31894"}},{"arxiv_id":"2206.05891","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-federated-learning-via-sampling","title":"Anchor Sampling for Federated Learning with Partial Client Participation","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harliwu/fedamd","path":"algo/fedamd.py","file_url":"https://github.com/harliwu/fedamd/blob/HEAD/algo/fedamd.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":"a01b445c0f9920ba","code_sha256_prefix":"a01b445c0f9920ba","mcp_get_code":{"code_sha256":"a01b445c0f9920ba"}},{"arxiv_id":"2204.03640","arxiv_id_is_arxiv":true,"paper":"/paper/equivariance-discovery-by-learned-parameter","title":"Equivariance Discovery by Learned Parameter-Sharing","date":"2022-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raymondyeh07/equivariance_discovery","path":"struct_discovery/solver/hypergrad/grad_helpers.py","file_url":"https://github.com/raymondyeh07/equivariance_discovery/blob/HEAD/struct_discovery/solver/hypergrad/grad_helpers.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":"d8fe2cddae8305b3","code_sha256_prefix":"d8fe2cddae8305b3","mcp_get_code":{"code_sha256":"d8fe2cddae8305b3"}},{"arxiv_id":"2102.03150","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-message-passing-for-the","title":"Equivariant message passing for the prediction of tensorial properties and molecular spectra","date":"2021-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learningmatter-mit/NeuralForceField","path":"nff/nn/models/painn.py","file_url":"https://github.com/learningmatter-mit/NeuralForceField/blob/HEAD/nff/nn/models/painn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ac65d5ac1bf4b38","code_sha256_prefix":"2ac65d5ac1bf4b38","mcp_get_code":{"code_sha256":"2ac65d5ac1bf4b38"}},{"arxiv_id":"1906.04370","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-mean-discrepancy-gradient-flow","title":"Maximum Mean Discrepancy Gradient Flow","date":"2019-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/MMD-gradient-flow","path":"losses.py","file_url":"https://github.com/MichaelArbel/MMD-gradient-flow/blob/HEAD/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from FerdTian/SrMMD, and GitHub detected no licence in that repository when it was checked","code_sha256":"e33acb41b3863b52","code_sha256_prefix":"e33acb41b3863b52","mcp_get_code":{"code_sha256":"e33acb41b3863b52"}}],"record_sha256":"5d4d69d0f5935a0735b88f0804a36e5cdcd8729913ea8e364399ae563699bf48","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}