{"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/conv-cond-concat","entry":"conv_cond_concat","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":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":10,"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":4},"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":"2202.07857","arxiv_id_is_arxiv":true,"paper":"/paper/graph-augmented-normalizing-flows-for-anomaly-1","title":"Graph-Augmented Normalizing Flows for Anomaly Detection of Multiple Time Series","date":"2022-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khalooei/ALOCC-CVPR2018","path":"ops.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/ops.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":"97a17fbee43a92bd","code_sha256_prefix":"97a17fbee43a92bd","mcp_get_code":{"code_sha256":"97a17fbee43a92bd"}},{"arxiv_id":"1909.03935","arxiv_id_is_arxiv":true,"paper":"/paper/gan-leaks-a-taxonomy-of-membership-inference","title":"GAN-Leaks: A Taxonomy of Membership Inference Attacks against Generative Models","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/GAN-Leaks","path":"gan_models/dcgan/ops.py","file_url":"https://github.com/DingfanChen/GAN-Leaks/blob/HEAD/gan_models/dcgan/ops.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":"2906e84dbebc3e14","code_sha256_prefix":"2906e84dbebc3e14","mcp_get_code":{"code_sha256":"2906e84dbebc3e14"}},{"arxiv_id":"1811.11212","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-generative-adversarial","title":"Self-Supervised GANs via Auxiliary Rotation Loss","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vandit15/Self-Supervised-Gans-Pytorch","path":"ops.py","file_url":"https://github.com/vandit15/Self-Supervised-Gans-Pytorch/blob/HEAD/ops.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":"bc3f0c5701ef3b57","code_sha256_prefix":"bc3f0c5701ef3b57","mcp_get_code":{"code_sha256":"bc3f0c5701ef3b57"}},{"arxiv_id":"1811.03205","arxiv_id_is_arxiv":true,"paper":"/paper/robustness-of-conditional-gans-to-noisy","title":"Robustness of Conditional GANs to Noisy Labels","date":"2018-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"POLane16/Robust-Conditional-GAN","path":"mnist/ops.py","file_url":"https://github.com/POLane16/Robust-Conditional-GAN/blob/HEAD/mnist/ops.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":"97a17fbee43a92bd","code_sha256_prefix":"97a17fbee43a92bd","mcp_get_code":{"code_sha256":"97a17fbee43a92bd"}},{"arxiv_id":"1807.01442","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-sparse-deviations-for-compressed","title":"Modeling Sparse Deviations for Compressed Sensing using Generative Models","date":"2018-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ermongroup/sparse_gen","path":"celebA_dcgan/ops.py","file_url":"https://github.com/ermongroup/sparse_gen/blob/HEAD/celebA_dcgan/ops.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bcb75c6ee41f4e8c","code_sha256_prefix":"bcb75c6ee41f4e8c","mcp_get_code":{"code_sha256":"bcb75c6ee41f4e8c"}},{"arxiv_id":"1802.08406","arxiv_id_is_arxiv":true,"paper":"/paper/solving-linear-inverse-problems-using-gan","title":"Solving Linear Inverse Problems Using GAN Priors: An Algorithm with Provable Guarantees","date":"2018-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shahviraj/pgdgan","path":"celebA_dcgan/ops.py","file_url":"https://github.com/shahviraj/pgdgan/blob/HEAD/celebA_dcgan/ops.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bcb75c6ee41f4e8c","code_sha256_prefix":"bcb75c6ee41f4e8c","mcp_get_code":{"code_sha256":"bcb75c6ee41f4e8c"}},{"arxiv_id":"1703.05921","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-anomaly-detection-with","title":"Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discovery","date":"2017-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeeDoYup/AnoGAN","path":"ops.py","file_url":"https://github.com/LeeDoYup/AnoGAN/blob/HEAD/ops.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d5f19e9b7af11f57","code_sha256_prefix":"d5f19e9b7af11f57","mcp_get_code":{"code_sha256":"d5f19e9b7af11f57"}},{"arxiv_id":"1611.07004","arxiv_id_is_arxiv":true,"paper":"/paper/image-to-image-translation-with-conditional","title":"Image-to-Image Translation with Conditional Adversarial Networks","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yenchenlin/pix2pix-tensorflow","path":"ops.py","file_url":"https://github.com/yenchenlin/pix2pix-tensorflow/blob/HEAD/ops.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bcb75c6ee41f4e8c","code_sha256_prefix":"bcb75c6ee41f4e8c","mcp_get_code":{"code_sha256":"bcb75c6ee41f4e8c"}},{"arxiv_id":"1611.04488","arxiv_id_is_arxiv":true,"paper":"/paper/generative-models-and-model-criticism-via","title":"Generative Models and Model Criticism via Optimized Maximum Mean Discrepancy","date":"2016-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dougalsutherland/opt-mmd","path":"gan/ops.py","file_url":"https://github.com/dougalsutherland/opt-mmd/blob/HEAD/gan/ops.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":"f62556c1124a15ae","code_sha256_prefix":"f62556c1124a15ae","mcp_get_code":{"code_sha256":"f62556c1124a15ae"}},{"arxiv_id":"1609.07009","arxiv_id_is_arxiv":true,"paper":"/paper/is-the-deconvolution-layer-the-same-as-a","title":"Is the deconvolution layer the same as a convolutional layer?","date":"2016-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atriumlts/subpixel","path":"ops.py","file_url":"https://github.com/atriumlts/subpixel/blob/HEAD/ops.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":"f62556c1124a15ae","code_sha256_prefix":"f62556c1124a15ae","mcp_get_code":{"code_sha256":"f62556c1124a15ae"}}],"record_sha256":"f7ede5269f525db60c74bdb98a36b5d42aff0130f6209f7dd1bff6c9a783ef75","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}