{"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/grad-reverse","entry":"grad_reverse","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":35,"n_papers_ran":30,"n_papers_ran_no_instrument_failure":18,"n_papers_ran_instrument_only":12,"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":24,"n_samples_ran":22,"n_samples_constructed":0,"n_samples_ran_checked":14,"n_samples_instrument":8,"n_samples_unverified":2,"n_samples_fingerprinted":22,"n_places":35,"n_places_pointer_only":17,"n_places_pointer_only_link_open":4,"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":7,"ran_violates":0,"ran_draft_wrong":8,"ran_fixture":0,"ran":7,"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.19400","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-19400","title":"TA B U L A Predictive single cell foundation model for gene regulation and aging with privacy-preserving tabular learning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"aristoteleo/tabula","path":"tabula/model/transfomer/transformer.py","file_url":"https://github.com/aristoteleo/tabula/blob/HEAD/tabula/model/transfomer/transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, aristoteleo/tabula (NOASSERTION)","code_sha256":"12adce58fd9ce5ce","code_sha256_prefix":"12adce58fd9ce5ce","mcp_get_code":{"code_sha256":"12adce58fd9ce5ce"}},{"arxiv_id":"2604.13692","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-13692","title":"Breaking the Generator Barrier: Disentangled Representation for Generalizable AI-Text Detection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"PuXiao06/DRGD","path":"module/model.py","file_url":"https://github.com/PuXiao06/DRGD/blob/HEAD/module/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, PuXiao06/DRGD when it was checked","code_sha256":"5c9517d15decf27f","code_sha256_prefix":"5c9517d15decf27f","mcp_get_code":{"code_sha256":"5c9517d15decf27f"}},{"arxiv_id":"2601.18222","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18222","title":"HomoFM: Deep Homography Estimation with Flow Matching","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"hmf21/HomoFM","path":"model/CANN_GRL.py","file_url":"https://github.com/hmf21/HomoFM/blob/HEAD/model/CANN_GRL.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, hmf21/HomoFM when it was checked","code_sha256":"697531742d8cff62","code_sha256_prefix":"697531742d8cff62","mcp_get_code":{"code_sha256":"697531742d8cff62"}},{"arxiv_id":"2601.03090","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03090","title":"Lesiontabe: Equitable AI for Skin Lesion Detection","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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":"8a26ee1d7d102851","code_sha256_prefix":"8a26ee1d7d102851","mcp_get_code":{"code_sha256":"8a26ee1d7d102851"}},{"arxiv_id":"2511.18590","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-18590","title":"From Simulations to Surveys: Domain Adaptation for Galaxy Observations","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"ahmedsalim3/galaxy-da","path":"nebula/modeling/domin_classifier.py","file_url":"https://github.com/ahmedsalim3/galaxy-da/blob/HEAD/nebula/modeling/domin_classifier.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0c19e1fde092ece","code_sha256_prefix":"e0c19e1fde092ece","mcp_get_code":{"code_sha256":"e0c19e1fde092ece"}},{"arxiv_id":"2412.17284","arxiv_id_is_arxiv":true,"paper":"/paper/towards-unsupervised-model-selection-for","title":"Towards Unsupervised Model Selection for Domain Adaptive Object Detection","date":"2024-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"henryyu23/das","path":"adapteacher/modeling/meta_arch/rcnn.py","file_url":"https://github.com/henryyu23/das/blob/HEAD/adapteacher/modeling/meta_arch/rcnn.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, henryyu23/das when it was checked","code_sha256":"7d2aba87eb205634","code_sha256_prefix":"7d2aba87eb205634","mcp_get_code":{"code_sha256":"7d2aba87eb205634"}},{"arxiv_id":"2407.11052","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rynewu224/GraphDA","path":"layers.py","file_url":"https://github.com/rynewu224/GraphDA/blob/HEAD/layers.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, rynewu224/GraphDA when it was checked","code_sha256":"12b63b50bbdf9a59","code_sha256_prefix":"12b63b50bbdf9a59","mcp_get_code":{"code_sha256":"12b63b50bbdf9a59"}},{"arxiv_id":"2407.09498","arxiv_id_is_arxiv":true,"paper":"/paper/ot-vp-optimal-transport-guided-visual","title":"OT-VP: Optimal Transport-guided Visual Prompting for Test-Time Adaptation","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/ot-vp","path":"domainbed/lib/torchmisc.py","file_url":"https://github.com/zybeich/ot-vp/blob/HEAD/domainbed/lib/torchmisc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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 guanqun-yang/reproducibility_challenge_neurips_2019, and GitHub detected no licence in that repository when it was checked","code_sha256":"b5becb520f35423a","code_sha256_prefix":"b5becb520f35423a","mcp_get_code":{"code_sha256":"b5becb520f35423a"}},{"arxiv_id":"2304.02950","arxiv_id_is_arxiv":true,"paper":"/paper/multi-view-adversarial-discriminator-mine-the","title":"Multi-view Adversarial Discriminator: Mine the Non-causal Factors for Object Detection in Unseen Domains","date":"2023-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"K2OKOH/MAD","path":"Pytorch/lib/model/faster_rcnn_MV_3/DA.py","file_url":"https://github.com/K2OKOH/MAD/blob/HEAD/Pytorch/lib/model/faster_rcnn_MV_3/DA.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, K2OKOH/MAD (NOASSERTION)","code_sha256":"abb34bc87e086cd4","code_sha256_prefix":"abb34bc87e086cd4","mcp_get_code":{"code_sha256":"abb34bc87e086cd4"}},{"arxiv_id":"2208.08914","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-vision-transformer-for-domain","title":"Prompt Vision Transformer for Domain Generalization","date":"2022-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengzangw/DoPrompt","path":"domainbed/lib/torchmisc.py","file_url":"https://github.com/zhengzangw/DoPrompt/blob/HEAD/domainbed/lib/torchmisc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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 guanqun-yang/reproducibility_challenge_neurips_2019, and GitHub detected no licence in that repository when it was checked","code_sha256":"b5becb520f35423a","code_sha256_prefix":"b5becb520f35423a","mcp_get_code":{"code_sha256":"b5becb520f35423a"}},{"arxiv_id":"2207.13048","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-under-open-set-label-shift","title":"Domain Adaptation under Open Set Label Shift","date":"2022-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/DANCE","path":"models/basenet.py","file_url":"https://github.com/VisionLearningGroup/DANCE/blob/HEAD/models/basenet.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":"0822c90f53494f2e","code_sha256_prefix":"0822c90f53494f2e","mcp_get_code":{"code_sha256":"0822c90f53494f2e"}},{"arxiv_id":"2206.06293","arxiv_id_is_arxiv":true,"paper":"/paper/learning-domain-adaptive-object-detection","title":"Learning Domain Adaptive Object Detection with Probabilistic Teacher","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hikvision-research/probabilisticteacher","path":"pt/modeling/utils.py","file_url":"https://github.com/hikvision-research/probabilisticteacher/blob/HEAD/pt/modeling/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9edd40180616c9cc","code_sha256_prefix":"9edd40180616c9cc","mcp_get_code":{"code_sha256":"9edd40180616c9cc"}},{"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":"models/component.py","file_url":"https://github.com/luoyadan/sf-pgl/blob/HEAD/models/component.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":"29525c5a2d077ac6","code_sha256_prefix":"29525c5a2d077ac6","mcp_get_code":{"code_sha256":"29525c5a2d077ac6"}},{"arxiv_id":"2111.13216","arxiv_id_is_arxiv":true,"paper":"/paper/cross-domain-object-detection-via-adaptive","title":"Cross-Domain Adaptive Teacher for Object Detection","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","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":"7d2aba87eb205634","code_sha256_prefix":"7d2aba87eb205634","mcp_get_code":{"code_sha256":"7d2aba87eb205634"}},{"arxiv_id":"2109.09818","arxiv_id_is_arxiv":true,"paper":"/paper/skin-deep-unlearning-artefact-and-instrument","title":"Skin Deep Unlearning: Artefact and Instrument Debiasing in the Context of Melanoma Classification","date":"2021-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pbevan1/Skin-Deep-Unlearning","path":"models.py","file_url":"https://github.com/pbevan1/Skin-Deep-Unlearning/blob/HEAD/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 feidfoe/learning-not-to-learn, and GitHub detected no licence in that repository when it was checked","code_sha256":"8a26ee1d7d102851","code_sha256_prefix":"8a26ee1d7d102851","mcp_get_code":{"code_sha256":"8a26ee1d7d102851"}},{"arxiv_id":"2109.04261","arxiv_id_is_arxiv":true,"paper":"/paper/memory-semantization-through-perturbed-and","title":"Learning cortical representations through perturbed and adversarial dreaming","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NicoZenith/PAD","path":"network.py","file_url":"https://github.com/NicoZenith/PAD/blob/HEAD/network.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":"336eb7a33d8ba44f","code_sha256_prefix":"336eb7a33d8ba44f","mcp_get_code":{"code_sha256":"336eb7a33d8ba44f"}},{"arxiv_id":"2106.04732","arxiv_id_is_arxiv":true,"paper":"/paper/adamatch-a-unified-approach-to-semi","title":"AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptation","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwenyu/UniSSDA","path":"algorithms/algorithms.py","file_url":"https://github.com/zwenyu/UniSSDA/blob/HEAD/algorithms/algorithms.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, zwenyu/UniSSDA when it was checked","code_sha256":"568eece08bf61ac5","code_sha256_prefix":"568eece08bf61ac5","mcp_get_code":{"code_sha256":"568eece08bf61ac5"}},{"arxiv_id":"2106.02874","arxiv_id_is_arxiv":true,"paper":"/paper/rda-robust-domain-adaptation-via-fourier","title":"RDA: Robust Domain Adaptation via Fourier Adversarial Attacking","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhuang0508/RDA","path":"rda/utils/gate.py","file_url":"https://github.com/jxhuang0508/RDA/blob/HEAD/rda/utils/gate.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":"9546e8417b4bdc1a","code_sha256_prefix":"9546e8417b4bdc1a","mcp_get_code":{"code_sha256":"9546e8417b4bdc1a"}},{"arxiv_id":"2104.07078","arxiv_id_is_arxiv":true,"paper":"/paper/udalm-unsupervised-domain-adaptation-through","title":"UDALM: Unsupervised Domain Adaptation through Language Modeling","date":"2021-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ckarouzos/slp_daptmlm","path":"slp/modules/vada.py","file_url":"https://github.com/ckarouzos/slp_daptmlm/blob/HEAD/slp/modules/vada.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":"77d46d2160bbc40b","code_sha256_prefix":"77d46d2160bbc40b","mcp_get_code":{"code_sha256":"77d46d2160bbc40b"}},{"arxiv_id":"2104.00246","arxiv_id_is_arxiv":true,"paper":"/paper/divergence-optimization-for-noisy-universal","title":"Divergence Optimization for Noisy Universal Domain Adaptation","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu1ut/divergence-optimization","path":"models/basenet.py","file_url":"https://github.com/yu1ut/divergence-optimization/blob/HEAD/models/basenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, yu1ut/divergence-optimization (NOASSERTION)","code_sha256":"ed0154a7aa37f9c9","code_sha256_prefix":"ed0154a7aa37f9c9","mcp_get_code":{"code_sha256":"ed0154a7aa37f9c9"}},{"arxiv_id":"2006.12770","arxiv_id_is_arxiv":true,"paper":"/paper/discriminative-feature-alignment","title":"Discriminative Feature Alignment: Improving Transferability of Unsupervised Domain Adaptation by Gaussian-guided Latent Alignment","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingWang18/Discriminative-Feature-Alignment","path":"Digit_Classification/DFAENT/model/grad_reverse.py","file_url":"https://github.com/JingWang18/Discriminative-Feature-Alignment/blob/HEAD/Digit_Classification/DFAENT/model/grad_reverse.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":"9546e8417b4bdc1a","code_sha256_prefix":"9546e8417b4bdc1a","mcp_get_code":{"code_sha256":"9546e8417b4bdc1a"}},{"arxiv_id":"2006.12087","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-graph-learning-for-open-set","title":"Progressive Graph Learning for Open-Set Domain Adaptation","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BUserName/PGL","path":"models/component.py","file_url":"https://github.com/BUserName/PGL/blob/HEAD/models/component.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":"29525c5a2d077ac6","code_sha256_prefix":"29525c5a2d077ac6","mcp_get_code":{"code_sha256":"29525c5a2d077ac6"}},{"arxiv_id":"2005.02066","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-instance-segmentation-in","title":"Unsupervised Instance Segmentation in Microscopy Images via Panoptic Domain Adaptation and Task Re-weighting","date":"2020-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dliu5812/PDAM","path":"maskrcnn_benchmark/modeling/domain_adaption/DA.py","file_url":"https://github.com/dliu5812/PDAM/blob/HEAD/maskrcnn_benchmark/modeling/domain_adaption/DA.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":"3953ff0e5f757483","code_sha256_prefix":"3953ff0e5f757483","mcp_get_code":{"code_sha256":"3953ff0e5f757483"}},{"arxiv_id":"2003.00845","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-target-shift-in-zero-shot-learning","title":"Addressing target shift in zero-shot learning using grouped adversarial learning","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mvp18/gAL-MELEX","path":"APY/code/model.py","file_url":"https://github.com/mvp18/gAL-MELEX/blob/HEAD/APY/code/model.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":"5a2b24f39d01d817","code_sha256_prefix":"5a2b24f39d01d817","mcp_get_code":{"code_sha256":"5a2b24f39d01d817"}},{"arxiv_id":"1910.13049","arxiv_id_is_arxiv":true,"paper":"/paper/category-anchor-guided-unsupervised-domain","title":"Category Anchor-Guided Unsupervised Domain Adaptation for Semantic Segmentation","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RogerZhangzz/CAG_UDA","path":"models/adaptation_model.py","file_url":"https://github.com/RogerZhangzz/CAG_UDA/blob/HEAD/models/adaptation_model.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":"522eaeb36b99efb4","code_sha256_prefix":"522eaeb36b99efb4","mcp_get_code":{"code_sha256":"522eaeb36b99efb4"}},{"arxiv_id":"1907.04448","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-speak-fluently-in-a-foreign","title":"Learning to Speak Fluently in a Foreign Language: Multilingual Speech Synthesis and Cross-Language Voice Cloning","date":"2019-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jeevesh8/Cross-Lingual-Voice-Cloning","path":"gradient_reversal.py","file_url":"https://github.com/Jeevesh8/Cross-Lingual-Voice-Cloning/blob/HEAD/gradient_reversal.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause, as GitHub detects it on this paper's repository, Jeevesh8/Cross-Lingual-Voice-Cloning, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"63cd61beeb29c53c","code_sha256_prefix":"63cd61beeb29c53c","mcp_get_code":{"code_sha256":"63cd61beeb29c53c"}},{"arxiv_id":"1906.09444","arxiv_id_is_arxiv":true,"paper":"/paper/retrieving-sequential-information-for-non","title":"Retrieving Sequential Information for Non-Autoregressive Neural Machine Translation","date":"2019-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/RSI-NAT","path":"model.py","file_url":"https://github.com/ictnlp/RSI-NAT/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a7e189196f18f84","code_sha256_prefix":"2a7e189196f18f84","mcp_get_code":{"code_sha256":"2a7e189196f18f84"}},{"arxiv_id":"1905.13549","arxiv_id_is_arxiv":true,"paper":"/paper/190513549","title":"Learning Robust Global Representations by Penalizing Local Predictive Power","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guanqun-yang/reproducibility_challenge_neurips_2019","path":"exp1.py","file_url":"https://github.com/guanqun-yang/reproducibility_challenge_neurips_2019/blob/HEAD/exp1.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, guanqun-yang/reproducibility_challenge_neurips_2019 when it was checked","code_sha256":"b5becb520f35423a","code_sha256_prefix":"b5becb520f35423a","mcp_get_code":{"code_sha256":"b5becb520f35423a"}},{"arxiv_id":"1904.06487","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-domain-adaptation-via-minimax","title":"Semi-supervised Domain Adaptation via Minimax Entropy","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/SSDA_MME","path":"model/basenet.py","file_url":"https://github.com/VisionLearningGroup/SSDA_MME/blob/HEAD/model/basenet.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":"9546e8417b4bdc1a","code_sha256_prefix":"9546e8417b4bdc1a","mcp_get_code":{"code_sha256":"9546e8417b4bdc1a"}},{"arxiv_id":"1812.10352","arxiv_id_is_arxiv":true,"paper":"/paper/learning-not-to-learn-training-deep-neural","title":"Learning Not to Learn: Training Deep Neural Networks with Biased Data","date":"2018-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feidfoe/learning-not-to-learn","path":"trainer.py","file_url":"https://github.com/feidfoe/learning-not-to-learn/blob/HEAD/trainer.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, feidfoe/learning-not-to-learn when it was checked","code_sha256":"8a26ee1d7d102851","code_sha256_prefix":"8a26ee1d7d102851","mcp_get_code":{"code_sha256":"8a26ee1d7d102851"}},{"arxiv_id":"1802.06901","arxiv_id_is_arxiv":true,"paper":"/paper/deterministic-non-autoregressive-neural","title":"Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement","date":"2018-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-dl/dl4mt-nonauto","path":"model.py","file_url":"https://github.com/nyu-dl/dl4mt-nonauto/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a7e189196f18f84","code_sha256_prefix":"2a7e189196f18f84","mcp_get_code":{"code_sha256":"2a7e189196f18f84"}},{"arxiv_id":"1711.05139","arxiv_id_is_arxiv":true,"paper":"/paper/xgan-unsupervised-image-to-image-translation","title":"XGAN: Unsupervised Image-to-Image Translation for Many-to-Many Mappings","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gintasp/xgan","path":"models/cdann.py","file_url":"https://github.com/Gintasp/xgan/blob/HEAD/models/cdann.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from henryyu23/das, and GitHub detected no licence in that repository when it was checked","code_sha256":"7d2aba87eb205634","code_sha256_prefix":"7d2aba87eb205634","mcp_get_code":{"code_sha256":"7d2aba87eb205634"}},{"arxiv_id":"aaai_32537","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_32537","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Yinghui-Li-New/DAPoinTr","path":"utils/net_utils.py","file_url":"https://github.com/Yinghui-Li-New/DAPoinTr/blob/HEAD/utils/net_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":"fe98a9a5f820dcb0","code_sha256_prefix":"fe98a9a5f820dcb0","mcp_get_code":{"code_sha256":"fe98a9a5f820dcb0"}},{"arxiv_id":"aaai_28150","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28150","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lhrrrrrr/DiDA","path":"resnet.py","file_url":"https://github.com/lhrrrrrr/DiDA/blob/HEAD/resnet.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":"9546e8417b4bdc1a","code_sha256_prefix":"9546e8417b4bdc1a","mcp_get_code":{"code_sha256":"9546e8417b4bdc1a"}},{"arxiv_id":"2022.findings-aacl.4","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-aacl.4","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"anthonysicilia/LEATHER-AACL2022","path":"train/CL/auxloss.py","file_url":"https://github.com/anthonysicilia/LEATHER-AACL2022/blob/HEAD/train/CL/auxloss.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":"7341f9519b1347f8","code_sha256_prefix":"7341f9519b1347f8","mcp_get_code":{"code_sha256":"7341f9519b1347f8"}}],"record_sha256":"7c5be21dea34db2890044afbf16ad1602fd89d105bfa1a6e8fad0c230193f184","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}