{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-grad","entry":"get_grad","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":3,"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":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":5},"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":"2410.10637","paper":"/paper/high-dimensional-differential-parameter","title":"High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leyangw/tsm","path":"debiased/objective.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/debiased/objective.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1ef8a1b671e98c3","mcp_get_code":{"code_sha256":"d1ef8a1b671e98c3"}},{"arxiv_id":"2307.12732","paper":"/paper/clip-kd-an-empirical-study-of-distilling-clip","title":"CLIP-KD: An Empirical Study of CLIP Model Distillation","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"winycg/clip-kd","path":"src/open_clip/loss.py","file_url":"https://github.com/winycg/clip-kd/blob/HEAD/src/open_clip/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ba49abe4c9f896d0","mcp_get_code":{"code_sha256":"ba49abe4c9f896d0"}},{"arxiv_id":"2302.00924","paper":"/paper/lmc-fast-training-of-gnns-via-subgraph","title":"LMC: Fast Training of GNNs via Subgraph Sampling with Provable Convergence","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miralab-ustc/gnn-lmc","path":"main_large.py","file_url":"https://github.com/miralab-ustc/gnn-lmc/blob/HEAD/main_large.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e51c5efdfe74dde7","mcp_get_code":{"code_sha256":"e51c5efdfe74dde7"}},{"arxiv_id":"2211.14694","paper":"/paper/diggan-discriminator-gradient-gap","title":"DigGAN: Discriminator gradIent Gap Regularization for GAN Training with Limited Data","date":"2022-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ailsaf/diggan","path":"DiffAugment-biggan-cifar/train_fns.py","file_url":"https://github.com/ailsaf/diggan/blob/HEAD/DiffAugment-biggan-cifar/train_fns.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c2b7a09ca1d51891","mcp_get_code":{"code_sha256":"c2b7a09ca1d51891"}},{"arxiv_id":"2211.05109","paper":"/paper/vitality-unifying-low-rank-and-sparse","title":"ViTALiTy: Unifying Low-rank and Sparse Approximation for Vision Transformer Acceleration with a Linear Taylor Attention","date":"2022-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GATECH-EIC/ViTaLiTy","path":"src/quantize.py","file_url":"https://github.com/GATECH-EIC/ViTaLiTy/blob/HEAD/src/quantize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"66ea78e93ec5b48e","mcp_get_code":{"code_sha256":"66ea78e93ec5b48e"}},{"arxiv_id":"2208.00453","paper":"/paper/one-shot-medical-landmark-localization-by","title":"One-Shot Medical Landmark Localization by Edge-Guided Transform and Noisy Landmark Refinement","date":"2022-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GoldExcalibur/EdgeTrans4Mark","path":"lib/core/loss.py","file_url":"https://github.com/GoldExcalibur/EdgeTrans4Mark/blob/HEAD/lib/core/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eb211362afd244c4","mcp_get_code":{"code_sha256":"eb211362afd244c4"}},{"arxiv_id":"2006.07556","paper":"/paper/neural-architecture-search-using-bayesian","title":"Interpretable Neural Architecture Search via Bayesian Optimisation with Weisfeiler-Lehman Kernels","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingchenwan/nasbowl","path":"bayesopt/gp.py","file_url":"https://github.com/xingchenwan/nasbowl/blob/HEAD/bayesopt/gp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f165eea0619d62c","mcp_get_code":{"code_sha256":"3f165eea0619d62c"}},{"arxiv_id":"aaai_20582","paper":null,"title":"arXiv:aaai_20582","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tksmatsubara/discrete-autograd","path":"dgnet/modules.py","file_url":"https://github.com/tksmatsubara/discrete-autograd/blob/HEAD/dgnet/modules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"00add3423571f820","mcp_get_code":{"code_sha256":"00add3423571f820"}}]}