{"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/kl-div","entry":"kl_div","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":22,"n_papers_ran":21,"n_papers_ran_no_instrument_failure":16,"n_papers_ran_instrument_only":5,"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":21,"n_samples_ran":20,"n_samples_constructed":0,"n_samples_ran_checked":15,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":16,"n_places":22,"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":1,"ran_violates":1,"ran_draft_wrong":5,"ran_fixture":0,"ran":13,"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":"2601.11441","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11441","title":"Hierarchical Orthogonal Residual Spread for Precise Massive Editing in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"XiaojieGu/HORSE","path":"editor/horse.py","file_url":"https://github.com/XiaojieGu/HORSE/blob/HEAD/editor/horse.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, XiaojieGu/HORSE when it was checked","code_sha256":"b12eccceaa04cfd8","code_sha256_prefix":"b12eccceaa04cfd8","mcp_get_code":{"code_sha256":"b12eccceaa04cfd8"}},{"arxiv_id":"2505.20840","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2505.20840","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"dooho00/agg-buffer","path":"evaluate/metrics.py","file_url":"https://github.com/dooho00/agg-buffer/blob/HEAD/evaluate/metrics.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":"61983e536a82241c","code_sha256_prefix":"61983e536a82241c","mcp_get_code":{"code_sha256":"61983e536a82241c"}},{"arxiv_id":"2410.12671","arxiv_id_is_arxiv":true,"paper":"/paper/new-paradigm-of-adversarial-training-breaking","title":"New Paradigm of Adversarial Training: Breaking Inherent Trade-Off between Accuracy and Robustness via Dummy Classes","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FlaAI/DUCAT","path":"adv_lib/trades.py","file_url":"https://github.com/FlaAI/DUCAT/blob/HEAD/adv_lib/trades.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, FlaAI/DUCAT when it was checked","code_sha256":"5e25bba79f6b2977","code_sha256_prefix":"5e25bba79f6b2977","mcp_get_code":{"code_sha256":"5e25bba79f6b2977"}},{"arxiv_id":"2407.17396","arxiv_id_is_arxiv":true,"paper":"/paper/systematic-reasoning-about-relational-domains","title":"Systematic Reasoning About Relational Domains With Graph Neural Networks","date":"2024-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erg0dic/gnn-sg","path":"src/model_nbf_fb.py","file_url":"https://github.com/erg0dic/gnn-sg/blob/HEAD/src/model_nbf_fb.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":"bd75778ce5bcfcd6","code_sha256_prefix":"bd75778ce5bcfcd6","mcp_get_code":{"code_sha256":"bd75778ce5bcfcd6"}},{"arxiv_id":"2404.09586","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-the-curse-of-dimensionality-for","title":"Mitigating the Curse of Dimensionality for Certified Robustness via Dual Randomized Smoothing","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiasong0501/DRS","path":"imagenet_train_lowres_2.py","file_url":"https://github.com/xiasong0501/DRS/blob/HEAD/imagenet_train_lowres_2.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, xiasong0501/DRS when it was checked","code_sha256":"74325f9c5d49ca67","code_sha256_prefix":"74325f9c5d49ca67","mcp_get_code":{"code_sha256":"74325f9c5d49ca67"}},{"arxiv_id":"2307.08507","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-accurate-optimal-transport-with","title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adaptive-agents-lab/mdot-pncg","path":"utils/measurements.py","file_url":"https://github.com/adaptive-agents-lab/mdot-pncg/blob/HEAD/utils/measurements.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, adaptive-agents-lab/mdot-pncg when it was checked","code_sha256":"2328b4b281b9056d","code_sha256_prefix":"2328b4b281b9056d","mcp_get_code":{"code_sha256":"2328b4b281b9056d"}},{"arxiv_id":"2305.10309","arxiv_id_is_arxiv":true,"paper":"/paper/metamodulation-learning-variational-feature","title":"MetaModulation: Learning Variational Feature Hierarchies for Few-Shot Learning with Fewer Tasks","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmsdss/metamodulation","path":"cbn.py","file_url":"https://github.com/lmsdss/metamodulation/blob/HEAD/cbn.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":"8ff7ce810790dda0","code_sha256_prefix":"8ff7ce810790dda0","mcp_get_code":{"code_sha256":"8ff7ce810790dda0"}},{"arxiv_id":"2304.05366","arxiv_id_is_arxiv":true,"paper":"/paper/the-no-free-lunch-theorem-kolmogorov","title":"The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learning","date":"2023-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goldblum/free-lunch","path":"llm_sequences/utils.py","file_url":"https://github.com/goldblum/free-lunch/blob/HEAD/llm_sequences/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":"7c1a8ddca993d7e5","code_sha256_prefix":"7c1a8ddca993d7e5","mcp_get_code":{"code_sha256":"7c1a8ddca993d7e5"}},{"arxiv_id":"2212.09000","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-aware-training-of-smoothed-1","title":"Confidence-aware Training of Smoothed Classifiers for Certified Robustness","date":"2022-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alinlab/smoothing-catrs","path":"code/consistency.py","file_url":"https://github.com/alinlab/smoothing-catrs/blob/HEAD/code/consistency.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":"6518bcfd499a3632","code_sha256_prefix":"6518bcfd499a3632","mcp_get_code":{"code_sha256":"6518bcfd499a3632"}},{"arxiv_id":"2208.10559","arxiv_id_is_arxiv":true,"paper":"/paper/transductive-decoupled-variational-inference","title":"Transductive Decoupled Variational Inference for Few-Shot Classification","date":"2022-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anujinho/trident","path":"src/zoo/trident_utils.py","file_url":"https://github.com/anujinho/trident/blob/HEAD/src/zoo/trident_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":"ad36b715c4f5a533","code_sha256_prefix":"ad36b715c4f5a533","mcp_get_code":{"code_sha256":"ad36b715c4f5a533"}},{"arxiv_id":"2208.03207","arxiv_id_is_arxiv":true,"paper":"/paper/neighborhood-collective-estimation-for-noisy","title":"Neighborhood Collective Estimation for Noisy Label Identification and Correction","date":"2022-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lijichang/lnl-nce","path":"cifar/utils.py","file_url":"https://github.com/lijichang/lnl-nce/blob/HEAD/cifar/utils.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, lijichang/lnl-nce when it was checked","code_sha256":"a963c3a665b84f82","code_sha256_prefix":"a963c3a665b84f82","mcp_get_code":{"code_sha256":"a963c3a665b84f82"}},{"arxiv_id":"2203.13573","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-of-temporal","title":"Unsupervised Learning of Temporal Abstractions with Slot-based Transformers","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agopal42/slottar","path":"utils.py","file_url":"https://github.com/agopal42/slottar/blob/HEAD/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":"58e1bcada748d451","code_sha256_prefix":"58e1bcada748d451","mcp_get_code":{"code_sha256":"58e1bcada748d451"}},{"arxiv_id":"2203.08543","arxiv_id_is_arxiv":true,"paper":"/paper/integrating-language-guidance-into-vision","title":"Integrating Language Guidance into Vision-based Deep Metric Learning","date":"2022-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainableml/languageguidance_for_dml","path":"language_guidance.py","file_url":"https://github.com/explainableml/languageguidance_for_dml/blob/HEAD/language_guidance.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":"267822f22d40c6cc","code_sha256_prefix":"267822f22d40c6cc","mcp_get_code":{"code_sha256":"267822f22d40c6cc"}},{"arxiv_id":"2010.02637","arxiv_id_is_arxiv":true,"paper":"/paper/disentangled-generative-causal-representation-1","title":"Weakly Supervised Disentangled Generative Causal Representation Learning","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xwshen51/DEAR","path":"bgm.py","file_url":"https://github.com/xwshen51/DEAR/blob/HEAD/bgm.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":"92eea8d46ba7a4f4","code_sha256_prefix":"92eea8d46ba7a4f4","mcp_get_code":{"code_sha256":"92eea8d46ba7a4f4"}},{"arxiv_id":"2006.04062","arxiv_id_is_arxiv":true,"paper":"/paper/consistency-regularization-for-certified","title":"Consistency Regularization for Certified Robustness of Smoothed Classifiers","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jh-jeong/smoothing-consistency","path":"code/consistency.py","file_url":"https://github.com/jh-jeong/smoothing-consistency/blob/HEAD/code/consistency.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":"6518bcfd499a3632","code_sha256_prefix":"6518bcfd499a3632","mcp_get_code":{"code_sha256":"6518bcfd499a3632"}},{"arxiv_id":"2005.01634","arxiv_id_is_arxiv":true,"paper":"/paper/code-and-named-entity-recognition-in","title":"Code and Named Entity Recognition in StackOverflow","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taidnguyen/software_entity_recognition","path":"src/model_nll.py","file_url":"https://github.com/taidnguyen/software_entity_recognition/blob/HEAD/src/model_nll.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"978e6ebd9602e13a","code_sha256_prefix":"978e6ebd9602e13a","mcp_get_code":{"code_sha256":"978e6ebd9602e13a"}},{"arxiv_id":"2004.07737","arxiv_id_is_arxiv":true,"paper":"/paper/cross-lingual-contextualized-topic-models","title":"Cross-lingual Contextualized Topic Models with Zero-shot Learning","date":"2020-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MilaNLProc/contextualized-topic-models","path":"contextualized_topic_models/evaluation/measures.py","file_url":"https://github.com/MilaNLProc/contextualized-topic-models/blob/HEAD/contextualized_topic_models/evaluation/measures.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":"7e573106cb435fab","code_sha256_prefix":"7e573106cb435fab","mcp_get_code":{"code_sha256":"7e573106cb435fab"}},{"arxiv_id":"1910.07295","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-domain-adaptation-meets-offline","title":"Towards Resolving Propensity Contradiction in Offline Recommender Learning","date":"2019-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usaito/ijcai2022-adversarial-mf","path":"src/utils/result_tools.py","file_url":"https://github.com/usaito/ijcai2022-adversarial-mf/blob/HEAD/src/utils/result_tools.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":"249c7ddf79d8e8cc","code_sha256_prefix":"249c7ddf79d8e8cc","mcp_get_code":{"code_sha256":"249c7ddf79d8e8cc"}},{"arxiv_id":"1904.07305","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-adaptation-of-object-detectors-to","title":"Automatic adaptation of object detectors to new domains using self-training","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gabriel-Macias/robust_frcnn","path":"train_phase3_frcnn.py","file_url":"https://github.com/Gabriel-Macias/robust_frcnn/blob/HEAD/train_phase3_frcnn.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":"3f4bd2f243aba23a","code_sha256_prefix":"3f4bd2f243aba23a","mcp_get_code":{"code_sha256":"3f4bd2f243aba23a"}},{"arxiv_id":"1712.04172","arxiv_id_is_arxiv":true,"paper":"/paper/a-low-cost-ethics-shaping-approach-for","title":"A Low-Cost Ethics Shaping Approach for Designing Reinforcement Learning Agents","date":"2017-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kristery/EthicsShaping","path":"Drive/sarsa.py","file_url":"https://github.com/kristery/EthicsShaping/blob/HEAD/Drive/sarsa.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, kristery/EthicsShaping when it was checked","code_sha256":"545fcc23b912f1c1","code_sha256_prefix":"545fcc23b912f1c1","mcp_get_code":{"code_sha256":"545fcc23b912f1c1"}},{"arxiv_id":"1609.09869","arxiv_id_is_arxiv":true,"paper":"/paper/structured-inference-networks-for-nonlinear","title":"Structured Inference Networks for Nonlinear State Space Models","date":"2016-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjlolo/pytorch-deep-markov-model","path":"model/loss.py","file_url":"https://github.com/yjlolo/pytorch-deep-markov-model/blob/HEAD/model/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":"8c4257c4dbe9e6de","code_sha256_prefix":"8c4257c4dbe9e6de","mcp_get_code":{"code_sha256":"8c4257c4dbe9e6de"}},{"arxiv_id":"1503.03585","arxiv_id_is_arxiv":true,"paper":"/paper/deep-unsupervised-learning-using","title":"Deep Unsupervised Learning using Nonequilibrium Thermodynamics","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"horenbergerb/BernoulliDiffusion","path":"BernoulliDiffusion/diffusion_model.py","file_url":"https://github.com/horenbergerb/BernoulliDiffusion/blob/HEAD/BernoulliDiffusion/diffusion_model.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":"e14a27c300c7ad9e","code_sha256_prefix":"e14a27c300c7ad9e","mcp_get_code":{"code_sha256":"e14a27c300c7ad9e"}}],"record_sha256":"0f3443e7aae44ac8d300005611e9a61fbd8e648ffbc36751644b884210ba901d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}