{"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/d-r1-loss","entry":"d_r1_loss","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":7,"n_papers_ran_no_instrument_failure":2,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"n_places_pointer_only_link_open":2,"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":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":"2304.07574","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-incompatible-knowledge-transfer-in","title":"Exploring Incompatible Knowledge Transfer in Few-shot Image Generation","date":"2023-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/RICK","path":"train_dynamic_update_prune.py","file_url":"https://github.com/yunqing-me/RICK/blob/HEAD/train_dynamic_update_prune.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from stevenshaw1999/rssa, and GitHub detected no licence in that repository when it was checked","code_sha256":"1fb99d8f83eb27f3","code_sha256_prefix":"1fb99d8f83eb27f3","mcp_get_code":{"code_sha256":"1fb99d8f83eb27f3"}},{"arxiv_id":"2210.16559","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-image-generation-via-adaptation","title":"Few-shot Image Generation via Adaptation-Aware Kernel Modulation","date":"2022-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/AdAM","path":"AdAM_importance_probing.py","file_url":"https://github.com/yunqing-me/AdAM/blob/HEAD/AdAM_importance_probing.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from stevenshaw1999/rssa, and GitHub detected no licence in that repository when it was checked","code_sha256":"1fb99d8f83eb27f3","code_sha256_prefix":"1fb99d8f83eb27f3","mcp_get_code":{"code_sha256":"1fb99d8f83eb27f3"}},{"arxiv_id":"2203.17266","arxiv_id_is_arxiv":true,"paper":"/paper/transeditor-transformer-based-dual-space-gan","title":"TransEditor: Transformer-Based Dual-Space GAN for Highly Controllable Facial Editing","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"billyxyb/transeditor","path":"train_spatial_query.py","file_url":"https://github.com/billyxyb/transeditor/blob/HEAD/train_spatial_query.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0693ac46c6c25e65","code_sha256_prefix":"0693ac46c6c25e65","mcp_get_code":{"code_sha256":"0693ac46c6c25e65"}},{"arxiv_id":"2203.16521","arxiv_id_is_arxiv":true,"paper":"/paper/coordgan-self-supervised-dense","title":"CoordGAN: Self-Supervised Dense Correspondences Emerge from GANs","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/CoordGAN","path":"loss/gan_loss.py","file_url":"https://github.com/NVlabs/CoordGAN/blob/HEAD/loss/gan_loss.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0693ac46c6c25e65","code_sha256_prefix":"0693ac46c6c25e65","mcp_get_code":{"code_sha256":"0693ac46c6c25e65"}},{"arxiv_id":"2203.04121","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-generative-model-adaption-via","title":"Few Shot Generative Model Adaption via Relaxed Spatial Structural Alignment","date":"2022-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevenshaw1999/rssa","path":"train_face_proj.py","file_url":"https://github.com/stevenshaw1999/rssa/blob/HEAD/train_face_proj.py","status":"unverified","verification_level":0,"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, stevenshaw1999/rssa when it was checked","code_sha256":"1fb99d8f83eb27f3","code_sha256_prefix":"1fb99d8f83eb27f3","mcp_get_code":{"code_sha256":"1fb99d8f83eb27f3"}},{"arxiv_id":"2112.10762","arxiv_id_is_arxiv":true,"paper":"/paper/styleswin-transformer-based-gan-for-high-1","title":"StyleSwin: Transformer-based GAN for High-resolution Image Generation","date":"2021-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/StyleSwin","path":"train_styleswin.py","file_url":"https://github.com/microsoft/StyleSwin/blob/HEAD/train_styleswin.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":"ea988988102f1c1d","code_sha256_prefix":"ea988988102f1c1d","mcp_get_code":{"code_sha256":"ea988988102f1c1d"}},{"arxiv_id":"2106.11485","arxiv_id_is_arxiv":true,"paper":"/paper/spatial-temporal-super-resolution-of","title":"Spatial-Temporal Super-Resolution of Satellite Imagery via Conditional Pixel Synthesis","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KellyYutongHe/satellite-pixel-synthesis-pytorch","path":"fmow_train_3dis.py","file_url":"https://github.com/KellyYutongHe/satellite-pixel-synthesis-pytorch/blob/HEAD/fmow_train_3dis.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, KellyYutongHe/satellite-pixel-synthesis-pytorch when it was checked","code_sha256":"0693ac46c6c25e65","code_sha256_prefix":"0693ac46c6c25e65","mcp_get_code":{"code_sha256":"0693ac46c6c25e65"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milmor/LadaGAN-pytorch","path":"utils.py","file_url":"https://github.com/milmor/LadaGAN-pytorch/blob/HEAD/utils.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":"0143fef228211c97","code_sha256_prefix":"0143fef228211c97","mcp_get_code":{"code_sha256":"0143fef228211c97"}},{"arxiv_id":"2001.04296","arxiv_id_is_arxiv":true,"paper":"/paper/high-fidelity-synthesis-with-disentangled","title":"High-Fidelity Synthesis with Disentangled Representation","date":"2020-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosinality/id-gan-pytorch","path":"train_gan.py","file_url":"https://github.com/rosinality/id-gan-pytorch/blob/HEAD/train_gan.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0693ac46c6c25e65","code_sha256_prefix":"0693ac46c6c25e65","mcp_get_code":{"code_sha256":"0693ac46c6c25e65"}},{"arxiv_id":"1910.05852","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-competitive-regularization-in-gans-1","title":"Implicit competitive regularization in GANs","date":"2019-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devzhk/Implicit-Competitive-Regularization","path":"losses.py","file_url":"https://github.com/devzhk/Implicit-Competitive-Regularization/blob/HEAD/losses.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":"0143fef228211c97","code_sha256_prefix":"0143fef228211c97","mcp_get_code":{"code_sha256":"0143fef228211c97"}}],"record_sha256":"5083dbfd79d1a40751e770aa6a699a5e31aefbea6f6c6bc5580b7fbd3668dbbd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}