{"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/train-transform","entry":"train_transform","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":5,"n_papers_ran_instrument_only":2,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"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":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":9,"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":"2607.17653","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-17653","title":"LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"iamjingli/LFM","path":"train_target.py","file_url":"https://github.com/iamjingli/LFM/blob/HEAD/train_target.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ada9656c14c75934","code_sha256_prefix":"ada9656c14c75934","mcp_get_code":{"code_sha256":"ada9656c14c75934"}},{"arxiv_id":"2403.03421","arxiv_id_is_arxiv":true,"paper":"/paper/lead-learning-decomposition-for-source-free","title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispc-lab/glc","path":"dataset/dataset.py","file_url":"https://github.com/ispc-lab/glc/blob/HEAD/dataset/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ispc-lab/glc when it was checked","code_sha256":"ada9656c14c75934","code_sha256_prefix":"ada9656c14c75934","mcp_get_code":{"code_sha256":"ada9656c14c75934"}},{"arxiv_id":"2308.16906","arxiv_id_is_arxiv":true,"paper":"/paper/fine-grained-cross-view-geo-localization-1","title":"Fine-Grained Cross-View Geo-Localization Using a Correlation-Aware Homography Estimator","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xlwangdev/hc-net","path":"models/utils/augment.py","file_url":"https://github.com/xlwangdev/hc-net/blob/HEAD/models/utils/augment.py","status":"ran","verification_level":1,"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, xlwangdev/hc-net when it was checked","code_sha256":"3e556e6b3e1fabe2","code_sha256_prefix":"3e556e6b3e1fabe2","mcp_get_code":{"code_sha256":"3e556e6b3e1fabe2"}},{"arxiv_id":"2303.14535","arxiv_id_is_arxiv":true,"paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Eacient/EfficientAD","path":"efficientad.py","file_url":"https://github.com/Eacient/EfficientAD/blob/HEAD/efficientad.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":"65449a6185e6dc7f","code_sha256_prefix":"65449a6185e6dc7f","mcp_get_code":{"code_sha256":"65449a6185e6dc7f"}},{"arxiv_id":"2303.14535","arxiv_id_is_arxiv":true,"paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Eacient/EfficientAD","path":"pretraining.py","file_url":"https://github.com/Eacient/EfficientAD/blob/HEAD/pretraining.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":"077ad902098508f5","code_sha256_prefix":"077ad902098508f5","mcp_get_code":{"code_sha256":"077ad902098508f5"}},{"arxiv_id":"2303.14535","arxiv_id_is_arxiv":true,"paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zaza-97/EfficientAD","path":"efficientad.py","file_url":"https://github.com/Zaza-97/EfficientAD/blob/HEAD/efficientad.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":"a213bdb9746b0401","code_sha256_prefix":"a213bdb9746b0401","mcp_get_code":{"code_sha256":"a213bdb9746b0401"}},{"arxiv_id":"2303.14535","arxiv_id_is_arxiv":true,"paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zaza-97/EfficientAD","path":"pretraining.py","file_url":"https://github.com/Zaza-97/EfficientAD/blob/HEAD/pretraining.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":"08b41ec7d5727026","code_sha256_prefix":"08b41ec7d5727026","mcp_get_code":{"code_sha256":"08b41ec7d5727026"}},{"arxiv_id":"2303.14535","arxiv_id_is_arxiv":true,"paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cinout/EfficientAD","path":"efficientad_twosteps.py","file_url":"https://github.com/cinout/EfficientAD/blob/HEAD/efficientad_twosteps.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":"b831876f274e1ec4","code_sha256_prefix":"b831876f274e1ec4","mcp_get_code":{"code_sha256":"b831876f274e1ec4"}},{"arxiv_id":"2303.14535","arxiv_id_is_arxiv":true,"paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cinout/EfficientAD","path":"pretraining.py","file_url":"https://github.com/cinout/EfficientAD/blob/HEAD/pretraining.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":"d1db9216b1ac0ae2","code_sha256_prefix":"d1db9216b1ac0ae2","mcp_get_code":{"code_sha256":"d1db9216b1ac0ae2"}},{"arxiv_id":"2112.00374","arxiv_id_is_arxiv":true,"paper":"/paper/clipstyler-image-style-transfer-with-a-single","title":"CLIPstyler: Image Style Transfer with a Single Text Condition","date":"2021-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paper11667/clipstyler","path":"train_fast.py","file_url":"https://github.com/paper11667/clipstyler/blob/HEAD/train_fast.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":"eb56729cc2a4d978","code_sha256_prefix":"eb56729cc2a4d978","mcp_get_code":{"code_sha256":"eb56729cc2a4d978"}},{"arxiv_id":"2105.11587","arxiv_id_is_arxiv":true,"paper":"/paper/srh-net-stacked-recurrent-hourglass-network","title":"SRH-Net: Stacked Recurrent Hourglass Network for Stereo Matching","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongzhidu/SRHNet","path":"dataloader/dataset.py","file_url":"https://github.com/hongzhidu/SRHNet/blob/HEAD/dataloader/dataset.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":"010a8bc4cac07920","code_sha256_prefix":"010a8bc4cac07920","mcp_get_code":{"code_sha256":"010a8bc4cac07920"}},{"arxiv_id":"Kwon_CLIPstyler_Image_Style_Transfer_With_a_Single_Text_Condition_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Kwon_CLIPstyler_Image_Style_Transfer_With_a_Single_Text_Condition_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cyclomon/CLIPstyler","path":"train_fast.py","file_url":"https://github.com/cyclomon/CLIPstyler/blob/HEAD/train_fast.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":"eb56729cc2a4d978","code_sha256_prefix":"eb56729cc2a4d978","mcp_get_code":{"code_sha256":"eb56729cc2a4d978"}}],"record_sha256":"62737741f0969b44f764be2e13d3b5d970c516258fb07020c79ac7bf0e92f972","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}