{"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/argmax","entry":"argmax","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":23,"n_papers_ran":22,"n_papers_ran_no_instrument_failure":10,"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":18,"n_samples_ran":17,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":8,"n_samples_unverified":1,"n_samples_fingerprinted":11,"n_places":23,"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":3,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":6,"ran":6,"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":"2602.23810","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-23810","title":"REASONX: Declarative Reasoning on Explanations","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"lstate/reasonx","path":"src/dautils.py","file_url":"https://github.com/lstate/reasonx/blob/HEAD/src/dautils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ce70e689f61c1793","code_sha256_prefix":"ce70e689f61c1793","mcp_get_code":{"code_sha256":"ce70e689f61c1793"}},{"arxiv_id":"2412.06474","arxiv_id_is_arxiv":true,"paper":"/paper/from-uncertainty-to-trust-enhancing","title":"From Uncertainty to Trust: Enhancing Reliability in Vision-Language Models with Uncertainty-Guided Dropout Decoding","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kigb/DropoutDecoding","path":"models/llavanext.py","file_url":"https://github.com/kigb/DropoutDecoding/blob/HEAD/models/llavanext.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, kigb/DropoutDecoding when it was checked","code_sha256":"eb627f04ba74cba6","code_sha256_prefix":"eb627f04ba74cba6","mcp_get_code":{"code_sha256":"eb627f04ba74cba6"}},{"arxiv_id":"2406.11687","arxiv_id_is_arxiv":true,"paper":"/paper/tokenization-falling-short-the-curse-of","title":"Tokenization Falling Short: On Subword Robustness in Large Language Models","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"floatai/tkeval","path":"src/utils.py","file_url":"https://github.com/floatai/tkeval/blob/HEAD/src/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d233f39e0fd58dd","code_sha256_prefix":"1d233f39e0fd58dd","mcp_get_code":{"code_sha256":"1d233f39e0fd58dd"}},{"arxiv_id":"2406.07424","arxiv_id_is_arxiv":true,"paper":"/paper/miners-multilingual-language-models-as","title":"MINERS: Multilingual Language Models as Semantic Retrievers","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gentaiscool/miners","path":"icl.py","file_url":"https://github.com/gentaiscool/miners/blob/HEAD/icl.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d233f39e0fd58dd","code_sha256_prefix":"1d233f39e0fd58dd","mcp_get_code":{"code_sha256":"1d233f39e0fd58dd"}},{"arxiv_id":"2405.18357","arxiv_id_is_arxiv":true,"paper":"/paper/faithful-logical-reasoning-via-symbolic-chain","title":"Faithful Logical Reasoning via Symbolic Chain-of-Thought","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aiden0526/SymbCoT","path":"baselines/evaluation.py","file_url":"https://github.com/Aiden0526/SymbCoT/blob/HEAD/baselines/evaluation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c336622e652dd934","code_sha256_prefix":"c336622e652dd934","mcp_get_code":{"code_sha256":"c336622e652dd934"}},{"arxiv_id":"2405.05066","arxiv_id_is_arxiv":true,"paper":"/paper/designing-skill-compatible-ai-methodologies","title":"Designing Skill-Compatible AI: Methodologies and Frameworks in Chess","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csslab/skill-compatibility-chess","path":"maia-partner/STT_test_tree+att.py","file_url":"https://github.com/csslab/skill-compatibility-chess/blob/HEAD/maia-partner/STT_test_tree%2Batt.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, csslab/skill-compatibility-chess when it was checked","code_sha256":"7ab47760cc25b0d7","code_sha256_prefix":"7ab47760cc25b0d7","mcp_get_code":{"code_sha256":"7ab47760cc25b0d7"}},{"arxiv_id":"2403.14606","arxiv_id_is_arxiv":true,"paper":"/paper/the-elements-of-differentiable-programming","title":"The Elements of Differentiable Programming","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diffprog/code","path":"control_flows/plot_soft_thresholding.py","file_url":"https://github.com/diffprog/code/blob/HEAD/control_flows/plot_soft_thresholding.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"802c2203920ee74b","code_sha256_prefix":"802c2203920ee74b","mcp_get_code":{"code_sha256":"802c2203920ee74b"}},{"arxiv_id":"2309.09384","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-over-smoothing-and-over-squashing","title":"Mitigating Over-Smoothing and Over-Squashing using Augmentations of Forman-Ricci Curvature","date":"2023-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weber-geoml/afrc_rewiring","path":"preprocessing/rewiring.py","file_url":"https://github.com/weber-geoml/afrc_rewiring/blob/HEAD/preprocessing/rewiring.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, weber-geoml/afrc_rewiring when it was checked","code_sha256":"52eb6da418404244","code_sha256_prefix":"52eb6da418404244","mcp_get_code":{"code_sha256":"52eb6da418404244"}},{"arxiv_id":"2305.12295","arxiv_id_is_arxiv":true,"paper":"/paper/logic-lm-empowering-large-language-models","title":"Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teacherpeterpan/logic-llm","path":"baselines/evaluation.py","file_url":"https://github.com/teacherpeterpan/logic-llm/blob/HEAD/baselines/evaluation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c336622e652dd934","code_sha256_prefix":"c336622e652dd934","mcp_get_code":{"code_sha256":"c336622e652dd934"}},{"arxiv_id":"2203.06211","arxiv_id_is_arxiv":true,"paper":"/paper/staged-training-for-transformer-language","title":"Staged Training for Transformer Language Models","date":"2022-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/staged-training","path":"eval_lambada.py","file_url":"https://github.com/allenai/staged-training/blob/HEAD/eval_lambada.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":"5369bc1470b00607","code_sha256_prefix":"5369bc1470b00607","mcp_get_code":{"code_sha256":"5369bc1470b00607"}},{"arxiv_id":"2110.07803","arxiv_id_is_arxiv":true,"paper":"/paper/contraqa-question-answering-under-1","title":"Attacking Open-domain Question Answering by Injecting Misinformation","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teacherpeterpan/contraqa","path":"evaluate.py","file_url":"https://github.com/teacherpeterpan/contraqa/blob/HEAD/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c336622e652dd934","code_sha256_prefix":"c336622e652dd934","mcp_get_code":{"code_sha256":"c336622e652dd934"}},{"arxiv_id":"2107.13646","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-relaxations-of-logic-for-neural","title":"Evaluating Relaxations of Logic for Neural Networks: A Comprehensive Study","date":"2021-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utahnlp/neural-logic","path":"chunking/model.py","file_url":"https://github.com/utahnlp/neural-logic/blob/HEAD/chunking/model.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, utahnlp/neural-logic when it was checked","code_sha256":"0f600ea9e25b3319","code_sha256_prefix":"0f600ea9e25b3319","mcp_get_code":{"code_sha256":"0f600ea9e25b3319"}},{"arxiv_id":"2107.06263","arxiv_id_is_arxiv":true,"paper":"/paper/cmt-convolutional-neural-networks-meet-vision","title":"CMT: Convolutional Neural Networks Meet Vision Transformers","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FlyEgle/CMT-pytorch","path":"utils/calculate_acc.py","file_url":"https://github.com/FlyEgle/CMT-pytorch/blob/HEAD/utils/calculate_acc.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FlyEgle/CMT-pytorch when it was checked","code_sha256":"ad55f49e9589b232","code_sha256_prefix":"ad55f49e9589b232","mcp_get_code":{"code_sha256":"ad55f49e9589b232"}},{"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":"jeniyat/StackOverflowNER","path":"code/Attentive_BiLSTM/model.py","file_url":"https://github.com/jeniyat/StackOverflowNER/blob/HEAD/code/Attentive_BiLSTM/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":"d38f06bbd9f9c98c","code_sha256_prefix":"d38f06bbd9f9c98c","mcp_get_code":{"code_sha256":"d38f06bbd9f9c98c"}},{"arxiv_id":"1809.03186","arxiv_id_is_arxiv":true,"paper":"/paper/off-line-vs-on-line-evaluation-of-recommender","title":"Off-line vs. On-line Evaluation of Recommender Systems in Small E-commerce","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lpeska/REVEAL2018","path":"offLineEval.py","file_url":"https://github.com/lpeska/REVEAL2018/blob/HEAD/offLineEval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lpeska/REVEAL2018 when it was checked","code_sha256":"7df58e7df1d66ab2","code_sha256_prefix":"7df58e7df1d66ab2","mcp_get_code":{"code_sha256":"7df58e7df1d66ab2"}},{"arxiv_id":"1808.09075","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-the-utility-of-hand-crafted","title":"Evaluating the Utility of Hand-crafted Features in Sequence Labelling","date":"2018-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minghao-wu/CRF-AE","path":"model.py","file_url":"https://github.com/minghao-wu/CRF-AE/blob/HEAD/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":"d38f06bbd9f9c98c","code_sha256_prefix":"d38f06bbd9f9c98c","mcp_get_code":{"code_sha256":"d38f06bbd9f9c98c"}},{"arxiv_id":"1807.11622","arxiv_id_is_arxiv":true,"paper":"/paper/count-based-exploration-with-the-successor","title":"Count-Based Exploration with the Successor Representation","date":"2018-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcmachado/count_based_exploration_sr","path":"tabular/utils.py","file_url":"https://github.com/mcmachado/count_based_exploration_sr/blob/HEAD/tabular/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":"e5da063f1d00602e","code_sha256_prefix":"e5da063f1d00602e","mcp_get_code":{"code_sha256":"e5da063f1d00602e"}},{"arxiv_id":"1805.06061","arxiv_id_is_arxiv":true,"paper":"/paper/sopa-bridging-cnns-rnns-and-weighted-finite","title":"SoPa: Bridging CNNs, RNNs, and Weighted Finite-State Machines","date":"2018-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Noahs-ARK/soft_patterns","path":"soft_patterns.py","file_url":"https://github.com/Noahs-ARK/soft_patterns/blob/HEAD/soft_patterns.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":"af68a5b723fbd3c4","code_sha256_prefix":"af68a5b723fbd3c4","mcp_get_code":{"code_sha256":"af68a5b723fbd3c4"}},{"arxiv_id":"1804.02767","arxiv_id_is_arxiv":true,"paper":"/paper/yolov3-an-incremental-improvement","title":"YOLOv3: An Incremental Improvement","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"euske/derpyolo","path":"objutils.py","file_url":"https://github.com/euske/derpyolo/blob/HEAD/objutils.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":"73c23db542d9513e","code_sha256_prefix":"73c23db542d9513e","mcp_get_code":{"code_sha256":"73c23db542d9513e"}},{"arxiv_id":"1311.2540","arxiv_id_is_arxiv":true,"paper":"/paper/asymmetric-numeral-systems-entropy-coding","title":"Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding","date":null,"month_inferred_from_arxiv_id":"2013-11","title_source":"archive","repo":"FGlazov/Python-rANSCoder","path":"src/rans/rANSCoder.py","file_url":"https://github.com/FGlazov/Python-rANSCoder/blob/HEAD/src/rans/rANSCoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"53b7d4919589f88e","code_sha256_prefix":"53b7d4919589f88e","mcp_get_code":{"code_sha256":"53b7d4919589f88e"}},{"arxiv_id":"aaai_30341","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_30341","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"fidelity/selective","path":"feature/utils.py","file_url":"https://github.com/fidelity/selective/blob/HEAD/feature/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":"0df46e800990ab8a","code_sha256_prefix":"0df46e800990ab8a","mcp_get_code":{"code_sha256":"0df46e800990ab8a"}},{"arxiv_id":"2024.naacl-long.241","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.naacl-long.241","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiadongzh/iacos","path":"modelx/rnnx.py","file_url":"https://github.com/jiadongzh/iacos/blob/HEAD/modelx/rnnx.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":"145f8b7ecd30fde4","code_sha256_prefix":"145f8b7ecd30fde4","mcp_get_code":{"code_sha256":"145f8b7ecd30fde4"}},{"arxiv_id":"2024.findings-emnlp.86","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.86","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"FloatAI/TKEval","path":"src/utils.py","file_url":"https://github.com/FloatAI/TKEval/blob/HEAD/src/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d233f39e0fd58dd","code_sha256_prefix":"1d233f39e0fd58dd","mcp_get_code":{"code_sha256":"1d233f39e0fd58dd"}}],"record_sha256":"dd538977cadb7c0149aaee5efa9a6bba7def95b7b90a4e81ba3a59ee12e0bf3c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}