{"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-dataloaders","entry":"get_dataloaders","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":8,"n_papers_ran_no_instrument_failure":7,"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":23,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":15,"n_samples_fingerprinted":0,"n_places":23,"n_places_pointer_only":3,"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":0,"ran_fixture":1,"ran":7,"unverified":15},"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.14900","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-14900","title":"GRASP: Gradient-Aligned Sequential Parameter Transfer for Memory-Efficient Multi-Source Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Sekeh-Lab/grasp-multisource-transfer","path":"experiments/grasp/run_grasp_experiment.py","file_url":"https://github.com/Sekeh-Lab/grasp-multisource-transfer/blob/HEAD/experiments/grasp/run_grasp_experiment.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a425378802b4b531","code_sha256_prefix":"a425378802b4b531","mcp_get_code":{"code_sha256":"a425378802b4b531"}},{"arxiv_id":"2606.14259","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-14259","title":"Beyond a Single Explanation of the Adam-SGD Gap","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"orientino/gap","path":"genomics/data.py","file_url":"https://github.com/orientino/gap/blob/HEAD/genomics/data.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":"4740a336be8375d0","code_sha256_prefix":"4740a336be8375d0","mcp_get_code":{"code_sha256":"4740a336be8375d0"}},{"arxiv_id":"2602.07697","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07697","title":"On the Infinite Width and Depth Limits of Predictive Coding Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"thebuckleylab/jpc","path":"experiments/datasets.py","file_url":"https://github.com/thebuckleylab/jpc/blob/HEAD/experiments/datasets.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":"830d4add00e832e7","code_sha256_prefix":"830d4add00e832e7","mcp_get_code":{"code_sha256":"830d4add00e832e7"}},{"arxiv_id":"2507.12001","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.12001","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"wslh852/AUBlendNet","path":"dataset/data_loader.py","file_url":"https://github.com/wslh852/AUBlendNet/blob/HEAD/dataset/data_loader.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":"0ba1ca704c85216a","code_sha256_prefix":"0ba1ca704c85216a","mcp_get_code":{"code_sha256":"0ba1ca704c85216a"}},{"arxiv_id":"2507.06210","arxiv_id_is_arxiv":true,"paper":"/paper/cultureclip-empowering-clip-with-cultural","title":"CultureCLIP: Empowering CLIP with Cultural Awareness through Synthetic Images and Contextualized Captions","date":"2025-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukahhcm/cultureclip","path":"model_finetune/data.py","file_url":"https://github.com/lukahhcm/cultureclip/blob/HEAD/model_finetune/data.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, lukahhcm/cultureclip when it was checked","code_sha256":"10112852bb5ceb00","code_sha256_prefix":"10112852bb5ceb00","mcp_get_code":{"code_sha256":"10112852bb5ceb00"}},{"arxiv_id":"2505.13934","arxiv_id_is_arxiv":true,"paper":"/paper/rlvr-world-training-world-models-with","title":"RLVR-World: Training World Models with Reinforcement Learning","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/RLVR-World","path":"vid_wm/ivideogpt/eval_runenv.py","file_url":"https://github.com/thuml/RLVR-World/blob/HEAD/vid_wm/ivideogpt/eval_runenv.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":"9fdeb5691f697950","code_sha256_prefix":"9fdeb5691f697950","mcp_get_code":{"code_sha256":"9fdeb5691f697950"}},{"arxiv_id":"2505.13934","arxiv_id_is_arxiv":true,"paper":"/paper/rlvr-world-training-world-models-with","title":"RLVR-World: Training World Models with Reinforcement Learning","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/RLVR-World","path":"vid_wm/ivideogpt/eval_vgpt.py","file_url":"https://github.com/thuml/RLVR-World/blob/HEAD/vid_wm/ivideogpt/eval_vgpt.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":"84199c73adefd0fc","code_sha256_prefix":"84199c73adefd0fc","mcp_get_code":{"code_sha256":"84199c73adefd0fc"}},{"arxiv_id":"2405.15223","arxiv_id_is_arxiv":true,"paper":"/paper/ivideogpt-interactive-videogpts-are-scalable","title":"iVideoGPT: Interactive VideoGPTs are Scalable World Models","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/iVideoGPT","path":"train_gpt.py","file_url":"https://github.com/thuml/iVideoGPT/blob/HEAD/train_gpt.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":"e8b08bcb092a8f81","code_sha256_prefix":"e8b08bcb092a8f81","mcp_get_code":{"code_sha256":"e8b08bcb092a8f81"}},{"arxiv_id":"2310.15817","arxiv_id_is_arxiv":true,"paper":"/paper/discriminator-guidance-for-autoregressive","title":"Discriminator Guidance for Autoregressive Diffusion Models","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"filipekstrm/graph_ardm","path":"src/dataset/dataset.py","file_url":"https://github.com/filipekstrm/graph_ardm/blob/HEAD/src/dataset/dataset.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, filipekstrm/graph_ardm when it was checked","code_sha256":"f61613e78442e4b2","code_sha256_prefix":"f61613e78442e4b2","mcp_get_code":{"code_sha256":"f61613e78442e4b2"}},{"arxiv_id":"2307.10404","arxiv_id_is_arxiv":true,"paper":"/paper/interpreting-and-correcting-medical-image","title":"Interpreting and Correcting Medical Image Classification with PIP-Net","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m-nauta/pipnet","path":"util/data.py","file_url":"https://github.com/m-nauta/pipnet/blob/HEAD/util/data.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, m-nauta/pipnet when it was checked","code_sha256":"595b1dbf510e516b","code_sha256_prefix":"595b1dbf510e516b","mcp_get_code":{"code_sha256":"595b1dbf510e516b"}},{"arxiv_id":"2306.03962","arxiv_id_is_arxiv":true,"paper":"/paper/pillar-how-to-make-semi-private-learning-more","title":"PILLAR: How to make semi-private learning more effective","date":"2023-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FrancescoPinto/PILLAR","path":"utils.py","file_url":"https://github.com/FrancescoPinto/PILLAR/blob/HEAD/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":"44d01d8fe81d5392","code_sha256_prefix":"44d01d8fe81d5392","mcp_get_code":{"code_sha256":"44d01d8fe81d5392"}},{"arxiv_id":"2302.06359","arxiv_id_is_arxiv":true,"paper":"/paper/fixing-overconfidence-in-dynamic-neural","title":"Fixing Overconfidence in Dynamic Neural Networks","date":"2023-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaltoml/calibrated-dnn","path":"dataloader.py","file_url":"https://github.com/aaltoml/calibrated-dnn/blob/HEAD/dataloader.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":"6ab6ac3cf72849e7","code_sha256_prefix":"6ab6ac3cf72849e7","mcp_get_code":{"code_sha256":"6ab6ac3cf72849e7"}},{"arxiv_id":"2212.13554","arxiv_id_is_arxiv":true,"paper":"/paper/nern-learning-neural-representations-for","title":"NeRN -- Learning Neural Representations for Neural Networks","date":"2022-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maorash/nern","path":"NeRN/tasks/imagenet_helpers.py","file_url":"https://github.com/maorash/nern/blob/HEAD/NeRN/tasks/imagenet_helpers.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":"f39c3e4ba3afe858","code_sha256_prefix":"f39c3e4ba3afe858","mcp_get_code":{"code_sha256":"f39c3e4ba3afe858"}},{"arxiv_id":"2211.16726","arxiv_id_is_arxiv":true,"paper":"/paper/boosted-dynamic-neural-networks","title":"Boosted Dynamic Neural Networks","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SHI-Labs/Boosted-Dynamic-Networks","path":"dataloader.py","file_url":"https://github.com/SHI-Labs/Boosted-Dynamic-Networks/blob/HEAD/dataloader.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":"e26baa07200cad5a","code_sha256_prefix":"e26baa07200cad5a","mcp_get_code":{"code_sha256":"e26baa07200cad5a"}},{"arxiv_id":"2109.06379","arxiv_id_is_arxiv":true,"paper":"/paper/compression-transduction-and-creation-a","title":"Compression, Transduction, and Creation: A Unified Framework for Evaluating Natural Language Generation","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanyuqian/ctc-gen-eval","path":"ctc_score/data_utils/data_utils.py","file_url":"https://github.com/tanyuqian/ctc-gen-eval/blob/HEAD/ctc_score/data_utils/data_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":"e9fc6d93b3c4e519","code_sha256_prefix":"e9fc6d93b3c4e519","mcp_get_code":{"code_sha256":"e9fc6d93b3c4e519"}},{"arxiv_id":"1908.09006","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-organization-and-inference-of-an","title":"Large Scale Organization and Inference of an Imagery Dataset for Public Safety","date":"2019-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LADI-Dataset/ladi-overview","path":"training/config_dataloader.py","file_url":"https://github.com/LADI-Dataset/ladi-overview/blob/HEAD/training/config_dataloader.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":"4cf20d9e7e99b470","code_sha256_prefix":"4cf20d9e7e99b470","mcp_get_code":{"code_sha256":"4cf20d9e7e99b470"}},{"arxiv_id":"1901.06033","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-representations-with-poincare","title":"Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders","date":"2019-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omiethescientist/HyperbolicDeepLearning","path":"HVAE/Data.py","file_url":"https://github.com/omiethescientist/HyperbolicDeepLearning/blob/HEAD/HVAE/Data.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":"82ae9a25c955fb4c","code_sha256_prefix":"82ae9a25c955fb4c","mcp_get_code":{"code_sha256":"82ae9a25c955fb4c"}},{"arxiv_id":"1810.12735","arxiv_id_is_arxiv":true,"paper":"/paper/spoken-language-understanding-on-the-edge","title":"Spoken Language Understanding on the Edge","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CoraJung/flexible-input-slu","path":"bert/data.py","file_url":"https://github.com/CoraJung/flexible-input-slu/blob/HEAD/bert/data.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":"add880586a716006","code_sha256_prefix":"add880586a716006","mcp_get_code":{"code_sha256":"add880586a716006"}},{"arxiv_id":"1810.05997","arxiv_id_is_arxiv":true,"paper":"/paper/predict-then-propagate-graph-neural-networks","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","date":"2018-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"klicperajo/ppnp","path":"ppnp/pytorch/training.py","file_url":"https://github.com/klicperajo/ppnp/blob/HEAD/ppnp/pytorch/training.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":"a75db933b77e116f","code_sha256_prefix":"a75db933b77e116f","mcp_get_code":{"code_sha256":"a75db933b77e116f"}},{"arxiv_id":"1805.08318","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-generative-adversarial","title":"Self-Attention Generative Adversarial Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rahulkulhalli/ISIC2019","path":"utils.py","file_url":"https://github.com/rahulkulhalli/ISIC2019/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":"ad810d34df32ec81","code_sha256_prefix":"ad810d34df32ec81","mcp_get_code":{"code_sha256":"ad810d34df32ec81"}},{"arxiv_id":"1703.09844","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-dense-networks-for-resource","title":"Multi-Scale Dense Networks for Resource Efficient Image Classification","date":"2017-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kalviny/MSDNet-PyTorch","path":"dataloader.py","file_url":"https://github.com/kalviny/MSDNet-PyTorch/blob/HEAD/dataloader.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":"b51a9a4dd721bcbc","code_sha256_prefix":"b51a9a4dd721bcbc","mcp_get_code":{"code_sha256":"b51a9a4dd721bcbc"}},{"arxiv_id":"ijcai2024_0102","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0102","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mRobotit/M2Beats","path":"data_loader.py","file_url":"https://github.com/mRobotit/M2Beats/blob/HEAD/data_loader.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":"16f4a41d3b594606","code_sha256_prefix":"16f4a41d3b594606","mcp_get_code":{"code_sha256":"16f4a41d3b594606"}},{"arxiv_id":"Huang_Task-Adaptive_Negative_Envision_for_Few-Shot_Open-Set_Recognition_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_Task-Adaptive_Negative_Envision_for_Few-Shot_Open-Set_Recognition_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shiyuanh/TANE","path":"dataloader/dataloader.py","file_url":"https://github.com/shiyuanh/TANE/blob/HEAD/dataloader/dataloader.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":"26d8cf61c5515f20","code_sha256_prefix":"26d8cf61c5515f20","mcp_get_code":{"code_sha256":"26d8cf61c5515f20"}}],"record_sha256":"83e51535e5b9b64ab939e454b6db89edaa4f23396851b2e8cad7b35376c85031","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}