{"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-out-size-same","entry":"conv_out_size_same","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":7,"n_places_pointer_only_link_open":4,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"utils.py","file_url":"https://github.com/khalooei/ALOCC-CVPR2018/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 xtarx/Unsupervised-Anomaly-Detection-with-Generative-Adversarial-Networks, and GitHub detected no licence in that repository when it was checked","code_sha256":"40125e1efb67fa92","code_sha256_prefix":"40125e1efb67fa92","mcp_get_code":{"code_sha256":"40125e1efb67fa92"}},{"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/model.py","file_url":"https://github.com/DingfanChen/GAN-Leaks/blob/HEAD/gan_models/dcgan/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 xtarx/Unsupervised-Anomaly-Detection-with-Generative-Adversarial-Networks, and GitHub detected no licence in that repository when it was checked","code_sha256":"40125e1efb67fa92","code_sha256_prefix":"40125e1efb67fa92","mcp_get_code":{"code_sha256":"40125e1efb67fa92"}},{"arxiv_id":"1902.03748","arxiv_id_is_arxiv":true,"paper":"/paper/peeking-into-the-future-predicting-future","title":"Peeking into the Future: Predicting Future Person Activities and Locations in Videos","date":"2019-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JunweiLiang/social-distancing-prediction","path":"code/inference/Object_Detection_Tracking/nn.py","file_url":"https://github.com/JunweiLiang/social-distancing-prediction/blob/HEAD/code/inference/Object_Detection_Tracking/nn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, JunweiLiang/social-distancing-prediction, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"40125e1efb67fa92","code_sha256_prefix":"40125e1efb67fa92","mcp_get_code":{"code_sha256":"40125e1efb67fa92"}},{"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/model.py","file_url":"https://github.com/POLane16/Robust-Conditional-GAN/blob/HEAD/mnist/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 xtarx/Unsupervised-Anomaly-Detection-with-Generative-Adversarial-Networks, and GitHub detected no licence in that repository when it was checked","code_sha256":"40125e1efb67fa92","code_sha256_prefix":"40125e1efb67fa92","mcp_get_code":{"code_sha256":"40125e1efb67fa92"}},{"arxiv_id":"1804.04391","arxiv_id_is_arxiv":true,"paper":"/paper/mggan-solving-mode-collapse-using-manifold","title":"MGGAN: Solving Mode Collapse using Manifold Guided Training","date":"2018-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QuickSolverKyle/Tensorflow-MyGANs","path":"ops.py","file_url":"https://github.com/QuickSolverKyle/Tensorflow-MyGANs/blob/HEAD/ops.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 xtarx/Unsupervised-Anomaly-Detection-with-Generative-Adversarial-Networks, and GitHub detected no licence in that repository when it was checked","code_sha256":"40125e1efb67fa92","code_sha256_prefix":"40125e1efb67fa92","mcp_get_code":{"code_sha256":"40125e1efb67fa92"}},{"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":"xtarx/Unsupervised-Anomaly-Detection-with-Generative-Adversarial-Networks","path":"model.py","file_url":"https://github.com/xtarx/Unsupervised-Anomaly-Detection-with-Generative-Adversarial-Networks/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xtarx/Unsupervised-Anomaly-Detection-with-Generative-Adversarial-Networks when it was checked","code_sha256":"40125e1efb67fa92","code_sha256_prefix":"40125e1efb67fa92","mcp_get_code":{"code_sha256":"40125e1efb67fa92"}},{"arxiv_id":"1511.06434","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-with-1","title":"Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"40125e1efb67fa92","code_sha256_prefix":"40125e1efb67fa92","mcp_get_code":{"code_sha256":"40125e1efb67fa92"}}],"record_sha256":"cef294f17ad484f24f5ef1f670d482ba0782fb0b52be62a2694be8ac6d5f042a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}