{"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/sca","slug":"sca","name":"SCA","full_name":"Semantic Cross Attention","full_name_withheld":false,"description_markdown":"Semantic Cross Attention (SCA) is based on cross attention, which we restrict with respect to a semantic mask.\r\n\r\nThe goal of SCA is two-fold depending on what is the query and what is the key. Either it allows to give the feature map information from a semantically restricted set of latents or, respectively, it allows a set of latents to retrieve information in a semantically restricted region of the feature map. \r\n\r\nSCA is defined as:  \r\n\r\n\\begin{equation}\r\n    \\text{SCA}(I_{1}, I_{2}, I_{3}) = \\sigma\\left(\\frac{QK^T\\odot I_{3} +\\tau \\left(1-I_{3}\\right)}{\\sqrt{d_{in}}}\\right)V \\quad ,\r\n\\end{equation}\r\n\r\nwhere $I_{1},I_{2},I_{3}$ the inputs, with $I_{1}$ attending $I_{2}$, and $I_{3}$ the mask that forces tokens from $I_1$ to attend only specific tokens from $I_2$. The attention values requiring masking are filled with $-\\infty$ before the softmax. (In practice $\\tau{=}-10^9$),  $Q {=} W_QI_{1}$, $K {=} W_KI_{2}$ and $V {=} W_VI_{2}$ the queries, keys and values, and $d_{in}$ the internal attention dimension. $\\sigma(.)$ is the softmax operation.\r\n\r\nLet $X\\in\\mathbb{R}^{n\\times C}$ be the feature map with n the number of pixels, and C the number of channels. Let $Z\\in\\mathbb{R}^{m\\times d}$ be a set of $m$ latents of dimension $d$ and $s$ the number of semantic labels. Each semantic label is attributed $k$ latents, such that $m=k\\times s$. Each semantic label mask is assigned $k$ copies in $S{\\in}\\{0;1\\}^{n \\times m}$. \r\n\r\nWe can differentiate 3 types of SCA:\r\n\r\n(a) SCA with pixels $X$ attending latents $Z$: $\\text{SCA}(X, Z, S)$, where $W_{Q} {\\in} \\mathbb{R}^{n\\times d_{in}}$ and $W_{K}, W_{V} {\\in} \\mathbb{R}^{m\\times d_{in}}$.\r\nThe idea is to force the pixels from a semantic region to attend latents that are associated with the same label. \r\n\r\n(b) SCA with latents $Z$ attending pixels $X$: $\\text{SCA}(Z, X, S)$, where $W_{Q}{\\in} \\mathbb{R}^{m\\times d_{in}}$, $W_{K}, W_{V} {\\in} \\mathbb{R}^{n\\times d_{in}}$. \r\nThe idea is to semantically mask attention values to enforce latents to attend semantically corresponding pixels.\r\n\r\n(c) SCA with latents $Z$ attending themselves: $\\text{SCA}(Z, Z, M)$, where $W_{Q}, W_{K}, W_{V} {\\in} \\mathbb{R}^{n\\times d_{in}}$. We denote $M\\in\\mathbb{N}^{m\\times m}$ this mask, with $M_{\\text{latents}}(i,j) {=} 1$ if the semantic label of latent $i$ is the same as the one of latent $j$; $0$ otherwise.\r\nThe idea is to let the latents only attend latents that share the same semantic label.","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"https://arxiv.org/abs/2210.04883v1","title":"SCAM! Transferring humans between images with Semantic Cross Attention Modulation","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Attention Modules","url":"/methods/category/attention-modules","pwc_aliases":[]}],"n_papers_tagged":47,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"uav-based-remote-sensing-of-soil-moisture","title":"UAV-Based Remote Sensing of Soil Moisture Across Diverse Land Covers: Validation and Bayesian Uncertainty Characterization","date":"2025-06-05","arxiv_id":"2506.05572","n_code_links":0,"syntology":null},{"paper":null,"slug":"pinching-antenna-systems-pass-enabled-secure","title":"Pinching-Antenna Systems (PASS)-enabled Secure Wireless Communications","date":"2025-04-18","arxiv_id":"2504.13670","n_code_links":0,"syntology":null},{"paper":null,"slug":"probabilistic-stability-guarantees-for","title":"Probabilistic Stability Guarantees for Feature Attributions","date":"2025-04-18","arxiv_id":"2504.13787","n_code_links":0,"syntology":null},{"paper":null,"slug":"label-anything-an-interpretable-high-fidelity","title":"Label Anything: An Interpretable, High-Fidelity and Prompt-Free Annotator","date":"2025-02-05","arxiv_id":"2502.02972","n_code_links":0,"syntology":null},{"paper":null,"slug":"it-s-not-just-a-phase-on-investigating-phase","title":"It's Not Just a Phase: On Investigating Phase Transitions in Deep Learning-based Side-channel Analysis","date":"2025-02-01","arxiv_id":"2502.00384","n_code_links":0,"syntology":null},{"paper":null,"slug":"movable-antenna-assisted-integrated-sensing","title":"Movable Antenna-Assisted Integrated Sensing and Communication Systems","date":"2025-01-02","arxiv_id":"2501.01217","n_code_links":0,"syntology":null},{"paper":null,"slug":"make-shuffling-great-again-a-side-channel","title":"Make Shuffling Great Again: A Side-Channel Resistant Fisher-Yates Algorithm for Protecting Neural Networks","date":"2025-01-01","arxiv_id":"2501.00798","n_code_links":0,"syntology":null},{"paper":null,"slug":"high-throughput-detection-of-risk-factors-to","title":"High-Throughput Detection of Risk Factors to Sudden Cardiac Arrest in Youth Athletes: A Smartwatch-Based Screening Platform","date":"2024-12-02","arxiv_id":"2412.12118","n_code_links":0,"syntology":null},{"paper":null,"slug":"long-video-diffusion-generation-with","title":"Long Video Diffusion Generation with Segmented Cross-Attention and Content-Rich Video Data Curation","date":"2024-12-02","arxiv_id":"2412.01316","n_code_links":0,"syntology":null},{"paper":"/paper/fonts-text-rendering-with-typography-and","slug":"fonts-text-rendering-with-typography-and","title":"FonTS: Text Rendering with Typography and Style Controls","date":"2024-11-28","arxiv_id":"2412.00136","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-task-gaze-estimation-via-unidirectional","title":"Multi-task Gaze Estimation Via Unidirectional Convolution","date":"2024-11-27","arxiv_id":"2411.18061","n_code_links":0,"syntology":null},{"paper":null,"slug":"power-source-allocation-for-ris-aided","title":"Power Source Allocation for RIS-aided Integrating Sensing, Communication, and Power Transfer Systems Based on NOMA","date":"2024-11-01","arxiv_id":"2411.00334","n_code_links":0,"syntology":null},{"paper":"/paper/semantic-component-analysis-discovering","slug":"semantic-component-analysis-discovering","title":"Semantic Component Analysis: Discovering Patterns in Short Texts Beyond Topics","date":"2024-10-28","arxiv_id":"2410.21054","n_code_links":1,"syntology":null},{"paper":null,"slug":"mutual-coupling-aware-channel-estimation-and","title":"Mutual Coupling-Aware Channel Estimation and Beamforming for RIS-Assisted Communications","date":"2024-10-05","arxiv_id":"2410.04110","n_code_links":0,"syntology":null},{"paper":"/paper/sca-highly-efficient-semantic-consistent","slug":"sca-highly-efficient-semantic-consistent","title":"SCA: Improve Semantic Consistent in Unrestricted Adversarial Attacks via DDPM Inversion","date":"2024-10-03","arxiv_id":"2410.02240","n_code_links":1,"syntology":null},{"paper":null,"slug":"optimizing-multi-user-uplink-cooperative-rate","title":"Optimizing Multi-User Uplink Cooperative Rate-Splitting Multiple Access: Efficient User Pairing and Resource Allocation","date":"2024-09-03","arxiv_id":"2409.02276","n_code_links":0,"syntology":null},{"paper":null,"slug":"fas-vs-aris-which-is-more-important-for-fas","title":"FAS vs. ARIS: Which Is More Important for FAS-ARIS Communication Systems?","date":"2024-08-17","arxiv_id":"2408.09067","n_code_links":0,"syntology":null},{"paper":null,"slug":"fluid-antenna-enhanced-isac-joint-antenna","title":"Fluid-Antenna Enhanced ISAC: Joint Antenna Positioning and Dual-Functional Beamforming Design under Perfect and Imperfect CSI","date":"2024-07-25","arxiv_id":"2407.18988","n_code_links":0,"syntology":null},{"paper":null,"slug":"side-channel-analysis-of-openvino-based","title":"Side-Channel Analysis of OpenVINO-based Neural Network Models","date":"2024-07-23","arxiv_id":"2407.16467","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-functional-beamforming-design-for","title":"Multi-Functional Beamforming Design for Integrated Sensing, Communication, and Computation","date":"2024-07-01","arxiv_id":"2407.01006","n_code_links":0,"syntology":null},{"paper":null,"slug":"brain-tumor-classification-using-vision","title":"Brain Tumor Classification using Vision Transformer with Selective Cross-Attention Mechanism and Feature Calibration","date":"2024-06-25","arxiv_id":"2406.17670","n_code_links":0,"syntology":null},{"paper":"/paper/depth-linear-discrimination-oriented-feature","slug":"depth-linear-discrimination-oriented-feature","title":"Depth linear discrimination-oriented feature selection method based on adaptive sine cosine algorithm for software defect prediction","date":"2024-05-20","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"impedance-vs-power-side-channel","title":"Impedance vs. Power Side-channel Vulnerabilities: A Comparative Study","date":"2024-05-10","arxiv_id":"2405.06242","n_code_links":0,"syntology":null},{"paper":null,"slug":"special-characters-attack-toward-scalable","title":"Special Characters Attack: Toward Scalable Training Data Extraction From Large Language Models","date":"2024-05-09","arxiv_id":"2405.05990","n_code_links":0,"syntology":null},{"paper":null,"slug":"casper-causality-aware-spatiotemporal-graph","title":"Causality-Aware Spatiotemporal Graph Neural Networks for Spatiotemporal Time Series Imputation","date":"2024-03-18","arxiv_id":"2403.11960","n_code_links":0,"syntology":null},{"paper":null,"slug":"snow-sca-ml-assisted-side-channel-attack-on","title":"SNOW-SCA: ML-assisted Side-Channel Attack on SNOW-V","date":"2024-03-13","arxiv_id":"2403.08267","n_code_links":0,"syntology":null},{"paper":null,"slug":"precise-extraction-of-deep-learning-models","title":"Precise Extraction of Deep Learning Models via Side-Channel Attacks on Edge/Endpoint Devices","date":"2024-03-05","arxiv_id":"2403.02870","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-review-and-comparison-of-ai-enhanced-side","title":"A Review and Comparison of AI Enhanced Side Channel Analysis","date":"2024-02-03","arxiv_id":"2402.02299","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-sum-secrecy-rate-maximisation-for","title":"On the Sum Secrecy Rate Maximisation for Wireless Vehicular Networks","date":"2024-01-31","arxiv_id":"2401.17522","n_code_links":0,"syntology":null},{"paper":"/paper/energy-efficient-power-allocation-in-cell","slug":"energy-efficient-power-allocation-in-cell","title":"Energy-Efficient Power Allocation in Cell-Free Massive MIMO via Graph Neural Networks","date":"2024-01-25","arxiv_id":"2401.14281","n_code_links":1,"syntology":null},{"paper":null,"slug":"linguistic-based-mild-cognitive-impairment","title":"Linguistic-Based Mild Cognitive Impairment Detection Using Informative Loss","date":"2024-01-23","arxiv_id":"2402.01690","n_code_links":0,"syntology":null},{"paper":"/paper/low-rank-gradient-compression-with-error","slug":"low-rank-gradient-compression-with-error","title":"Efficient Wireless Federated Learning via Low-Rank Gradient Factorization","date":"2024-01-15","arxiv_id":"2401.07496","n_code_links":1,"syntology":null},{"paper":null,"slug":"joint-user-association-interference","title":"Joint User Association, Interference Cancellation and Power Control for Multi-IRS Assisted UAV Communications","date":"2023-12-08","arxiv_id":"2312.04786","n_code_links":0,"syntology":null},{"paper":"/paper/enhancing-object-coherence-in-layout-to-image","slug":"enhancing-object-coherence-in-layout-to-image","title":"Enhancing Object Coherence in Layout-to-Image Synthesis","date":"2023-11-17","arxiv_id":"2311.10522","n_code_links":1,"syntology":null},{"paper":null,"slug":"investigating-efficient-deep-learning","title":"Investigating Efficient Deep Learning Architectures For Side-Channel Attacks on AES","date":"2023-09-22","arxiv_id":"2309.13170","n_code_links":0,"syntology":null},{"paper":"/paper/gaussian-processes-with-linear-multiple","slug":"gaussian-processes-with-linear-multiple","title":"Sparsity-Aware Distributed Learning for Gaussian Processes with Linear Multiple Kernel","date":"2023-09-15","arxiv_id":"2309.08201","n_code_links":1,"syntology":null},{"paper":null,"slug":"fixed-inter-neuron-covariability-induces","title":"Fixed Inter-Neuron Covariability Induces Adversarial Robustness","date":"2023-08-07","arxiv_id":"2308.03956","n_code_links":0,"syntology":null},{"paper":"/paper/multi-granularity-detector-for-vulnerability","slug":"multi-granularity-detector-for-vulnerability","title":"Multi-Granularity Detector for Vulnerability Fixes","date":"2023-05-23","arxiv_id":"2305.13884","n_code_links":2,"syntology":null},{"paper":null,"slug":"fast-structext-an-efficient-hourglass","title":"Fast-StrucTexT: An Efficient Hourglass Transformer with Modality-guided Dynamic Token Merge for Document Understanding","date":"2023-05-19","arxiv_id":"2305.11392","n_code_links":0,"syntology":null},{"paper":"/paper/bitstream-corrupted-jpeg-images-are","slug":"bitstream-corrupted-jpeg-images-are","title":"Bitstream-Corrupted JPEG Images are Restorable: Two-stage Compensation and Alignment Framework for Image Restoration","date":"2023-04-14","arxiv_id":"2304.06976","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["wenyang001/two-acir"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/side-channel-analysis-against-anssis","slug":"side-channel-analysis-against-anssis","title":"Side-channel analysis against ANSSI’s protected AES implementation on ARM: end-to-end attacks with multi-task learning","date":"2023-03-10","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"wireless-powered-short-packet-communications","title":"Wireless Powered Short Packet Communications with Multiple WPT Sources","date":"2023-02-24","arxiv_id":"2302.12396","n_code_links":0,"syntology":null},{"paper":null,"slug":"nascty-neuroevolution-to-attack-side-channel","title":"NASCTY: Neuroevolution to Attack Side-channel Leakages Yielding Convolutional Neural Networks","date":"2023-01-25","arxiv_id":"2301.10802","n_code_links":0,"syntology":null},{"paper":null,"slug":"energy-efficiency-optimization-of-intelligent","title":"Energy Efficiency Optimization of Intelligent Reflective Surface-assisted Terahertz-RSMA System","date":"2022-11-21","arxiv_id":"2211.11271","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-framework-for-mutual-information-based-mimo","title":"A Framework for Mutual Information-based MIMO Integrated Sensing and Communication Beamforming Design","date":"2022-11-15","arxiv_id":"2211.07887","n_code_links":0,"syntology":null},{"paper":null,"slug":"compressive-spectrum-sensing-using-sampling","title":"Compressive Spectrum Sensing Using Sampling-Controlled Block Orthogonal Matching Pursuit","date":"2022-11-14","arxiv_id":"2211.07095","n_code_links":0,"syntology":null},{"paper":"/paper/scam-transferring-humans-between-images-with","slug":"scam-transferring-humans-between-images-with","title":"SCAM! Transferring humans between images with Semantic Cross Attention Modulation","date":"2022-10-10","arxiv_id":"2210.04883","n_code_links":1,"syntology":null}],"papers_shown":47,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":47,"with_a_code_link":12,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":47,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"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":1,"papers_where_code_ran_first_page":"/method/sca/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/sca/papers/ran/1","json":"/method/sca/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/side-channel-analysis","name":"Side Channel Analysis","papers":7},{"task":"/task/integrated-sensing-and-communication","name":"Integrated sensing and communication","papers":4},{"task":"/task/deep-learning","name":"Deep Learning","papers":3},{"task":"/task/diversity","name":"Diversity","papers":3},{"task":"/task/isac","name":"ISAC","papers":3},{"task":"/task/image-generation","name":"Image Generation","papers":2},{"task":null,"name":"Position","papers":2},{"task":"/task/adversarial-attack","name":"Adversarial Attack","papers":1},{"task":"/task/adversarial-robustness","name":"Adversarial Robustness","papers":1},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/bayesian-inference","name":"Bayesian Inference","papers":1},{"task":"/task/brain-tumor-classification","name":"Brain Tumor Classification","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/conditional-image-generation","name":"Conditional Image Generation","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/federated-learning","name":"Federated Learning","papers":1},{"task":"/task/gaussian-processes","name":"Gaussian Processes","papers":1},{"task":"/task/gaze-estimation","name":"Gaze Estimation","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1}],"tasks_shown":20,"n_tasks":47,"usage_by_year":[{"year":"2022","papers":4},{"year":"2023","papers":11},{"year":"2024","papers":25},{"year":"2025","papers":7}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/sca"},"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=SCA","read_at":"2026-10-05T01:01:37+00:00","query":"SCA","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"SCA","origin_arxiv_id":"2605.26971"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"listed_only"},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":false,"bearers_found":8,"served":{"arxiv_id":"2605.26971","citations":null},"leading_other_bearer":{"arxiv_id":"2305.11392","title":"Fast-StrucTexT: An Efficient Hourglass Transformer with Modality-guided Dynamic Token Merge for Document Understanding","citations":9,"named_by":["acronym_expansion"],"bearer_name":"Symmetry Cross-Attention (SCA)","ask_with":"have('2305.11392')"},"n_other_bearers_listed":5,"note":"'SCA' is ALSO the name of 'Symmetry Cross-Attention (SCA)', a method in 'Fast-StrucTexT: An Efficient Hourglass Transformer with Modality-guided Dynamic Token Merge for Document Understanding' (arXiv:2305.11392, 9 citations), which is cited more than the paper this answer is about (citations not recorded). The margin is narrow, so this is not a claim that the other one is what you meant -- check `served.arxiv_id` against the paper you had in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2605.26971","page":"/paper/arxiv-2605-26971","syntology_url":"https://syntology.ai/paper/2605.26971","in_graph_layer":true,"samples":7,"ran":6,"n_ran_checked":0,"n_instrument":6,"unverified":1,"phrase":"6 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; 6 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: listed only). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2605.26971) is about this method is not checked.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"aa66ac9d0b29da133376c6016dd5c0aeb7d202c865f5041b71127229e0cdfc71","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}