{"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/entropy-2","entry":"Entropy","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":31,"n_papers_ran":29,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":17,"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":18,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":5,"n_samples_unverified":2,"n_samples_fingerprinted":15,"n_places":33,"n_places_pointer_only":18,"n_places_pointer_only_link_open":7,"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":3,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":1,"ran":8,"unverified":2},"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":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2605.01369","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01369","title":"MU-SHOT-Fi: Self-Supervised Multi-User Wi-Fi Sensing with Source-free Unsupervised Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"AhmedRadwan02/mu-shot-fi","path":"WiDAR/SHOT/loss.py","file_url":"https://github.com/AhmedRadwan02/mu-shot-fi/blob/HEAD/WiDAR/SHOT/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AhmedRadwan02/mu-shot-fi when it was checked","code_sha256":"866722884763b224","code_sha256_prefix":"866722884763b224","mcp_get_code":{"code_sha256":"866722884763b224"}},{"arxiv_id":"2503.14564","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2503.14564","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":null,"repo":"flash1803/EATTA","path":"classification/methods/eatta.py","file_url":"https://github.com/flash1803/EATTA/blob/HEAD/classification/methods/eatta.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":"9e77fe01c3502ba4","code_sha256_prefix":"9e77fe01c3502ba4","mcp_get_code":{"code_sha256":"9e77fe01c3502ba4"}},{"arxiv_id":"2412.14301","arxiv_id_is_arxiv":true,"paper":"/paper/what-has-been-overlooked-in-contrastive","title":"What Has Been Overlooked in Contrastive Source-Free Domain Adaptation: Leveraging Source-Informed Latent Augmentation within Neighborhood Context","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingwang18/silan","path":"adaptation_office.py","file_url":"https://github.com/jingwang18/silan/blob/HEAD/adaptation_office.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jingwang18/silan when it was checked","code_sha256":"a29c88002bbdc7f5","code_sha256_prefix":"a29c88002bbdc7f5","mcp_get_code":{"code_sha256":"a29c88002bbdc7f5"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"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":"utils/net_utils.py","file_url":"https://github.com/ispc-lab/glc/blob/HEAD/utils/net_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2403.01966","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-information-maximization-with","title":"Enhancing Information Maximization with Distance-Aware Contrastive Learning for Source-Free Cross-Domain Few-Shot Learning","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhuali-mxj/im-dcl","path":"adapt_da.py","file_url":"https://github.com/xuhuali-mxj/im-dcl/blob/HEAD/adapt_da.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xuhuali-mxj/im-dcl when it was checked","code_sha256":"e9f124f4e6ac515e","code_sha256_prefix":"e9f124f4e6ac515e","mcp_get_code":{"code_sha256":"e9f124f4e6ac515e"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2311.17276","arxiv_id_is_arxiv":true,"paper":"/paper/machine-unlearning-in-learned-databases-an","title":"Machine Unlearning in Learned Databases: An Experimental Analysis","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"meghdadk/db_unlearning","path":"naru/train_model.py","file_url":"https://github.com/meghdadk/db_unlearning/blob/HEAD/naru/train_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6c3c093da58e8e3","code_sha256_prefix":"b6c3c093da58e8e3","mcp_get_code":{"code_sha256":"b6c3c093da58e8e3"}},{"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":true,"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":"300ab0eab2ed7c3e","code_sha256_prefix":"300ab0eab2ed7c3e","mcp_get_code":{"code_sha256":"300ab0eab2ed7c3e"}},{"arxiv_id":"2305.00593","arxiv_id_is_arxiv":true,"paper":"/paper/reliable-gradient-free-and-likelihood-free","title":"Reliable Gradient-free and Likelihood-free Prompt Tuning","date":"2023-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maohaos2/SBI_LLM","path":"utils.py","file_url":"https://github.com/maohaos2/SBI_LLM/blob/HEAD/utils.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":"1e1c05bc5a2f0504","code_sha256_prefix":"1e1c05bc5a2f0504","mcp_get_code":{"code_sha256":"1e1c05bc5a2f0504"}},{"arxiv_id":"2302.06359","arxiv_id_is_arxiv":true,"paper":"/paper/fixing-overconfidence-in-dynamic-neural","title":"Fixing Overconfidence in Dynamic Neural Networks","date":"2023-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaltoml/calibrated-dnn","path":"adaptive_inference.py","file_url":"https://github.com/aaltoml/calibrated-dnn/blob/HEAD/adaptive_inference.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":"045fc85256f7d946","code_sha256_prefix":"045fc85256f7d946","mcp_get_code":{"code_sha256":"045fc85256f7d946"}},{"arxiv_id":"2210.05508","arxiv_id_is_arxiv":true,"paper":"/paper/detect-distill-and-update-learned-db-systems","title":"Detect, Distill and Update: Learned DB Systems Facing Out of Distribution Data","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meghdadk/DDUp","path":"Naru/DMV/eval_model.py","file_url":"https://github.com/meghdadk/DDUp/blob/HEAD/Naru/DMV/eval_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6c3c093da58e8e3","code_sha256_prefix":"b6c3c093da58e8e3","mcp_get_code":{"code_sha256":"b6c3c093da58e8e3"}},{"arxiv_id":"2209.15404","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-theoretic-approach-to-9","title":"Entropy-driven Unsupervised Keypoint Representation Learning in Videos","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"irosa-lab/mint","path":"src/mint/entropy_layer/entropy.py","file_url":"https://github.com/irosa-lab/mint/blob/HEAD/src/mint/entropy_layer/entropy.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":"d62ce5e00f9ef4c4","code_sha256_prefix":"d62ce5e00f9ef4c4","mcp_get_code":{"code_sha256":"d62ce5e00f9ef4c4"}},{"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":"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":"f3ce545fc143fc83","code_sha256_prefix":"f3ce545fc143fc83","mcp_get_code":{"code_sha256":"f3ce545fc143fc83"}},{"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":"toy_classification/multiclass_shot.py","file_url":"https://github.com/roysubhankar/uncertainty-sfda/blob/HEAD/toy_classification/multiclass_shot.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":"618b4bb0ee3cb5eb","code_sha256_prefix":"618b4bb0ee3cb5eb","mcp_get_code":{"code_sha256":"618b4bb0ee3cb5eb"}},{"arxiv_id":"2207.13247","arxiv_id_is_arxiv":true,"paper":"/paper/concurrent-subsidiary-supervision-for","title":"Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptation","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albert0147/sfda_neighbors","path":"train_src.py","file_url":"https://github.com/albert0147/sfda_neighbors/blob/HEAD/train_src.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 albert0147/aad_sfda, and GitHub detected no licence in that repository when it was checked","code_sha256":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2207.08877","arxiv_id_is_arxiv":true,"paper":"/paper/prior-knowledge-guided-unsupervised-domain","title":"Prior Knowledge Guided Unsupervised Domain Adaptation","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsun/KUDA","path":"DINE/loss.py","file_url":"https://github.com/tsun/KUDA/blob/HEAD/DINE/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 albert0147/aad_sfda, and GitHub detected no licence in that repository when it was checked","code_sha256":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2205.04183","arxiv_id_is_arxiv":true,"paper":"/paper/local-prediction-aggregation-a-frustratingly","title":"Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation","date":"2022-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albert0147/aad_sfda","path":"tar_adaptation.py","file_url":"https://github.com/albert0147/aad_sfda/blob/HEAD/tar_adaptation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, albert0147/aad_sfda when it was checked","code_sha256":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2202.06174","arxiv_id_is_arxiv":true,"paper":"/paper/source-free-progressive-graph-learning-for","title":"Source-Free Progressive Graph Learning for Open-Set Domain Adaptation","date":"2022-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luoyadan/sf-pgl","path":"utils/loss.py","file_url":"https://github.com/luoyadan/sf-pgl/blob/HEAD/utils/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 albert0147/aad_sfda, and GitHub detected no licence in that repository when it was checked","code_sha256":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2202.00796","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-benefits-of-selectivity-in-pseudo","title":"On Balancing Bias and Variance in Unsupervised Multi-Source-Free Domain Adaptation","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maohaos2/MSFDA","path":"loss.py","file_url":"https://github.com/maohaos2/MSFDA/blob/HEAD/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 albert0147/aad_sfda, and GitHub detected no licence in that repository when it was checked","code_sha256":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2112.00955","arxiv_id_is_arxiv":true,"paper":"/paper/source-free-unsupervised-graph-domain","title":"Source Free Unsupervised Graph Domain Adaptation","date":"2021-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haitaomao/soga","path":"codes/model/model_utilies.py","file_url":"https://github.com/haitaomao/soga/blob/HEAD/codes/model/model_utilies.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":"5a57a71c4462a38e","code_sha256_prefix":"5a57a71c4462a38e","mcp_get_code":{"code_sha256":"5a57a71c4462a38e"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 albert0147/aad_sfda, and GitHub detected no licence in that repository when it was checked","code_sha256":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"arxiv_id":"2107.11055","arxiv_id_is_arxiv":true,"paper":"/paper/transporting-causal-mechanisms-for","title":"Transporting Causal Mechanisms for Unsupervised Domain Adaptation","date":"2021-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yue-zhongqi/tcm","path":"dda_model/dda_model.py","file_url":"https://github.com/yue-zhongqi/tcm/blob/HEAD/dda_model/dda_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yue-zhongqi/tcm when it was checked","code_sha256":"a4fb3d7d83bd280c","code_sha256_prefix":"a4fb3d7d83bd280c","mcp_get_code":{"code_sha256":"a4fb3d7d83bd280c"}},{"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/Dis-tune","path":"loss.py","file_url":"https://github.com/tim-learn/Dis-tune/blob/HEAD/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 albert0147/aad_sfda, and GitHub detected no licence in that repository when it was checked","code_sha256":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}},{"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":"digit/loss.py","file_url":"https://github.com/tim-learn/SHOT/blob/HEAD/digit/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"866722884763b224","code_sha256_prefix":"866722884763b224","mcp_get_code":{"code_sha256":"866722884763b224"}},{"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":true,"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":"ab338e78525a1a07","code_sha256_prefix":"ab338e78525a1a07","mcp_get_code":{"code_sha256":"ab338e78525a1a07"}},{"arxiv_id":"2012.07297","arxiv_id_is_arxiv":true,"paper":"/paper/source-data-absent-unsupervised-domain","title":"Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer","date":"2020-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/SHOT-plus","path":"code/digit/uda_digit.py","file_url":"https://github.com/tim-learn/SHOT-plus/blob/HEAD/code/digit/uda_digit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"866722884763b224","code_sha256_prefix":"866722884763b224","mcp_get_code":{"code_sha256":"866722884763b224"}},{"arxiv_id":"2005.01912","arxiv_id_is_arxiv":true,"paper":"/paper/renormalized-mutual-information-for","title":"Renormalized Mutual Information for Artificial Scientific Discovery","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lsarra/rmi","path":"rmi/estimation.py","file_url":"https://github.com/lsarra/rmi/blob/HEAD/rmi/estimation.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":"cc92bdd970182d6c","code_sha256_prefix":"cc92bdd970182d6c","mcp_get_code":{"code_sha256":"cc92bdd970182d6c"}},{"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":"UODR/train_loader.py","file_url":"https://github.com/cuishuhao/BNM/blob/HEAD/UODR/train_loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54f9f530b53b6db0","code_sha256_prefix":"54f9f530b53b6db0","mcp_get_code":{"code_sha256":"54f9f530b53b6db0"}},{"arxiv_id":"2003.02541","arxiv_id_is_arxiv":true,"paper":"/paper/a-balanced-and-uncertainty-aware-approach-for","title":"A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation","date":"2020-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/BA3US","path":"my_loss.py","file_url":"https://github.com/tim-learn/BA3US/blob/HEAD/my_loss.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":"792f32c0291a5af7","code_sha256_prefix":"792f32c0291a5af7","mcp_get_code":{"code_sha256":"792f32c0291a5af7"}},{"arxiv_id":"1502.03509","arxiv_id_is_arxiv":true,"paper":"/paper/made-masked-autoencoder-for-distribution","title":"MADE: Masked Autoencoder for Distribution Estimation","date":"2015-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naru-project/naru","path":"train_model.py","file_url":"https://github.com/naru-project/naru/blob/HEAD/train_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6c3c093da58e8e3","code_sha256_prefix":"b6c3c093da58e8e3","mcp_get_code":{"code_sha256":"b6c3c093da58e8e3"}},{"arxiv_id":"Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tim-learn/DINE","path":"loss.py","file_url":"https://github.com/tim-learn/DINE/blob/HEAD/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 albert0147/aad_sfda, and GitHub detected no licence in that repository when it was checked","code_sha256":"94b5622f0aa7add1","code_sha256_prefix":"94b5622f0aa7add1","mcp_get_code":{"code_sha256":"94b5622f0aa7add1"}}],"record_sha256":"fff943b1f143aeac8a5565083d8cad82bc492038d3e3886de7d1e067205a4fa9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}