{"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/requires-grad","entry":"requires_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":5,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"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":"2404.16482","arxiv_id_is_arxiv":true,"paper":"/paper/cocog-controllable-visual-stimuli-generation","title":"CoCoG: Controllable Visual Stimuli Generation based on Human Concept Representations","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ncclab-sustech/CoCoG","path":"diffusion_prior.py","file_url":"https://github.com/ncclab-sustech/CoCoG/blob/HEAD/diffusion_prior.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, ncclab-sustech/CoCoG when it was checked","code_sha256":"45749b455d0b1396","code_sha256_prefix":"45749b455d0b1396","mcp_get_code":{"code_sha256":"45749b455d0b1396"}},{"arxiv_id":"2308.08774","arxiv_id_is_arxiv":true,"paper":"/paper/differential-privacy-linguistic-fairness-and","title":"Differential Privacy, Linguistic Fairness, and Training Data Influence: Impossibility and Possibility Theorems for Multilingual Language Models","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lxuechen/private-transformers","path":"private_transformers/autograd_grad_sample.py","file_url":"https://github.com/lxuechen/private-transformers/blob/HEAD/private_transformers/autograd_grad_sample.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":"5bfe971f0927820a","code_sha256_prefix":"5bfe971f0927820a","mcp_get_code":{"code_sha256":"5bfe971f0927820a"}},{"arxiv_id":"2210.08884","arxiv_id_is_arxiv":true,"paper":"/paper/hyperdomainnet-universal-domain-adaptation","title":"HyperDomainNet: Universal Domain Adaptation for Generative Adversarial Networks","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"macderru/hyperdomainnet","path":"core/uda_models.py","file_url":"https://github.com/macderru/hyperdomainnet/blob/HEAD/core/uda_models.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":"cee6bfbe557ea802","code_sha256_prefix":"cee6bfbe557ea802","mcp_get_code":{"code_sha256":"cee6bfbe557ea802"}},{"arxiv_id":"2203.10821","arxiv_id_is_arxiv":true,"paper":"/paper/sem2nerf-converting-single-view-semantic","title":"Sem2NeRF: Converting Single-View Semantic Masks to Neural Radiance Fields","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donydchen/sem2nerf","path":"models/sem2nerf.py","file_url":"https://github.com/donydchen/sem2nerf/blob/HEAD/models/sem2nerf.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":"25218039775cffd9","code_sha256_prefix":"25218039775cffd9","mcp_get_code":{"code_sha256":"25218039775cffd9"}},{"arxiv_id":"1510.01799","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-per-example-gradient-computations","title":"Efficient Per-Example Gradient Computations","date":"2015-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jialinmao/private_cnn","path":"private_CNN/privacy_utils/autograd_grad_sample.py","file_url":"https://github.com/jialinmao/private_cnn/blob/HEAD/private_CNN/privacy_utils/autograd_grad_sample.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jialinmao/private_cnn when it was checked","code_sha256":"e2f29e0a6eca5ddb","code_sha256_prefix":"e2f29e0a6eca5ddb","mcp_get_code":{"code_sha256":"e2f29e0a6eca5ddb"}}],"record_sha256":"3a23b4cb729af76f9bc89f24a6f91c85d031383390c77c99b56be715670fcbdb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}