{"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/cdan","entry":"CDAN","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":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":8,"n_places_pointer_only_link_open":3,"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":0,"ran":2,"unverified":1},"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/loss.py","file_url":"https://github.com/zhangyl660/LERM/blob/HEAD/UDA/DA/CDAN-LERM/loss.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":"0372087a25c2c415","code_sha256_prefix":"0372087a25c2c415","mcp_get_code":{"code_sha256":"0372087a25c2c415"}},{"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/loss.py","file_url":"https://github.com/thuml/CDAN/blob/HEAD/pytorch/loss.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/CDAN when it was checked","code_sha256":"385d1e010dfb76a9","code_sha256_prefix":"385d1e010dfb76a9","mcp_get_code":{"code_sha256":"385d1e010dfb76a9"}},{"arxiv_id":"2310.17594","arxiv_id_is_arxiv":true,"paper":"/paper/spa-a-graph-spectral-alignment-perspective","title":"SPA: A Graph Spectral Alignment Perspective for Domain Adaptation","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CrownX/SPA","path":"code/loss.py","file_url":"https://github.com/CrownX/SPA/blob/HEAD/code/loss.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, CrownX/SPA when it was checked","code_sha256":"ca7dc4d6c6b6402c","code_sha256_prefix":"ca7dc4d6c6b6402c","mcp_get_code":{"code_sha256":"ca7dc4d6c6b6402c"}},{"arxiv_id":"2208.07591","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-guided-source-free-domain","title":"Uncertainty-guided Source-free Domain Adaptation","date":"2022-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roysubhankar/uncertainty-sfda","path":"cifar/loss.py","file_url":"https://github.com/roysubhankar/uncertainty-sfda/blob/HEAD/cifar/loss.py","status":"unverified","verification_level":0,"contract_check":null,"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 thuml/CDAN, and GitHub detected no licence in that repository when it was checked","code_sha256":"385d1e010dfb76a9","code_sha256_prefix":"385d1e010dfb76a9","mcp_get_code":{"code_sha256":"385d1e010dfb76a9"}},{"arxiv_id":"2107.12585","arxiv_id_is_arxiv":true,"paper":"/paper/nearest-neighborhood-based-deep-clustering","title":"Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation","date":"2021-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tntek/N2DCX","path":"object/loss.py","file_url":"https://github.com/tntek/N2DCX/blob/HEAD/object/loss.py","status":"unverified","verification_level":0,"contract_check":null,"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 thuml/CDAN, and GitHub detected no licence in that repository when it was checked","code_sha256":"385d1e010dfb76a9","code_sha256_prefix":"385d1e010dfb76a9","mcp_get_code":{"code_sha256":"385d1e010dfb76a9"}},{"arxiv_id":"2104.01539","arxiv_id_is_arxiv":true,"paper":"/paper/distill-and-fine-tune-effective-adaptation","title":"DINE: Domain Adaptation from Single and Multiple Black-box Predictors","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/SHOT","path":"object/loss.py","file_url":"https://github.com/tim-learn/SHOT/blob/HEAD/object/loss.py","status":"unverified","verification_level":0,"contract_check":null,"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 thuml/CDAN, and GitHub detected no licence in that repository when it was checked","code_sha256":"385d1e010dfb76a9","code_sha256_prefix":"385d1e010dfb76a9","mcp_get_code":{"code_sha256":"385d1e010dfb76a9"}},{"arxiv_id":"2104.00808","arxiv_id_is_arxiv":true,"paper":"/paper/curriculum-graph-co-teaching-for-multi-target","title":"Curriculum Graph Co-Teaching for Multi-Target Domain Adaptation","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Evgeneus/Graph-Domain-Adaptaion","path":"src/trainer.py","file_url":"https://github.com/Evgeneus/Graph-Domain-Adaptaion/blob/HEAD/src/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Evgeneus/Graph-Domain-Adaptaion when it was checked","code_sha256":"721c625a769522c5","code_sha256_prefix":"721c625a769522c5","mcp_get_code":{"code_sha256":"721c625a769522c5"}},{"arxiv_id":"2007.14612","arxiv_id_is_arxiv":true,"paper":"/paper/clarinet-a-one-step-approach-towards-budget","title":"Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation","date":"2020-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yiyang98/BFUDA","path":"ours/train_mu_et.py","file_url":"https://github.com/Yiyang98/BFUDA/blob/HEAD/ours/train_mu_et.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Yiyang98/BFUDA when it was checked","code_sha256":"266bec9da50e3ba1","code_sha256_prefix":"266bec9da50e3ba1","mcp_get_code":{"code_sha256":"266bec9da50e3ba1"}}],"record_sha256":"082a9f043aef7c1cab04129557d9bdaaaaae70bfcc81e5fd729bc4b6519181aa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}