{"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/image-classification-test","entry":"image_classification_test","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":11,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":3,"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":12,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":9,"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":2,"ran":1,"unverified":9},"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":"2406.02862","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-guidance-information-to-utilize","title":"Rethinking Guidance Information to Utilize Unlabeled Samples:A Label Encoding Perspective","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyl660/LERM","path":"UDA/DA/CDAN-LERM/train_image.py","file_url":"https://github.com/zhangyl660/LERM/blob/HEAD/UDA/DA/CDAN-LERM/train_image.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, zhangyl660/LERM when it was checked","code_sha256":"16f4eb1e884b4253","code_sha256_prefix":"16f4eb1e884b4253","mcp_get_code":{"code_sha256":"16f4eb1e884b4253"}},{"arxiv_id":"2402.01887","arxiv_id_is_arxiv":true,"paper":"/paper/on-f-divergence-principled-domain-adaptation","title":"On $f$-Divergence Principled Domain Adaptation: An Improved Framework","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/CDAN","path":"pytorch/train_image.py","file_url":"https://github.com/thuml/CDAN/blob/HEAD/pytorch/train_image.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, thuml/CDAN when it was checked","code_sha256":"dd5b0e1fe8cd7d78","code_sha256_prefix":"dd5b0e1fe8cd7d78","mcp_get_code":{"code_sha256":"dd5b0e1fe8cd7d78"}},{"arxiv_id":"2205.06549","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-structure-texture-separation","title":"Unsupervised Structure-Texture Separation Network for Oracle Character Recognition","date":"2022-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wm-bupt/STSN","path":"train_base.py","file_url":"https://github.com/wm-bupt/STSN/blob/HEAD/train_base.py","status":"unverified","verification_level":0,"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":"b83ec8e72956e6e5","code_sha256_prefix":"b83ec8e72956e6e5","mcp_get_code":{"code_sha256":"b83ec8e72956e6e5"}},{"arxiv_id":"2107.06154","arxiv_id_is_arxiv":true,"paper":"/paper/fast-batch-nuclear-norm-maximization-and","title":"Fast Batch Nuclear-norm Maximization and Minimization for Robust Domain Adaptation","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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":"ffe52a5a2d8c2a02","code_sha256_prefix":"ffe52a5a2d8c2a02","mcp_get_code":{"code_sha256":"ffe52a5a2d8c2a02"}},{"arxiv_id":"2103.03606","arxiv_id_is_arxiv":true,"paper":"/paper/unbalanced-minibatch-optimal-transport","title":"Unbalanced minibatch Optimal Transport; applications to Domain Adaptation","date":"2021-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kilianFatras/JUMBOT","path":"Domain_Adaptation/train_jumbot.py","file_url":"https://github.com/kilianFatras/JUMBOT/blob/HEAD/Domain_Adaptation/train_jumbot.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":"b1fd9ef2c839bac2","code_sha256_prefix":"b1fd9ef2c839bac2","mcp_get_code":{"code_sha256":"b1fd9ef2c839bac2"}},{"arxiv_id":"2004.12615","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-density-divergence-for-domain","title":"Maximum Density Divergence for Domain Adaptation","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lijin118/ATM","path":"train_image.py","file_url":"https://github.com/lijin118/ATM/blob/HEAD/train_image.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, lijin118/ATM when it was checked","code_sha256":"dd5b0e1fe8cd7d78","code_sha256_prefix":"dd5b0e1fe8cd7d78","mcp_get_code":{"code_sha256":"dd5b0e1fe8cd7d78"}},{"arxiv_id":"2003.13183","arxiv_id_is_arxiv":true,"paper":"/paper/gradually-vanishing-bridge-for-adversarial","title":"Gradually Vanishing Bridge for Adversarial Domain Adaptation","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuishuhao/GVB","path":"GVB-GD/train_image.py","file_url":"https://github.com/cuishuhao/GVB/blob/HEAD/GVB-GD/train_image.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db70d563ababdeb8","code_sha256_prefix":"db70d563ababdeb8","mcp_get_code":{"code_sha256":"db70d563ababdeb8"}},{"arxiv_id":"2003.13183","arxiv_id_is_arxiv":true,"paper":"/paper/gradually-vanishing-bridge-for-adversarial","title":"Gradually Vanishing Bridge for Adversarial Domain Adaptation","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuishuhao/GVB","path":"CDAN-GD/train_image.py","file_url":"https://github.com/cuishuhao/GVB/blob/HEAD/CDAN-GD/train_image.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":"b83705aef1d57116","code_sha256_prefix":"b83705aef1d57116","mcp_get_code":{"code_sha256":"b83705aef1d57116"}},{"arxiv_id":"2003.12237","arxiv_id_is_arxiv":true,"paper":"/paper/towards-discriminability-and-diversity-batch","title":"Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situations","date":"2020-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuishuhao/BNM","path":"DA/BNM/train_image.py","file_url":"https://github.com/cuishuhao/BNM/blob/HEAD/DA/BNM/train_image.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":"ffe52a5a2d8c2a02","code_sha256_prefix":"ffe52a5a2d8c2a02","mcp_get_code":{"code_sha256":"ffe52a5a2d8c2a02"}},{"arxiv_id":"2003.05636","arxiv_id_is_arxiv":true,"paper":"/paper/fisher-deep-domain-adaptation","title":"Fisher Deep Domain Adaptation","date":"2020-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/FisherDA","path":"src/train_ada.py","file_url":"https://github.com/HKUST-KnowComp/FisherDA/blob/HEAD/src/train_ada.py","status":"unverified","verification_level":0,"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, HKUST-KnowComp/FisherDA when it was checked","code_sha256":"5af9c39e75ddeebd","code_sha256_prefix":"5af9c39e75ddeebd","mcp_get_code":{"code_sha256":"5af9c39e75ddeebd"}},{"arxiv_id":"2003.05636","arxiv_id_is_arxiv":true,"paper":"/paper/fisher-deep-domain-adaptation","title":"Fisher Deep Domain Adaptation","date":"2020-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/FisherDA","path":"src/eval_da.py","file_url":"https://github.com/HKUST-KnowComp/FisherDA/blob/HEAD/src/eval_da.py","status":"unverified","verification_level":0,"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, HKUST-KnowComp/FisherDA when it was checked","code_sha256":"fdbce7356b772ec7","code_sha256_prefix":"fdbce7356b772ec7","mcp_get_code":{"code_sha256":"fdbce7356b772ec7"}},{"arxiv_id":"1912.03699","arxiv_id_is_arxiv":true,"paper":"/paper/less-confusion-more-transferable-minimum","title":"Minimum Class Confusion for Versatile Domain Adaptation","date":"2019-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/Versatile-Domain-Adaptation","path":"pytorch/train_image_office.py","file_url":"https://github.com/thuml/Versatile-Domain-Adaptation/blob/HEAD/pytorch/train_image_office.py","status":"unverified","verification_level":0,"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, thuml/Versatile-Domain-Adaptation when it was checked","code_sha256":"3a55299001ec8870","code_sha256_prefix":"3a55299001ec8870","mcp_get_code":{"code_sha256":"3a55299001ec8870"}},{"arxiv_id":"1912.03699","arxiv_id_is_arxiv":true,"paper":"/paper/less-confusion-more-transferable-minimum","title":"Minimum Class Confusion for Versatile Domain Adaptation","date":"2019-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/Versatile-Domain-Adaptation","path":"pytorch/train_image_visda.py","file_url":"https://github.com/thuml/Versatile-Domain-Adaptation/blob/HEAD/pytorch/train_image_visda.py","status":"unverified","verification_level":0,"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, thuml/Versatile-Domain-Adaptation when it was checked","code_sha256":"6fbf1ba21421577f","code_sha256_prefix":"6fbf1ba21421577f","mcp_get_code":{"code_sha256":"6fbf1ba21421577f"}},{"arxiv_id":"1808.04205","arxiv_id_is_arxiv":true,"paper":"/paper/partial-adversarial-domain-adaptation","title":"Partial Adversarial Domain Adaptation","date":"2018-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/PADA","path":"pytorch/src/train_pada.py","file_url":"https://github.com/thuml/PADA/blob/HEAD/pytorch/src/train_pada.py","status":"unverified","verification_level":0,"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, thuml/PADA when it was checked","code_sha256":"f876454bcd479a54","code_sha256_prefix":"f876454bcd479a54","mcp_get_code":{"code_sha256":"f876454bcd479a54"}}],"record_sha256":"8cf1a724417bd83ab344a63806517c2446bccb02e94971a90e40e1832796eadd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}