{"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/get-angles","entry":"get_angles","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":21,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":18,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":21,"n_places_pointer_only":14,"n_places_pointer_only_link_open":6,"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":2,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"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":"2406.00670","arxiv_id_is_arxiv":true,"paper":"/paper/cascade-clip-cascaded-vision-language","title":"Cascade-CLIP: Cascaded Vision-Language Embeddings Alignment for Zero-Shot Semantic Segmentation","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hvision-nku/cascade-clip","path":"models/decode_heads/utils.py","file_url":"https://github.com/hvision-nku/cascade-clip/blob/HEAD/models/decode_heads/utils.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 chihchenghsieh/eventlogdice, and GitHub detected no licence in that repository when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2403.14183","arxiv_id_is_arxiv":true,"paper":"/paper/otseg-multi-prompt-sinkhorn-attention-for","title":"OTSeg: Multi-prompt Sinkhorn Attention for Zero-Shot Semantic Segmentation","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cubeyoung/OTSeg","path":"models/decode_heads/utils.py","file_url":"https://github.com/cubeyoung/OTSeg/blob/HEAD/models/decode_heads/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, cubeyoung/OTSeg when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2312.12754","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-prompt-tuning-unveiling-unseen","title":"Spectral Prompt Tuning:Unveiling Unseen Classes for Zero-Shot Semantic Segmentation","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clearxu/spt","path":"models/decode_heads/utils.py","file_url":"https://github.com/clearxu/spt/blob/HEAD/models/decode_heads/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, clearxu/spt when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2312.04147","arxiv_id_is_arxiv":true,"paper":"/paper/an-improved-masking-strategy-for-self","title":"An Improved Masking Strategy for Self-supervised Masked Reconstruction in Human Activity Recognition","date":null,"month_inferred_from_arxiv_id":"2023-12","title_source":"archive","repo":"diheal/channle_masking","path":"utils.py","file_url":"https://github.com/diheal/channle_masking/blob/HEAD/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, diheal/channle_masking when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2310.19727","arxiv_id_is_arxiv":true,"paper":"/paper/generating-medical-instructions-with","title":"Generating Medical Prescriptions with Conditional Transformer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hecta-uom/label-to-text-transformer","path":"Models/EncDecTransformer/Models.py","file_url":"https://github.com/hecta-uom/label-to-text-transformer/blob/HEAD/Models/EncDecTransformer/Models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, hecta-uom/label-to-text-transformer when it was checked","code_sha256":"73080156d02a4f89","code_sha256_prefix":"73080156d02a4f89","mcp_get_code":{"code_sha256":"73080156d02a4f89"}},{"arxiv_id":"2310.13852","arxiv_id_is_arxiv":true,"paper":"/paper/gradual-domain-adaptation-theory-and","title":"Gradual Domain Adaptation: Theory and Algorithms","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifei-he/goat","path":"util.py","file_url":"https://github.com/yifei-he/goat/blob/HEAD/util.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":"2683447b0d0da61c","code_sha256_prefix":"2683447b0d0da61c","mcp_get_code":{"code_sha256":"2683447b0d0da61c"}},{"arxiv_id":"2212.11972","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-adaptive-computation-for-iterative","title":"Scalable Adaptive Computation for Iterative Generation","date":"2022-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/pix2seq","path":"architectures/transformers.py","file_url":"https://github.com/google-research/pix2seq/blob/HEAD/architectures/transformers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c1a5330036a08dfa","code_sha256_prefix":"c1a5330036a08dfa","mcp_get_code":{"code_sha256":"c1a5330036a08dfa"}},{"arxiv_id":"2212.03588","arxiv_id_is_arxiv":true,"paper":"/paper/zegclip-towards-adapting-clip-for-zero-shot","title":"ZegCLIP: Towards Adapting CLIP for Zero-shot Semantic Segmentation","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZiqinZhou66/ZegCLIP","path":"models/decode_heads/utils.py","file_url":"https://github.com/ZiqinZhou66/ZegCLIP/blob/HEAD/models/decode_heads/utils.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 chihchenghsieh/eventlogdice, and GitHub detected no licence in that repository when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2210.07702","arxiv_id_is_arxiv":true,"paper":"/paper/theory-and-approximate-solvers-for-branched","title":"Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hci-unihd/BranchedOT","path":"src/tree_growing_heuristic.py","file_url":"https://github.com/hci-unihd/BranchedOT/blob/HEAD/src/tree_growing_heuristic.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":"e507661252422201","code_sha256_prefix":"e507661252422201","mcp_get_code":{"code_sha256":"e507661252422201"}},{"arxiv_id":"2205.13571","arxiv_id_is_arxiv":true,"paper":"/paper/low-rank-lottery-tickets-finding-efficient","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scsteffen/dlrt-net","path":"src/networks/transformer_dlrt.py","file_url":"https://github.com/scsteffen/dlrt-net/blob/HEAD/src/networks/transformer_dlrt.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 chihchenghsieh/eventlogdice, and GitHub detected no licence in that repository when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"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":"slottar_modules.py","file_url":"https://github.com/agopal42/slottar/blob/HEAD/slottar_modules.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 chihchenghsieh/eventlogdice, and GitHub detected no licence in that repository when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2110.10054","arxiv_id_is_arxiv":true,"paper":"/paper/generating-symbolic-reasoning-problems-with-1","title":"Generating Symbolic Reasoning Problems with Transformer GANs","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reactive-systems/TGAN-SR","path":"impl/tgan_sr/transformer/positional_encoding.py","file_url":"https://github.com/reactive-systems/TGAN-SR/blob/HEAD/impl/tgan_sr/transformer/positional_encoding.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":"370c1f3fe2690649","code_sha256_prefix":"370c1f3fe2690649","mcp_get_code":{"code_sha256":"370c1f3fe2690649"}},{"arxiv_id":"2107.05916","arxiv_id_is_arxiv":true,"paper":"/paper/towards-automatic-instrumentation-by-learning","title":"Towards Automatic Instrumentation by Learning to Separate Parts in Symbolic Multitrack Music","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salu133445/arranger","path":"arranger/lstm/model.py","file_url":"https://github.com/salu133445/arranger/blob/HEAD/arranger/lstm/model.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":"585440080f31568c","code_sha256_prefix":"585440080f31568c","mcp_get_code":{"code_sha256":"585440080f31568c"}},{"arxiv_id":"2003.04218","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-temporal-logics-to-neural-networks","title":"Teaching Temporal Logics to Neural Networks","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reactive-systems/deepltl","path":"deepltl/layers/positional_encoding.py","file_url":"https://github.com/reactive-systems/deepltl/blob/HEAD/deepltl/layers/positional_encoding.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":"370c1f3fe2690649","code_sha256_prefix":"370c1f3fe2690649","mcp_get_code":{"code_sha256":"370c1f3fe2690649"}},{"arxiv_id":"2002.02562","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-transducer-a-streamable-speech","title":"Transformer Transducer: A Streamable Speech Recognition Model with Transformer Encoders and RNN-T Loss","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","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":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"1910.02562","arxiv_id_is_arxiv":true,"paper":"/paper/master-multi-aspect-non-local-network-for","title":"MASTER: Multi-Aspect Non-local Network for Scene Text Recognition","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangxiluning/MASTER-TF","path":"src/model/transformer.py","file_url":"https://github.com/jiangxiluning/MASTER-TF/blob/HEAD/src/model/transformer.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 chihchenghsieh/eventlogdice, and GitHub detected no licence in that repository when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"1905.09904","arxiv_id_is_arxiv":true,"paper":"/paper/cdsa-cross-dimensional-self-attention-for","title":"CDSA: Cross-Dimensional Self-Attention for Multivariate, Geo-tagged Time Series Imputation","date":"2019-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gabriel-Macias/cdsa_imputation","path":"models.py","file_url":"https://github.com/Gabriel-Macias/cdsa_imputation/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 chihchenghsieh/eventlogdice, and GitHub detected no licence in that repository when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"1905.07697","arxiv_id_is_arxiv":true,"paper":"/paper/explaining-machine-learning-classifiers","title":"Explaining Machine Learning Classifiers through Diverse Counterfactual Explanations","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chihchenghsieh/eventlogdice","path":"model/PredNextBERT.py","file_url":"https://github.com/chihchenghsieh/eventlogdice/blob/HEAD/model/PredNextBERT.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, chihchenghsieh/eventlogdice when it was checked","code_sha256":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seunghwan1228/Transfomer-MachineTranslation","path":"models/transformer.py","file_url":"https://github.com/seunghwan1228/Transfomer-MachineTranslation/blob/HEAD/models/transformer.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, seunghwan1228/Transfomer-MachineTranslation when it was checked","code_sha256":"2cf1092de7ac3279","code_sha256_prefix":"2cf1092de7ac3279","mcp_get_code":{"code_sha256":"2cf1092de7ac3279"}},{"arxiv_id":"1704.04368","arxiv_id_is_arxiv":true,"paper":"/paper/get-to-the-point-summarization-with-pointer","title":"Get To The Point: Summarization with Pointer-Generator Networks","date":"2017-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","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":"7816c6d65ab55d8f","code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"quant-ph/9508027","arxiv_id_is_arxiv":true,"paper":"/paper/polynomial-time-algorithms-for-prime","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","date":null,"month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bartek-bartlomiej/master-thesis","path":"gates/beauregard/constant_adder.py","file_url":"https://github.com/bartek-bartlomiej/master-thesis/blob/HEAD/gates/beauregard/constant_adder.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":"ef0e631c995d56f6","code_sha256_prefix":"ef0e631c995d56f6","mcp_get_code":{"code_sha256":"ef0e631c995d56f6"}}],"record_sha256":"e8b76b9170e6fc57d1ca18bc9fd522d1eb6d02a2c0735afa81ddaa1882f4835a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}