{"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/gray2rgb","entry":"gray2rgb","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":10,"n_papers_ran_no_instrument_failure":10,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":3,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2411.01327","arxiv_id_is_arxiv":true,"paper":"/paper/visual-fourier-prompt-tuning","title":"Visual Fourier Prompt Tuning","date":"2024-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runtsang/vfpt","path":"src/models/vit_prompt/vit_fourier.py","file_url":"https://github.com/runtsang/vfpt/blob/HEAD/src/models/vit_prompt/vit_fourier.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, runtsang/vfpt (NOASSERTION)","code_sha256":"94402f271c35bec0","code_sha256_prefix":"94402f271c35bec0","mcp_get_code":{"code_sha256":"94402f271c35bec0"}},{"arxiv_id":"2404.12501","arxiv_id_is_arxiv":true,"paper":"/paper/spidepth-strengthened-pose-information-for","title":"SPIdepth: Strengthened Pose Information for Self-supervised Monocular Depth Estimation","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lavreniuk/SPIdepth","path":"CKA_visualize.py","file_url":"https://github.com/Lavreniuk/SPIdepth/blob/HEAD/CKA_visualize.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","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 runtsang/vfpt, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"94402f271c35bec0","code_sha256_prefix":"94402f271c35bec0","mcp_get_code":{"code_sha256":"94402f271c35bec0"}},{"arxiv_id":"1904.09709","arxiv_id_is_arxiv":true,"paper":"/paper/stgan-a-unified-selective-transfer-network","title":"STGAN: A Unified Selective Transfer Network for Arbitrary Image Attribute Editing","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csmliu/STGAN","path":"imlib/transform.py","file_url":"https://github.com/csmliu/STGAN/blob/HEAD/imlib/transform.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":"63a3d304071b7858","code_sha256_prefix":"63a3d304071b7858","mcp_get_code":{"code_sha256":"63a3d304071b7858"}},{"arxiv_id":"1904.02639","arxiv_id_is_arxiv":true,"paper":"/paper/memorizing-normality-to-detect-anomaly-memory","title":"Memorizing Normality to Detect Anomaly: Memory-augmented Deep Autoencoder for Unsupervised Anomaly Detection","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YeongHyeon/MemAE","path":"source/tf_process.py","file_url":"https://github.com/YeongHyeon/MemAE/blob/HEAD/source/tf_process.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":"aa166086c035e6eb","code_sha256_prefix":"aa166086c035e6eb","mcp_get_code":{"code_sha256":"aa166086c035e6eb"}},{"arxiv_id":"1901.08954","arxiv_id_is_arxiv":true,"paper":"/paper/skip-ganomaly-skip-connected-and","title":"Skip-GANomaly: Skip Connected and Adversarially Trained Encoder-Decoder Anomaly Detection","date":"2019-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YeongHyeon/Skip-GANomaly","path":"source/tf_process.py","file_url":"https://github.com/YeongHyeon/Skip-GANomaly/blob/HEAD/source/tf_process.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":"aa166086c035e6eb","code_sha256_prefix":"aa166086c035e6eb","mcp_get_code":{"code_sha256":"aa166086c035e6eb"}},{"arxiv_id":"1805.06725","arxiv_id_is_arxiv":true,"paper":"/paper/ganomaly-semi-supervised-anomaly-detection","title":"GANomaly: Semi-Supervised Anomaly Detection via Adversarial Training","date":"2018-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YeongHyeon/GANomaly","path":"source/tf_process.py","file_url":"https://github.com/YeongHyeon/GANomaly/blob/HEAD/source/tf_process.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":"aa166086c035e6eb","code_sha256_prefix":"aa166086c035e6eb","mcp_get_code":{"code_sha256":"aa166086c035e6eb"}},{"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":"YeongHyeon/f-AnoGAN-TF","path":"source/tf_process.py","file_url":"https://github.com/YeongHyeon/f-AnoGAN-TF/blob/HEAD/source/tf_process.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":"aa166086c035e6eb","code_sha256_prefix":"aa166086c035e6eb","mcp_get_code":{"code_sha256":"aa166086c035e6eb"}},{"arxiv_id":"1611.09326","arxiv_id_is_arxiv":true,"paper":"/paper/the-one-hundred-layers-tiramisu-fully","title":"The One Hundred Layers Tiramisu: Fully Convolutional DenseNets for Semantic Segmentation","date":"2016-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ankit-vaghela30/Cilia-Segmentation","path":"hastings/preprocessing.py","file_url":"https://github.com/ankit-vaghela30/Cilia-Segmentation/blob/HEAD/hastings/preprocessing.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":"229fb6fceb2b565a","code_sha256_prefix":"229fb6fceb2b565a","mcp_get_code":{"code_sha256":"229fb6fceb2b565a"}},{"arxiv_id":"1611.06355","arxiv_id_is_arxiv":true,"paper":"/paper/invertible-conditional-gans-for-image-editing","title":"Invertible Conditional GANs for image editing","date":"2016-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nguyenquangduc2000/AttGAN","path":"imlib/transform.py","file_url":"https://github.com/nguyenquangduc2000/AttGAN/blob/HEAD/imlib/transform.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":"63a3d304071b7858","code_sha256_prefix":"63a3d304071b7858","mcp_get_code":{"code_sha256":"63a3d304071b7858"}},{"arxiv_id":"aaai_28383","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28383","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hisfog/SfMNeXt-Impl","path":"CKA_visualize.py","file_url":"https://github.com/hisfog/SfMNeXt-Impl/blob/HEAD/CKA_visualize.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","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 runtsang/vfpt, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"94402f271c35bec0","code_sha256_prefix":"94402f271c35bec0","mcp_get_code":{"code_sha256":"94402f271c35bec0"}}],"record_sha256":"fecd315283d6ee99e0aa9ae92d5f627e940e8ed73b68cb36222e44727b7c806f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}