{"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":"/method/ghost-module","slug":"ghost-module","name":"Ghost Module","full_name":"Ghost Module","full_name_withheld":false,"description_markdown":"A **Ghost Module** is an image block for convolutional neural network that aims to generate more features by using fewer parameters. Specifically, an ordinary convolutional layer in deep neural networks is split into two parts. The first part involves ordinary convolutions but their total number is controlled. Given the intrinsic feature maps from the first part, a series of simple linear operations are applied for generating more feature maps. \r\n\r\nGiven the widely existing redundancy in intermediate feature maps calculated by mainstream CNNs, ghost modules aim to reduce them. In practice, given the input data $X\\in\\mathbb{R}^{c\\times h\\times w}$, where $c$ is the number of input channels and $h$ and $w$ are the height and width of the input data, respectively,  the operation of an arbitrary convolutional layer for producing $n$ feature maps can be formulated as\r\n\r\n$$\r\nY = X*f+b,\r\n$$\r\n\r\nwhere $*$ is the [convolution](https://paperswithcode.com/method/convolution) operation, $b$ is the bias term, $Y\\in\\mathbb{R}^{h'\\times w'\\times n}$ is the output feature map with $n$ channels, and $f\\in\\mathbb{R}^{c\\times k\\times k \\times n}$ is the convolution filters in this layer. In addition, $h'$ and $w'$ are the height and width of the output data, and $k\\times k$ is the kernel size of convolution filters $f$, respectively. During this convolution procedure, the required number of FLOPs can be calculated as $n\\cdot h'\\cdot w'\\cdot c\\cdot k\\cdot k$, which is often as large as hundreds of thousands since the number of filters $n$ and the channel number $c$ are generally very large (e.g. 256 or 512).\r\n\r\nHere, the number of parameters (in $f$ and $b$) to be optimized is explicitly determined by the dimensions of input and output feature maps. The output feature maps of convolutional layers often contain much redundancy, and some of them could be similar with each other. We point out that it is unnecessary to generate these redundant feature maps one by one with large number of FLOPs and parameters. Suppose that the output feature maps are *ghosts* of a handful of intrinsic feature maps with some cheap transformations. These intrinsic feature maps are often of smaller size and produced by ordinary convolution filters. Specifically, $m$ intrinsic feature maps $Y'\\in\\mathbb{R}^{h'\\times w'\\times m}$ are generated using a primary convolution:\r\n\r\n$$\r\nY' = X*f',\r\n$$\r\n\r\nwhere $f'\\in\\mathbb{R}^{c\\times k\\times k \\times m}$ is the utilized filters, $m\\leq n$ and the bias term is omitted for simplicity. The hyper-parameters such as filter size, stride, padding, are the same as those in the ordinary convolution to keep the spatial size (ie $h'$ and $w'$) of the output feature maps consistent. To further obtain the desired $n$ feature maps, we apply a series of cheap linear operations on each intrinsic feature in $Y'$ to generate $s$ ghost features according to the following function:\r\n\r\n$$\r\ny_{ij} = \\Phi_{i,j}(y'_i),\\quad \\forall\\; i = 1,...,m,\\;\\; j = 1,...,s,\r\n$$\r\n\r\nwhere $y'\\_i$ is the $i$-th intrinsic feature map in $Y'$, $\\Phi\\_{i,j}$ in the above function is the $j$-th (except the last one) linear operation for generating the $j$-th ghost feature map $y_{ij}$, that is to say, $y'\\_i$ can have one or more ghost feature maps $\\{y\\_{ij}\\}\\_{j=1}^{s}$. The last $\\Phi\\_{i,s}$ is the identity mapping for preserving the intrinsic feature maps. we can obtain $n=m\\cdot s$ feature maps $Y=[y\\_{11},y\\_{12},\\cdots,y\\_{ms}]$ as the output data of a Ghost module. Note that the linear operations $\\Phi$ operate on each channel whose computational cost is much less than the ordinary convolution. In practice, there could be several different linear operations in a Ghost module, eg $3\\times 3$ and $5\\times5$ linear kernels, which will be analyzed in the experiment part.","description_state":"present","introduced_year":null,"introduced_by":{"title":"GhostNet: More Features from Cheap Operations","paper":"/paper/ghostnet-more-features-from-cheap-operations","first_author":"Kai Han","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/ghostnet-more-features-from-cheap-operations"},"source":{"url":"https://arxiv.org/abs/1911.11907v2","title":"GhostNet: More Features from Cheap Operations","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/huawei-noah/ghostnet/blob/e8c449210c833996e14ffcdd3946ecdbb7098fd1/pytorch/ghostnet.py#L76","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Image Model Blocks","url":"/methods/category/image-model-blocks","pwc_aliases":[]}],"n_papers_tagged":30,"archive_num_papers":30,"papers_newest_first":[{"paper":null,"slug":"2505-10577","title":"GRNN:Recurrent Neural Network based on Ghost Features for Video Super-Resolution","date":"2025-05-14","arxiv_id":"2505.10577","n_code_links":0,"syntology":null},{"paper":"/paper/cross-video-identity-correlating-for-person","slug":"cross-video-identity-correlating-for-person","title":"Cross-video Identity Correlating for Person Re-identification Pre-training","date":"2024-09-27","arxiv_id":"2409.18569","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["zplusdragon/cion_reidzoo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/a-lightweight-insulator-defect-detection","slug":"a-lightweight-insulator-defect-detection","title":"A Lightweight Insulator Defect Detection Model Based on Drone Images","date":"2024-08-26","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/idd-yolov5-a-lightweight-insulator-defect","slug":"idd-yolov5-a-lightweight-insulator-defect","title":"IDD-YOLOv5: A Lightweight Insulator Defect Real-time Detection Algorithm","date":"2024-08-19","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"a-lightweight-yolov5-ffm-model-for-occlusion","title":"A lightweight YOLOv5-FFM model for occlusion pedestrian detection","date":"2024-08-13","arxiv_id":"2408.06633","n_code_links":0,"syntology":null},{"paper":"/paper/liteyolo-id-a-lightweight-object-detection","slug":"liteyolo-id-a-lightweight-object-detection","title":"LiteYOLO-ID: A Lightweight Object Detection Network for Insulator Defect Detection","date":"2024-06-24","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"multimodal-emotion-recognition-based-on","title":"Multimodal Emotion Recognition based on Facial Expressions, Speech, and EEG","date":"2024-06-11","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"ghost-stereo-ghostnet-based-cost-volume","title":"Ghost-Stereo: GhostNet-based Cost Volume Enhancement and Aggregation for Stereo Matching Networks","date":"2024-05-23","arxiv_id":"2405.14520","n_code_links":0,"syntology":null},{"paper":null,"slug":"gran-ghost-residual-attention-network-for","title":"GRAN: Ghost Residual Attention Network for Single Image Super Resolution","date":"2023-02-28","arxiv_id":"2302.14557","n_code_links":0,"syntology":null},{"paper":null,"slug":"short-term-memory-convolutions","title":"Short-Term Memory Convolutions","date":"2023-02-08","arxiv_id":"2302.04331","n_code_links":0,"syntology":null},{"paper":"/paper/ghostnetv2-enhance-cheap-operation-with-long","slug":"ghostnetv2-enhance-cheap-operation-with-long","title":"GhostNetV2: Enhance Cheap Operation with Long-Range Attention","date":"2022-11-23","arxiv_id":"2211.12905","n_code_links":12,"syntology":{"ran":8,"of":10,"n_ran_checked":8,"n_instrument":0,"unverified":2,"pointer_only":10,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":"/paper/repghost-a-hardware-efficient-ghost-module","slug":"repghost-a-hardware-efficient-ghost-module","title":"RepGhost: A Hardware-Efficient Ghost Module via Re-parameterization","date":"2022-11-11","arxiv_id":"2211.06088","n_code_links":3,"syntology":{"ran":10,"of":17,"n_ran_checked":6,"n_instrument":4,"unverified":7,"pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","official":{"repos":["chengpengchen/repghost","rwightman/pytorch-image-models"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/network-amplification-with-efficient-macs","slug":"network-amplification-with-efficient-macs","title":"Network Amplification With Efficient MACs Allocation","date":"2022-07-01","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":null,"slug":"yolov5s-gtb-light-weighted-and-improved","title":"YOLOv5s-GTB: light-weighted and improved YOLOv5s for bridge crack detection","date":"2022-06-03","arxiv_id":"2206.01498","n_code_links":0,"syntology":null},{"paper":"/paper/mocovit-mobile-convolutional-vision","slug":"mocovit-mobile-convolutional-vision","title":"MoCoViT: Mobile Convolutional Vision Transformer","date":"2022-05-25","arxiv_id":"2205.12635","n_code_links":1,"syntology":null},{"paper":"/paper/triplenet-a-low-computing-power-platform-of","slug":"triplenet-a-low-computing-power-platform-of","title":"Efficient Convolutional Neural Networks on Raspberry Pi for Image Classification","date":"2022-04-02","arxiv_id":"2204.00943","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["RuiyangJu/TripleNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/threshnet-an-efficient-densenet-using","slug":"threshnet-an-efficient-densenet-using","title":"ThreshNet: An Efficient DenseNet Using Threshold Mechanism to Reduce Connections","date":"2022-01-09","arxiv_id":"2201.03013","n_code_links":1,"syntology":null},{"paper":"/paper/gpu-net-lightweight-u-net-with-more-diverse","slug":"gpu-net-lightweight-u-net-with-more-diverse","title":"GPU-Net: Lightweight U-Net with more diverse features","date":"2022-01-07","arxiv_id":"2201.02656","n_code_links":1,"syntology":null},{"paper":null,"slug":"ghost-dil-netvlad-a-lightweight-neural","title":"Ghost-dil-NetVLAD: A Lightweight Neural Network for Visual Place Recognition","date":"2021-12-22","arxiv_id":"2112.11679","n_code_links":0,"syntology":null},{"paper":"/paper/ghostshiftaddnet-more-features-from-energy","slug":"ghostshiftaddnet-more-features-from-energy","title":"GhostShiftAddNet: More Features from Energy-Efficient Operations","date":"2021-09-20","arxiv_id":"2109.09495","n_code_links":3,"syntology":null},{"paper":null,"slug":"ghostbert-generate-more-features-with-cheap","title":"GhostBERT: Generate More Features with Cheap Operations for BERT","date":"2021-08-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/greedy-network-enlarging","slug":"greedy-network-enlarging","title":"Greedy Network Enlarging","date":"2021-07-31","arxiv_id":"2108.00177","n_code_links":1,"syntology":null},{"paper":null,"slug":"adafuse-adaptive-temporal-fusion-network-for-1","title":"AdaFuse: Adaptive Temporal Fusion Network for Efficient Action Recognition","date":"2021-02-10","arxiv_id":"2102.05775","n_code_links":0,"syntology":null},{"paper":"/paper/tokens-to-token-vit-training-vision","slug":"tokens-to-token-vit-training-vision","title":"Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNet","date":"2021-01-28","arxiv_id":"2101.11986","n_code_links":13,"syntology":{"ran":21,"of":26,"n_ran_checked":21,"n_instrument":0,"unverified":5,"pointer_only":8,"phrase":"21 ran (of which 16 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 0 violated, 20 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["yitu-opensource/T2T-ViT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/ghostsr-learning-ghost-features-for-efficient","slug":"ghostsr-learning-ghost-features-for-efficient","title":"GhostSR: Learning Ghost Features for Efficient Image Super-Resolution","date":"2021-01-21","arxiv_id":"2101.08525","n_code_links":4,"syntology":null},{"paper":null,"slug":"a-multi-task-joint-framework-for-real-time","title":"A Multi-task Joint Framework for Real-time Person Search","date":"2020-12-11","arxiv_id":"2012.06418","n_code_links":0,"syntology":null},{"paper":null,"slug":"cabinet-efficient-context-aggregation-network","title":"Real-time Semantic Segmentation with Context Aggregation Network","date":"2020-11-02","arxiv_id":"2011.00993","n_code_links":0,"syntology":null},{"paper":"/paper/model-rubik-s-cube-twisting-resolution-depth","slug":"model-rubik-s-cube-twisting-resolution-depth","title":"Model Rubik's Cube: Twisting Resolution, Depth and Width for TinyNets","date":"2020-10-28","arxiv_id":"2010.14819","n_code_links":9,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["huawei-noah/CV-backbones","huawei-noah/ghostnet"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"paper":"/paper/hs-resnet-hierarchical-split-block-on","slug":"hs-resnet-hierarchical-split-block-on","title":"HS-ResNet: Hierarchical-Split Block on Convolutional Neural Network","date":"2020-10-15","arxiv_id":"2010.07621","n_code_links":2,"syntology":null},{"paper":"/paper/ghostnet-more-features-from-cheap-operations","slug":"ghostnet-more-features-from-cheap-operations","title":"GhostNet: More Features from Cheap Operations","date":"2019-11-27","arxiv_id":"1911.11907","n_code_links":33,"syntology":{"ran":19,"of":23,"n_ran_checked":16,"n_instrument":3,"unverified":4,"pointer_only":5,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 3 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","official":{"repos":["huawei-noah/ghostnet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":30,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":30,"with_a_code_link":18,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":30,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/method/ghost-module/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/ghost-module/papers/ran/1","json":"/method/ghost-module/papers/ran/1.json","rows":5}],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":8},{"task":"/task/object-detection","name":"Object Detection","papers":5},{"task":"/task/image-classification","name":"image-classification","papers":5},{"task":"/task/defect-detection","name":"Defect Detection","papers":3},{"task":null,"name":"GPU","papers":3},{"task":"/task/insulator-defect-detection","name":"Insulator Defect Detection","papers":3},{"task":"/task/segmentation","name":"Segmentation","papers":3},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":3},{"task":"/task/super-resolution","name":"Super-Resolution","papers":3},{"task":"/task/object-detection-1","name":"object-detection","papers":3},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":2},{"task":"/task/image-super-resolution","name":"Image Super-Resolution","papers":2},{"task":"/task/model-compression","name":"Model Compression","papers":2},{"task":"/task/small-object-detection","name":"Small Object Detection","papers":2},{"task":"/task/acoustic-scene-classification","name":"Acoustic Scene Classification","papers":1},{"task":"/task/action-recognition-in-videos","name":"Action Recognition","papers":1},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1}],"tasks_shown":20,"n_tasks":45,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":4},{"year":"2021","papers":7},{"year":"2022","papers":8},{"year":"2023","papers":2},{"year":"2024","papers":7},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/ghost-module"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Ghost%20Module","read_at":"2026-10-05T00:56:51+00:00","query":"Ghost Module","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"GHOST","origin_arxiv_id":"2502.03359"},"resolution":"token_match","resolved_name_differs":true,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1911.11907","repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2502.03359","citations":3},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Ghost Module'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"mixed ghost clipping","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='mixed ghost clipping')","origin_arxiv_id":"2205.10683"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2502.03359","page":null,"syntology_url":"https://syntology.ai/paper/2502.03359","in_graph_layer":false,"samples":0},"line":"code not checked for this name. The lookup matched a different name in Syntology's graph, 'GHOST' (resolution: token_match), and its answer is about that name only, so it does not say whether this method has code. About another paper: this answer is about arXiv:2502.03359, while the archive credits arXiv:1911.11907.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"0022a57f4aca4223f0c6b98c0ccb424cd0e1c576f9d8241e256b3db9392287a5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}