{"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/test-transform","entry":"test_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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":8,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":6,"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":2,"ran_fixture":2,"ran":2,"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":"13b7b1c692c187e0","code_sha256_prefix":"13b7b1c692c187e0","mcp_get_code":{"code_sha256":"13b7b1c692c187e0"}},{"arxiv_id":"2409.10385","arxiv_id_is_arxiv":true,"paper":"/paper/mamba-st-state-space-model-for-efficient","title":"Mamba-ST: State Space Model for Efficient Style Transfer","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"filippobotti/mambast","path":"eval_time.py","file_url":"https://github.com/filippobotti/mambast/blob/HEAD/eval_time.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, filippobotti/mambast when it was checked","code_sha256":"44b1906941c2c3ed","code_sha256_prefix":"44b1906941c2c3ed","mcp_get_code":{"code_sha256":"44b1906941c2c3ed"}},{"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":"13b7b1c692c187e0","code_sha256_prefix":"13b7b1c692c187e0","mcp_get_code":{"code_sha256":"13b7b1c692c187e0"}},{"arxiv_id":"2210.00912","arxiv_id_is_arxiv":true,"paper":"/paper/federated-domain-generalization-for-image","title":"Federated Domain Generalization for Image Recognition via Cross-Client Style Transfer","date":"2022-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JeremyCJM/CCST","path":"style_transfer/AdaIN/CCST_OverallStyleTransfer.py","file_url":"https://github.com/JeremyCJM/CCST/blob/HEAD/style_transfer/AdaIN/CCST_OverallStyleTransfer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (CC0-1.0), but get_code serves the stored copy, first harvested from filippobotti/mambast, and GitHub detected no licence in that repository when it was checked","code_sha256":"44b1906941c2c3ed","code_sha256_prefix":"44b1906941c2c3ed","mcp_get_code":{"code_sha256":"44b1906941c2c3ed"}},{"arxiv_id":"2203.07740","arxiv_id_is_arxiv":true,"paper":"/paper/exact-feature-distribution-matching-for","title":"Exact Feature Distribution Matching for Arbitrary Style Transfer and Domain Generalization","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YBZh/EFDM","path":"ArbitraryStyleTransfer/view.py","file_url":"https://github.com/YBZh/EFDM/blob/HEAD/ArbitraryStyleTransfer/view.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":"939a94cc6cecc770","code_sha256_prefix":"939a94cc6cecc770","mcp_get_code":{"code_sha256":"939a94cc6cecc770"}},{"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":"evaluation.py","file_url":"https://github.com/hongzhidu/SRHNet/blob/HEAD/evaluation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a20b38ce75ecff0e","code_sha256_prefix":"a20b38ce75ecff0e","mcp_get_code":{"code_sha256":"a20b38ce75ecff0e"}},{"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":"c1f134ceee85415d","code_sha256_prefix":"c1f134ceee85415d","mcp_get_code":{"code_sha256":"c1f134ceee85415d"}},{"arxiv_id":"2010.13501","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-neural-architecture-search-for-1","title":"Hierarchical Neural Architecture Search for Deep Stereo Matching","date":"2020-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"a20b38ce75ecff0e","code_sha256_prefix":"a20b38ce75ecff0e","mcp_get_code":{"code_sha256":"a20b38ce75ecff0e"}},{"arxiv_id":"2006.07991","arxiv_id_is_arxiv":true,"paper":"/paper/emergent-properties-of-foveated-perceptual","title":"Emergent Properties of Foveated Perceptual Systems","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ArturoDeza/NeuroFovea_PyTorch","path":"Metamer_Transform.py","file_url":"https://github.com/ArturoDeza/NeuroFovea_PyTorch/blob/HEAD/Metamer_Transform.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 filippobotti/mambast, and GitHub detected no licence in that repository when it was checked","code_sha256":"44b1906941c2c3ed","code_sha256_prefix":"44b1906941c2c3ed","mcp_get_code":{"code_sha256":"44b1906941c2c3ed"}},{"arxiv_id":"1911.13287","arxiv_id_is_arxiv":true,"paper":"/paper/domain-invariant-stereo-matching-networks","title":"Domain-invariant Stereo Matching Networks","date":"2019-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"a20b38ce75ecff0e","code_sha256_prefix":"a20b38ce75ecff0e","mcp_get_code":{"code_sha256":"a20b38ce75ecff0e"}},{"arxiv_id":"1904.06587","arxiv_id_is_arxiv":true,"paper":"/paper/ga-net-guided-aggregation-net-for-end-to-end","title":"GA-Net: Guided Aggregation Net for End-to-end Stereo Matching","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skumailraza/FRSNet-GA","path":"predict.py","file_url":"https://github.com/skumailraza/FRSNet-GA/blob/HEAD/predict.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a20b38ce75ecff0e","code_sha256_prefix":"a20b38ce75ecff0e","mcp_get_code":{"code_sha256":"a20b38ce75ecff0e"}},{"arxiv_id":"1904.06587","arxiv_id_is_arxiv":true,"paper":"/paper/ga-net-guided-aggregation-net-for-end-to-end","title":"GA-Net: Guided Aggregation Net for End-to-end Stereo Matching","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skumailraza/FRSNet-GA","path":"evaluation.py","file_url":"https://github.com/skumailraza/FRSNet-GA/blob/HEAD/evaluation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"674d035839049ef2","code_sha256_prefix":"674d035839049ef2","mcp_get_code":{"code_sha256":"674d035839049ef2"}}],"record_sha256":"5ae10529a5382d684da939327dd0fcbe16beeece34a7d686ea0ce4b703589b34","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}