{"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/save-model","entry":"save_model","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":19,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":20,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":14,"n_samples_fingerprinted":0,"n_places":20,"n_places_pointer_only":6,"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":1,"ran_fixture":0,"ran":5,"unverified":14},"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":"2405.20862","arxiv_id_is_arxiv":true,"paper":"/paper/backdoorindicator-leveraging-ood-data-for","title":"BackdoorIndicator: Leveraging OOD Data for Proactive Backdoor Detection in Federated Learning","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"ybdai7/backdoor-indicator-defense","path":"utils/utils.py","file_url":"https://github.com/ybdai7/backdoor-indicator-defense/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8939a7a2f5089a45","code_sha256_prefix":"8939a7a2f5089a45","mcp_get_code":{"code_sha256":"8939a7a2f5089a45"}},{"arxiv_id":"2405.12775","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-multimodal-clustering-for","title":"Unsupervised Multimodal Clustering for Semantics Discovery in Multimodal Utterances","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuiar/UMC","path":"methods/unsupervised/UMC/manager.py","file_url":"https://github.com/thuiar/UMC/blob/HEAD/methods/unsupervised/UMC/manager.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, thuiar/UMC when it was checked","code_sha256":"8157b7e8e74f2360","code_sha256_prefix":"8157b7e8e74f2360","mcp_get_code":{"code_sha256":"8157b7e8e74f2360"}},{"arxiv_id":"2403.19067","arxiv_id_is_arxiv":true,"paper":"/paper/low-rank-rescaled-vision-transformer-fine","title":"Low-Rank Rescaled Vision Transformer Fine-Tuning: A Residual Design Approach","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zstarn70/rlrr","path":"train_fgvc.py","file_url":"https://github.com/zstarn70/rlrr/blob/HEAD/train_fgvc.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, zstarn70/rlrr when it was checked","code_sha256":"65f028207e1aa6ac","code_sha256_prefix":"65f028207e1aa6ac","mcp_get_code":{"code_sha256":"65f028207e1aa6ac"}},{"arxiv_id":"2401.05336","arxiv_id_is_arxiv":true,"paper":"/paper/towards-online-sign-language-recognition-and","title":"Towards Online Continuous Sign Language Recognition and Translation","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FangyunWei/SLRT","path":"TwoStreamNetwork/training.py","file_url":"https://github.com/FangyunWei/SLRT/blob/HEAD/TwoStreamNetwork/training.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, FangyunWei/SLRT when it was checked","code_sha256":"71c76eb4ecffbe0f","code_sha256_prefix":"71c76eb4ecffbe0f","mcp_get_code":{"code_sha256":"71c76eb4ecffbe0f"}},{"arxiv_id":"2312.15645","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-variational-autoencoder-for-sign","title":"Conditional Variational Autoencoder for Sign Language Translation with Cross-Modal Alignment","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rzhao-zhsq/cv-slt","path":"training.py","file_url":"https://github.com/rzhao-zhsq/cv-slt/blob/HEAD/training.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, rzhao-zhsq/cv-slt when it was checked","code_sha256":"8f23ff0ffdef91ca","code_sha256_prefix":"8f23ff0ffdef91ca","mcp_get_code":{"code_sha256":"8f23ff0ffdef91ca"}},{"arxiv_id":"2305.18951","arxiv_id_is_arxiv":true,"paper":"/paper/subequivariant-graph-reinforcement-learning","title":"Subequivariant Graph Reinforcement Learning in 3D Environments","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alpc91/SGRL","path":"src/checkpoint.py","file_url":"https://github.com/alpc91/SGRL/blob/HEAD/src/checkpoint.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":"5d34f615ca42f7e3","code_sha256_prefix":"5d34f615ca42f7e3","mcp_get_code":{"code_sha256":"5d34f615ca42f7e3"}},{"arxiv_id":"2302.12580","arxiv_id_is_arxiv":true,"paper":"/paper/membership-inference-attacks-against-2","title":"Membership Inference Attacks against Synthetic Data through Overfitting Detection","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderschaarlab/domias","path":"src/domias/bnaf/density_estimation.py","file_url":"https://github.com/vanderschaarlab/domias/blob/HEAD/src/domias/bnaf/density_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":"98ed3d40f8a5dfa5","code_sha256_prefix":"98ed3d40f8a5dfa5","mcp_get_code":{"code_sha256":"98ed3d40f8a5dfa5"}},{"arxiv_id":"2302.03357","arxiv_id_is_arxiv":true,"paper":"/paper/towards-better-time-series-contrastive","title":"Towards Enhancing Time Series Contrastive Learning: A Dynamic Bad Pair Mining Approach","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lanxiang1017/dynamicbadpairmining_iclr24","path":"models/dbpm_model.py","file_url":"https://github.com/lanxiang1017/dynamicbadpairmining_iclr24/blob/HEAD/models/dbpm_model.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, lanxiang1017/dynamicbadpairmining_iclr24 when it was checked","code_sha256":"c995c24f3dfc702c","code_sha256_prefix":"c995c24f3dfc702c","mcp_get_code":{"code_sha256":"c995c24f3dfc702c"}},{"arxiv_id":"2210.12651","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-non-transferable-text","title":"Unsupervised Non-transferable Text Classification","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaoscodes/untl","path":"UNTL.py","file_url":"https://github.com/chaoscodes/untl/blob/HEAD/UNTL.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":"c9a020a065579e8b","code_sha256_prefix":"c9a020a065579e8b","mcp_get_code":{"code_sha256":"c9a020a065579e8b"}},{"arxiv_id":"2109.14509","arxiv_id_is_arxiv":true,"paper":"/paper/pac-bayes-information-bottleneck","title":"PAC-Bayes Information Bottleneck","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryanwangzf/pac-bayes-ib","path":"src/pib_utils.py","file_url":"https://github.com/ryanwangzf/pac-bayes-ib/blob/HEAD/src/pib_utils.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, ryanwangzf/pac-bayes-ib when it was checked","code_sha256":"fd653d0c452a188d","code_sha256_prefix":"fd653d0c452a188d","mcp_get_code":{"code_sha256":"fd653d0c452a188d"}},{"arxiv_id":"2103.13575","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e320fa657d11368b","code_sha256_prefix":"e320fa657d11368b","mcp_get_code":{"code_sha256":"e320fa657d11368b"}},{"arxiv_id":"2010.05700","arxiv_id_is_arxiv":true,"paper":"/paper/reformulating-unsupervised-style-transfer-as","title":"Reformulating Unsupervised Style Transfer as Paraphrase Generation","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martiansideofthemoon/style-transfer-paraphrase","path":"style_paraphrase/run_lm_finetuning.py","file_url":"https://github.com/martiansideofthemoon/style-transfer-paraphrase/blob/HEAD/style_paraphrase/run_lm_finetuning.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":"aae21f24cb4514be","code_sha256_prefix":"aae21f24cb4514be","mcp_get_code":{"code_sha256":"aae21f24cb4514be"}},{"arxiv_id":"2009.13891","arxiv_id_is_arxiv":true,"paper":"/paper/towards-effective-context-for-meta","title":"Towards Effective Context for Meta-Reinforcement Learning: an Approach based on Contrastive Learning","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TJU-DRL-LAB/self-supervised-rl","path":"RL_with_Environment_Representation/PAnDR/pandr_utils.py","file_url":"https://github.com/TJU-DRL-LAB/self-supervised-rl/blob/HEAD/RL_with_Environment_Representation/PAnDR/pandr_utils.py","status":"ran","verification_level":1,"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":"a89da1a0ff56ede9","code_sha256_prefix":"a89da1a0ff56ede9","mcp_get_code":{"code_sha256":"a89da1a0ff56ede9"}},{"arxiv_id":"1910.05744","arxiv_id_is_arxiv":true,"paper":"/paper/powering-hidden-markov-model-by-neural","title":"Powering Hidden Markov Model by Neural Network based Generative Models","date":"2019-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FirstHandScientist/genhmm","path":"src/genHMM.py","file_url":"https://github.com/FirstHandScientist/genhmm/blob/HEAD/src/genHMM.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":"2471d824c1eb32d1","code_sha256_prefix":"2471d824c1eb32d1","mcp_get_code":{"code_sha256":"2471d824c1eb32d1"}},{"arxiv_id":"1909.08174","arxiv_id_is_arxiv":true,"paper":"/paper/gate-decorator-global-filter-pruning-method","title":"Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networks","date":"2019-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"softsys4ai/neural-distiller","path":"src/experiments/eskd_knowledge_distillation_train.py","file_url":"https://github.com/softsys4ai/neural-distiller/blob/HEAD/src/experiments/eskd_knowledge_distillation_train.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d016fd58a1a0d7e8","code_sha256_prefix":"d016fd58a1a0d7e8","mcp_get_code":{"code_sha256":"d016fd58a1a0d7e8"}},{"arxiv_id":"1909.08174","arxiv_id_is_arxiv":true,"paper":"/paper/gate-decorator-global-filter-pruning-method","title":"Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networks","date":"2019-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"softsys4ai/neural-distiller","path":"src/experiments/eskd_teacher_train_and_collect_logits.py","file_url":"https://github.com/softsys4ai/neural-distiller/blob/HEAD/src/experiments/eskd_teacher_train_and_collect_logits.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ff169b5b9d1cd91","code_sha256_prefix":"1ff169b5b9d1cd91","mcp_get_code":{"code_sha256":"1ff169b5b9d1cd91"}},{"arxiv_id":"1904.04676","arxiv_id_is_arxiv":true,"paper":"/paper/block-neural-autoregressive-flow","title":"Block Neural Autoregressive Flow","date":"2019-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicola-decao/BNAF","path":"density_estimation.py","file_url":"https://github.com/nicola-decao/BNAF/blob/HEAD/density_estimation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c7c2cd135ec55792","code_sha256_prefix":"c7c2cd135ec55792","mcp_get_code":{"code_sha256":"c7c2cd135ec55792"}},{"arxiv_id":"1807.06756","arxiv_id_is_arxiv":true,"paper":"/paper/sysevr-a-framework-for-using-deep-learning-to","title":"SySeVR: A Framework for Using Deep Learning to Detect Software Vulnerabilities","date":"2018-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SySeVR/SySeVR","path":"Implementation/model/keras/models.py","file_url":"https://github.com/SySeVR/SySeVR/blob/HEAD/Implementation/model/keras/models.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":"757b53c434bfd276","code_sha256_prefix":"757b53c434bfd276","mcp_get_code":{"code_sha256":"757b53c434bfd276"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thomashirtz/soft-actor-critic","path":"soft_actor_critic/agent.py","file_url":"https://github.com/thomashirtz/soft-actor-critic/blob/HEAD/soft_actor_critic/agent.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":"7d297778525c40d1","code_sha256_prefix":"7d297778525c40d1","mcp_get_code":{"code_sha256":"7d297778525c40d1"}},{"arxiv_id":"2023.findings-emnlp.198","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.198","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Este1le/slr_handshape","path":"training.py","file_url":"https://github.com/Este1le/slr_handshape/blob/HEAD/training.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":"ef54c6d024ccbc97","code_sha256_prefix":"ef54c6d024ccbc97","mcp_get_code":{"code_sha256":"ef54c6d024ccbc97"}}],"record_sha256":"6852e01a9fe65fbfbee8d26a0a1443e359db3e2eb618745712d7b203277df669","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}