{"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-model-size","entry":"get_model_size","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":20,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":10,"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":15,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":22,"n_places_pointer_only":7,"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":4,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":5,"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":"2606.00869","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00869","title":"Enhancing LLM Metacognition via Cognitive Pairwise Training","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Tsinghua-dhy/CPT","path":"data_construction/2_pair/build_pairs.py","file_url":"https://github.com/Tsinghua-dhy/CPT/blob/HEAD/data_construction/2_pair/build_pairs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"faa29ea87424c295","code_sha256_prefix":"faa29ea87424c295","mcp_get_code":{"code_sha256":"faa29ea87424c295"}},{"arxiv_id":"2602.07063","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07063","title":"Video-based Music Generation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"serkansulun/emsync","path":"utils.py","file_url":"https://github.com/serkansulun/emsync/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, serkansulun/emsync (NOASSERTION)","code_sha256":"a2e74f864f0823aa","code_sha256_prefix":"a2e74f864f0823aa","mcp_get_code":{"code_sha256":"a2e74f864f0823aa"}},{"arxiv_id":"2601.02609","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02609","title":"Chronicals: A High-Performance Framework for LLM Fine-Tuning with 3.51x Speedup over Unsloth","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Ajwebdevs/Chronicals","path":"chronicals/lora/lora_presets.py","file_url":"https://github.com/Ajwebdevs/Chronicals/blob/HEAD/chronicals/lora/lora_presets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Ajwebdevs/Chronicals (NOASSERTION)","code_sha256":"c8e820f2fc086863","code_sha256_prefix":"c8e820f2fc086863","mcp_get_code":{"code_sha256":"c8e820f2fc086863"}},{"arxiv_id":"2506.01908","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-tuning-for-videollms","title":"Reinforcement Learning Tuning for VideoLLMs: Reward Design and Data Efficiency","date":"2025-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"appletea233/temporal-r1","path":"verl/utils/model_utils.py","file_url":"https://github.com/appletea233/temporal-r1/blob/HEAD/verl/utils/model_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":"72a08db62254116d","code_sha256_prefix":"72a08db62254116d","mcp_get_code":{"code_sha256":"72a08db62254116d"}},{"arxiv_id":"2503.13465","arxiv_id_is_arxiv":true,"paper":"/paper/a-novel-fourier-adjacency-transformer-for","title":"A novel Fourier Adjacency Transformer for advanced EEG emotion recognition","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YanhaoHuang23/FAT","path":"SEED_VII_dependent.py","file_url":"https://github.com/YanhaoHuang23/FAT/blob/HEAD/SEED_VII_dependent.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":"f01ef84bffad2c9f","code_sha256_prefix":"f01ef84bffad2c9f","mcp_get_code":{"code_sha256":"f01ef84bffad2c9f"}},{"arxiv_id":"2408.05646","arxiv_id_is_arxiv":true,"paper":"/paper/eigen-attention-attention-in-low-rank-space","title":"Eigen Attention: Attention in Low-Rank Space for KV Cache Compression","date":"2024-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utkarshsaxena1/eigenattn","path":"main_eigen_attn.py","file_url":"https://github.com/utkarshsaxena1/eigenattn/blob/HEAD/main_eigen_attn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, utkarshsaxena1/eigenattn when it was checked","code_sha256":"fc00410022bf942a","code_sha256_prefix":"fc00410022bf942a","mcp_get_code":{"code_sha256":"fc00410022bf942a"}},{"arxiv_id":"2406.01805","arxiv_id_is_arxiv":true,"paper":"/paper/tabmda-tabular-manifold-data-augmentation-for","title":"TabMDA: Tabular Manifold Data Augmentation for Any Classifier using Transformers with In-context Subsetting","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adrianbzg/tabmda","path":"utils.py","file_url":"https://github.com/adrianbzg/tabmda/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7def069f21916ca","code_sha256_prefix":"b7def069f21916ca","mcp_get_code":{"code_sha256":"b7def069f21916ca"}},{"arxiv_id":"2404.03646","arxiv_id_is_arxiv":true,"paper":"/paper/locating-and-editing-factual-associations-in","title":"Locating and Editing Factual Associations in Mamba","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnab-api/romba","path":"src/models.py","file_url":"https://github.com/arnab-api/romba/blob/HEAD/src/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, arnab-api/romba when it was checked","code_sha256":"9c1a143d0e706278","code_sha256_prefix":"9c1a143d0e706278","mcp_get_code":{"code_sha256":"9c1a143d0e706278"}},{"arxiv_id":"2403.05659","arxiv_id_is_arxiv":true,"paper":"/paper/audio-synchronized-visual-animation","title":"Audio-Synchronized Visual Animation","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzhangbj/ASVA","path":"avgen/utils.py","file_url":"https://github.com/lzhangbj/ASVA/blob/HEAD/avgen/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, lzhangbj/ASVA when it was checked","code_sha256":"aabcaf5e9e94e16a","code_sha256_prefix":"aabcaf5e9e94e16a","mcp_get_code":{"code_sha256":"aabcaf5e9e94e16a"}},{"arxiv_id":"2312.15614","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-evaluation-of-parameter","title":"A Comprehensive Evaluation of Parameter-Efficient Fine-Tuning on Software Engineering Tasks","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwtnju/peft","path":"clone/code/utils.py","file_url":"https://github.com/zwtnju/peft/blob/HEAD/clone/code/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, zwtnju/peft when it was checked","code_sha256":"73ade802c00b1275","code_sha256_prefix":"73ade802c00b1275","mcp_get_code":{"code_sha256":"73ade802c00b1275"}},{"arxiv_id":"2312.04234","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/gfsa","path":"Code/models.py","file_url":"https://github.com/jeongwhanchoi/gfsa/blob/HEAD/Code/models.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":"8cfe38019e9d6a49","code_sha256_prefix":"8cfe38019e9d6a49","mcp_get_code":{"code_sha256":"8cfe38019e9d6a49"}},{"arxiv_id":"2311.00317","arxiv_id_is_arxiv":true,"paper":"/paper/data-augmentation-for-code-translation-with","title":"Data Augmentation for Code Translation with Comparable Corpora and Multiple References","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"veronicium/cmtrans","path":"codet5/models.py","file_url":"https://github.com/veronicium/cmtrans/blob/HEAD/codet5/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, veronicium/cmtrans when it was checked","code_sha256":"8cfe38019e9d6a49","code_sha256_prefix":"8cfe38019e9d6a49","mcp_get_code":{"code_sha256":"8cfe38019e9d6a49"}},{"arxiv_id":"2310.00752","arxiv_id_is_arxiv":true,"paper":"/paper/tigerscore-towards-building-explainable","title":"TIGERScore: Towards Building Explainable Metric for All Text Generation Tasks","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TIGER-AI-Lab/TIGERScore","path":"tigerscore/candidates_generation/generate_candidates.py","file_url":"https://github.com/TIGER-AI-Lab/TIGERScore/blob/HEAD/tigerscore/candidates_generation/generate_candidates.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":"eb2c3c1c949f4587","code_sha256_prefix":"eb2c3c1c949f4587","mcp_get_code":{"code_sha256":"eb2c3c1c949f4587"}},{"arxiv_id":"2309.16540","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-fact-verification-by-language","title":"Unsupervised Pretraining for Fact Verification by Language Model Distillation","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AdrianBZG/SFAVEL","path":"src/utils.py","file_url":"https://github.com/AdrianBZG/SFAVEL/blob/HEAD/src/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7def069f21916ca","code_sha256_prefix":"b7def069f21916ca","mcp_get_code":{"code_sha256":"b7def069f21916ca"}},{"arxiv_id":"2306.07285","arxiv_id_is_arxiv":true,"paper":"/paper/transcoder-towards-unified-transferable-code","title":"TransCoder: Towards Unified Transferable Code Representation Learning Inspired by Human Skills","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiushisun/transcoder","path":"models_2.py","file_url":"https://github.com/qiushisun/transcoder/blob/HEAD/models_2.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":"8cfe38019e9d6a49","code_sha256_prefix":"8cfe38019e9d6a49","mcp_get_code":{"code_sha256":"8cfe38019e9d6a49"}},{"arxiv_id":"2306.07285","arxiv_id_is_arxiv":true,"paper":"/paper/transcoder-towards-unified-transferable-code","title":"TransCoder: Towards Unified Transferable Code Representation Learning Inspired by Human Skills","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiushisun/transcoder","path":"models.py","file_url":"https://github.com/qiushisun/transcoder/blob/HEAD/models.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":"a719263e88013c50","code_sha256_prefix":"a719263e88013c50","mcp_get_code":{"code_sha256":"a719263e88013c50"}},{"arxiv_id":"2305.17506","arxiv_id_is_arxiv":true,"paper":"/paper/backdooring-neural-code-search","title":"Backdooring Neural Code Search","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wssun/BADCODE","path":"src/CodeT5/models.py","file_url":"https://github.com/wssun/BADCODE/blob/HEAD/src/CodeT5/models.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":"8cfe38019e9d6a49","code_sha256_prefix":"8cfe38019e9d6a49","mcp_get_code":{"code_sha256":"8cfe38019e9d6a49"}},{"arxiv_id":"2207.11680","arxiv_id_is_arxiv":true,"paper":"/paper/no-more-fine-tuning-an-experimental","title":"No More Fine-Tuning? An Experimental Evaluation of Prompt Tuning in Code Intelligence","date":"2022-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adf1178/pt4code","path":"CodeT5-main/models.py","file_url":"https://github.com/adf1178/pt4code/blob/HEAD/CodeT5-main/models.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":"8cfe38019e9d6a49","code_sha256_prefix":"8cfe38019e9d6a49","mcp_get_code":{"code_sha256":"8cfe38019e9d6a49"}},{"arxiv_id":"2206.07796","arxiv_id_is_arxiv":true,"paper":"/paper/fixeval-execution-based-evaluation-of-program","title":"FixEval: Execution-based Evaluation of Program Fixes for Programming Problems","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahimanzum/fixeval","path":"codet5/models.py","file_url":"https://github.com/mahimanzum/fixeval/blob/HEAD/codet5/models.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":"8cfe38019e9d6a49","code_sha256_prefix":"8cfe38019e9d6a49","mcp_get_code":{"code_sha256":"8cfe38019e9d6a49"}},{"arxiv_id":"1912.10211","arxiv_id_is_arxiv":true,"paper":"/paper/panns-large-scale-pretrained-audio-neural-1","title":"PANNs: Large-Scale Pretrained Audio Neural Networks for Audio Pattern Recognition","date":null,"month_inferred_from_arxiv_id":"2019-12","title_source":"archive","repo":"sithu31296/audio-tagging","path":"utils/utils.py","file_url":"https://github.com/sithu31296/audio-tagging/blob/HEAD/utils/utils.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":"93c4d29ae02a17c2","code_sha256_prefix":"93c4d29ae02a17c2","mcp_get_code":{"code_sha256":"93c4d29ae02a17c2"}},{"arxiv_id":"1909.09436","arxiv_id_is_arxiv":true,"paper":"/paper/codesearchnet-challenge-evaluating-the-state","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","date":"2019-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nchen909/codeattention","path":"models.py","file_url":"https://github.com/nchen909/codeattention/blob/HEAD/models.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":"8cfe38019e9d6a49","code_sha256_prefix":"8cfe38019e9d6a49","mcp_get_code":{"code_sha256":"8cfe38019e9d6a49"}},{"arxiv_id":"1908.00080","arxiv_id_is_arxiv":true,"paper":"/paper/machine-learning-at-the-network-edge-a-survey","title":"Machine Learning at the Network Edge: A Survey","date":"2019-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umitkacar/ai-edge-computing","path":"src/ai_edge_tinyml/utils.py","file_url":"https://github.com/umitkacar/ai-edge-computing/blob/HEAD/src/ai_edge_tinyml/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":"5c7ac854ed73426a","code_sha256_prefix":"5c7ac854ed73426a","mcp_get_code":{"code_sha256":"5c7ac854ed73426a"}}],"record_sha256":"3f98b3fc93aeec49e75c3fc6fc21075cc6692b6051603255431a60ad38cf45b0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}