{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/write-log","entry":"write_log","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2405.01022","paper":"/paper/unigen-universal-domain-generalization-for","title":"UniGen: Universal Domain Generalization for Sentiment Classification via Zero-shot Dataset Generation","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"c-juhwan/unigen","path":"task/classification/train_sungen.py","file_url":"https://github.com/c-juhwan/unigen/blob/HEAD/task/classification/train_sungen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1ac20116e2fc93a4","mcp_get_code":{"code_sha256":"1ac20116e2fc93a4"}},{"arxiv_id":"2207.12258","paper":"/paper/equivariance-and-invariance-inductive-bias","title":"Equivariance and Invariance Inductive Bias for Learning from Insufficient Data","date":"2022-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wangt-CN/EqInv","path":"vipriors_eqinv.py","file_url":"https://github.com/Wangt-CN/EqInv/blob/HEAD/vipriors_eqinv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"31b0eca953d45bc3","mcp_get_code":{"code_sha256":"31b0eca953d45bc3"}},{"arxiv_id":"2103.13575","paper":"/paper/metaalign-coordinating-domain-alignment-and","title":"MetaAlign: Coordinating Domain Alignment and Classification for Unsupervised Domain Adaptation","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/UDA","path":"trainer/da/toalign.py","file_url":"https://github.com/microsoft/UDA/blob/HEAD/trainer/da/toalign.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e04cd9b9c5fb70e0","mcp_get_code":{"code_sha256":"e04cd9b9c5fb70e0"}},{"arxiv_id":"2010.08001","paper":"/paper/maximum-entropy-adversarial-data-augmentation","title":"Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustness","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"garyzhao/ME-ADA","path":"model_cifar.py","file_url":"https://github.com/garyzhao/ME-ADA/blob/HEAD/model_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"f71d878c2fdfce45","mcp_get_code":{"code_sha256":"f71d878c2fdfce45"}},{"arxiv_id":"2001.01050","paper":"/paper/discrimination-aware-network-pruning-for-deep","title":"Discrimination-aware Network Pruning for Deep Model Compression","date":"2020-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SCUT-AILab/DCP","path":"dcp/channel_selection/channel_selection.py","file_url":"https://github.com/SCUT-AILab/DCP/blob/HEAD/dcp/channel_selection/channel_selection.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"adca107f61f2f8b4","mcp_get_code":{"code_sha256":"adca107f61f2f8b4"}},{"arxiv_id":"1505.07818","paper":"/paper/domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AKASH2907/Forgery-Classification-via-Domain-Adaptation","path":"DANN/dann_keras.py","file_url":"https://github.com/AKASH2907/Forgery-Classification-via-Domain-Adaptation/blob/HEAD/DANN/dann_keras.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"882f695d04b3d5b7","mcp_get_code":{"code_sha256":"882f695d04b3d5b7"}}]}