acceptodds
Under review as a conference paper at ICLR 2027

Tell Robot What Not to Do: A Negation Understanding Perspective

Abstract

Instruction following enables robots to perform diverse tasks specified in natural language, making it a fundamental capability for human–robot interaction. Beyond communicating desired outcomes, users also need to specify constraints on what not to do. We investigate how to enable vision-language-action models (VLAs) to follow negated instructions, where robots must accomplish task goals while respecting explicit exclusions. To this end, we propose NegaAlign, a parameter-efficient, plug-and-play framework that extends pretrained VLAs to follow negated instructions through image–language supervision alone. Specifically, we introduce Negation Transformation Layers into selected layers of the vision–language backbone to reshape intermediate instruction representations. Meanwhile, teacher-guided alignment mechanism is designed to align the instruction-relevant visual tokens, transferring action-relevant grounding from instructions that satisfy the negated constraint. Training uses supervision constructed from existing demonstrations and updates only the inserted layers, keeping all pretrained parameters frozen, including the action generator. We further introduce NegaBench, a simulation benchmark spanning 10 scenarios across five domains for systematically evaluating manipulation under negated constraints. Experiments across GR00T, , and demonstrate consistent improvements in negated instruction following. With 11.6M trainable parameters, NegaAlign increases the negated-instruction success rate of from 2.60% to 88.45% on NegaBench and from 12.4% to 88.8% on real-world tasks, while retaining performance on affirmative instructions.

Primary area:
applications to robotics, autonomy, planning
Keywords:
instruction following of robotic manipulation

Reviews

Among:
Shape:
1234this paper, Top 30%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.67 over 3 reviews, above 70% of the others.
Reviewer_2WizOpenReview ↗
Rating
3
Confidence
2
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper explores whether VLA models can follow negated instructions, which previous VLAs often fail to do. To address this challenge, the paper proposes NegaAlign. NegaAlign is a parameter-efficient post-training approach for VLA backbones and requires no negated robot demonstrations. NegaAlign leverages existing affirmative demonstration data, combined with manually constructed relations that pair each negated instruction with satisfying and excluded affirmative instructions. NegaAlign incorporates gated Negation Transformation Layers into the VLM backbone, which are designed to adjust the representations of negative instructions to align with their intended affirmative counterparts. Teacher-Guided Visual Alignment extends this adjustment to the visual tokens associated with the instructions. The paper also introduces NegaBench, a simulation benchmark covering five types of negation across 10 distinct scenarios. NegaAlign shows consistent gains on negated instructions compared to pi0.5 on both simulated and real-world datasets.

Critical strengths
  • This paper identifies an important problem that existing VLAs often fail to follow negated instructions. To address this problem, it proposes a parameter-efficient post-training strategy NegaAlign which can be easily adapted to various VLA backbones.
  • Simulation and real-world experiments demonstrate that NegaAlign significantly improves negated-instruction following while maintaining affirmative performance. Ablation studies further support design choices.
Critical weaknesses
  • The generalization of the proposed method is unclear, as the negated instructions used for training appear to be the same as those used for evaluation. Therefore, it is difficult to tell whether NegaAlign learns general negation understanding or memorizes known prompts.
  • NegaAlign's performance nearly matches full finefuning on pi0.5. However, it lags clearly behind on GR00T and pi0, which suggests that its effectiveness may depend on the backbone. Evaluation on more backbones is necessary to verify its general applicability.
Questions for authors

Please refer to the weaknesses.

4 comments
AuthorsOpenReview ↗

Response to Reviewer 2Wiz (1/2)

Thank you for highlighting generalization and performance variation across VLA backbones.

W1 Generalization of purposed method

A: We further evaluate whether NegaAlign generalizes to OOD scenarios with changes in object instances, appearances, and scene configurations. Specifically, we directly use the checkpoint obtained after adaptation stage, without additional training on the OOD scenarios. The instruction text remains identical to that used during adaptation, while object positions, colors, sizes, and scene arrangements change, as Figure 6 illustrates in revised manuscript.

Table 3 Success rates (%) on OOD tasks with negation instructions. Bold marks the best SR in each column.

SettingObject Task1Object Task2Attribute Task1Attribute Task2Comparison Task1Comparison Task2Goal Task1Goal Task2Complex Task1Complex Task2Avg.
Qwen-π₀.₅-ft47.027.067.075.077.042.078.0100.093.069.067.5
π₀.₅ w/ Ours63.072.075.070.082.043.082.099.0100.092.077.8

As Table 3 shows, NegaAlign achieves an average success rate of 77.8% in negation instruction tasks, compared with 67.5% for Qwen–π₀.₅-ft, an improvement of 10.3 percentage points. Qwen–π₀.₅-ft is composed with a finetuned Qwen3-VL-2B-Instruct using our negation supervision constructed in Sec 3.2 and the frozen pretrained π₀.₅. NegaAlign achieves higher success rates on eight of the ten tasks, demonstrating stronger visual generalization across scenes, object categories, and appearances. Compared with the VLM-based instruction-rewriting baseline, which depends heavily on the VLM’s visual perception and reasoning capabilities, NegaAlign follows negation instructions more reliably across visual variations.

The question of unseen negation relations concerns an additional dimension of generalization. When the negation construction and the underlying manipulation skills are individually familiar, applying them in an unseen combination tests compositional generalization. However, the compositional generalization of physical intelligence is still an unsolved problem[1]. Therefore, our setting studies how an affirmative-trained VLA acquires negated instruction following through lightweight adaptation. NegaAlign connects the supplied negation relations to existing manipulation capabilities through image–language supervision. The low negated success rate of the unadapted backbones motivates this adaptation, and the additional OOD results establish transfer of the resulting behavior across visual conditions. Please check more details in our revision.

[1] Ai B, Amin A, et al. Intelligence, Physical, et al. "${\pi} _ {0.7} $: a Steerable Generalist Robotic Foundation Model with Emergent Capabilities." arXiv preprint arXiv:2604.15483 (2026).

AuthorsOpenReview ↗

Response to Reviewer 2Wiz (2/2)

W2: Applicability across VLA backbones

A: We extend the evaluation to DM0.5[1]. On DM0.5, negated success increases from 4.90% to 53.40%, a gain of 48.50 percentage points. Affirmative success remains close to the affirmative-only baseline, at 52.10% versus 53.81%, a difference of 1.71 percentage points.

ModelObject Pos.Object Neg.Attribute Pos.Attribute Neg.Comparison Pos.Comparison Neg.Goal Pos.Goal Neg.Complex Pos.Complex Neg.Avg. Pos.Avg. Neg.
DM0.5 Pos. FT69.9210.5028.757.0062.506.5026.500.0081.380.5053.814.90
DM0.5 Pos. & Neg. FT73.2564.2533.0039.0058.2554.0042.0046.0081.2583.5057.5557.35
DM0.5 w/Ours69.0068.0030.7540.0060.2545.0026.7532.0073.7582.0052.1053.40

The averages cover all five task categories. Fine-tuning with both affirmative and negated action trajectories achieves 57.35% negated success. NegaAlign reaches 53.40% without negated action targets, leaving a gap of 3.95 percentage points. This result complements the gains on GR00T, π₀, and π₀.₅, where NegaAlign increases negated success from 1.05% to 57.75%, from 15.40% to 63.30%, and from 2.60% to 88.45%, respectively. Across the four evaluated backbones, NegaAlign consistently improves negated instruction following. Its gap to trajectory-supervised fine-tuning varies across backbones: 11.10 percentage points on GR00T, 7.95 on π₀, 0.15 on π₀.₅, and 3.95 on DM0.5. These comparisons support applicability across multiple backbones and quantify how closely the adaptation approaches the trajectory-supervised reference on each model.

[1] DM0.5: Designed for the Open World, Where Generalization Emerges. Dexmal, Technical Report, 2026.

Thank you to the author for replying to my comments. It has resolved some of my questions. I maintain my original positive score.

Dear Reviewer 2Wiz,

Thank you for your valuable suggestions, which have helped us improve our work. We sincerely appreciate your time and thoughtful feedback.

Best regards,

The Authors

Reviewer_e6wrOpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper studies negated instruction following in pretrained vision-language-action models. It introduces NegaBench, covering ten manipulation scenarios across five negation categories, and NegaAlign that combines gated instruction-representation updates with teacher-guided visual feature alignment. Adaptation uses manually specified instruction relations and observations from affirmative demonstrations, without negated action targets. Experimental results on three VLAs and a physical robot show improvements while preserving affirmative-task performance.

Critical strengths
  1. The paper addresses a practically relevant failure mode, i.e., strong affirmative-task performance does not guarantee compliance with explicit exclusions. The paired evaluation across several VLAs and real-world tasks makes this limitation concrete.

  2. Reusing an affirmative-trained policy through lightweight adaptation is appealing. The improvements without negated action targets, together with preserved affirmative performance, demonstrate useful practical potentials.

Critical weaknesses
  1. The instruction-rewriting comparison does not account for differences in relational supervision. NegaAlign is trained with manually specified relations linking each negated instruction to satisfying and excluded affirmative instructions. In contrast, Qwen-pi0.5 uses an unmodified rewriting model without equivalent relational supervision. Given the paper’s target-specific adaptation setting, a direct alternative is to use the supplied relations to map negated instructions to admissible affirmative commands, then execute them with the same frozen policy. A lookup-based baseline would be informative for known instructions, while a supervised rewriting or skill-selection model could test generalization beyond exact matches. Without such comparisons, the reported advantage over Qwen-pi0.5 does not sufficiently establish the additional value of the proposed internal representation adaptation over simpler instruction mapping.

  2. The experiments do not sufficiently isolate the contribution of the specific design choices. Removing TGVA reduces negated success from 88.45% to 21.35%, demonstrating the value of visual alignment within this framework. However, this ablation removes visual alignment entirely. It does not establish the additional benefit of teacher-difference token selection and weighting over simpler feature-distillation objectives. Uniform alignment over the same top-camera tokens and matched random-token alignment, with controlled loss scale and training budget, would provide informative comparisons. Figure 5 supports visual mediation of language-conditioned actions, but does not establish the importance of the particular tokens selected by TGVA. Similarly, the NTL replacement experiment supports controlled, gated revision for preserving affirmative performance, but does not isolate the value of its detailed architecture over a simpler gated adapter trained with the same supervision. These missing controls limit the attribution of the substantial gains to the proposed algorithmic design.

Questions for authors
  1. Which evaluation instructions or relations are included in the adaptation, and are any expressions or relations held out? Under the same supplied relational supervision, how does NegaAlign compare with relation-informed instruction rewriting or skill selection followed by the same frozen policy? A lookup baseline for known instructions would also help quantify how much of the task can be solved by the supplied relations.

  2. Under the same supervision and adaptation budget, how does TGVA compare with uniform alignment over all top-camera visual tokens and matched random-token alignment, with loss scale controlled? Does a simpler gated adapter trained with the same objectives retain the gains?

3 comments
AuthorsOpenReview ↗

Response to Reviewer e6wr(1/2)

Thank you for highlighting the importance of relation-supervised baselines and targeted architectural controls.

W1&Q1 Instruction rewriting with the same supplied relational supervision

A: The instructions are same during adaptation and test phases. We evaluate a supervised rewriting baseline using Qwen3-VL-2B-Instruct. Specifically, the rewriter receives the top-camera observation and the instruction, generates an affirmative command, and passes this command to the same frozen, affirmative-trained π₀.₅ policy. We fine-tune the rewriter using the negation supervision constructed in Section 3.2, without introducing additional modules. Further implementation details, including the system prompt provided to Qwen3-VL-2B-Instruct, are included in Appendix A.1 of the revised manuscript.

Table 1 Comparison of our method with baselines on NegaBench.

ModelObject Pos.Object Neg.Attribute Pos.Attribute Neg.Comparison Pos.Comparison Neg.Goal Pos.Goal Neg.Complex Pos.Complex Neg.Avg. Pos.Avg. Neg.
Qwen-π₀.₅49.5052.0084.2594.0056.7525.5093.5060.5073.8846.5071.5855.70
Qwen-π₀.₅-ft30.2583.7546.5092.0085.0075.5069.0094.0026.5099.5051.4588.95

Table 3 Success rates (%) on OOD tasks with negation instructions. Bold marks the best SR in each column.

SettingObject Task1Object Task2Attribute Task1Attribute Task2Comparison Task1Comparison Task2Goal Task1Goal Task2Complex Task1Complex Task2Avg.
Qwen-π₀.₅-ft47.027.067.075.077.042.078.0100.093.069.067.5
π₀.₅ w/ Ours63.072.075.070.082.043.082.099.0100.092.077.8

Supervised fine-tuning increases the rewriting pipeline’s negated success from 55.70% to 88.95%, a gain of 33.25 percentage points. Its affirmative success decreases from 71.58% to 51.45%, a reduction of 20.13 percentage points. These results reveal the rewriting policy’s sensitivity to model adaptation, making consistent performance across instruction difficult to maintain.

NegaAlign achieves 88.45% negated success, compared with 88.95% for supervised rewriting, and 92.51% affirmative success, compared with 51.45%. Thus, the observed negated success rates differ by 0.50 percentage points, while NegaAlign provides 41.06 percentage points higher affirmative success. Its affirmative performance also remains close to the original policy’s 92.77%. This comparison identifies affirmative-task retention as the principal advantage of NegaAlign over the evaluated supervised rewriting pipeline. NegaAlign supports strong negated instruction following while retaining the original policy’s performance on affirmative instructions.

The additional OOD protocol directly uses the adapted checkpoint and retains the instruction text from adaptation. It varies object instances, positions, colors, sizes, and scene arrangements, as Figure 6 shows. This protocol measures visual generalization under known instruction relations. Under this OOD protocol, the lookup baseline can not handle the scenario that is not paired with the known instructions. Then we evaluate the Qwen–π₀.₅-ft and π₀.₅ with NegaAlign in this protocol. As shown in Table 3, π₀.₅ with NegaAlign achieves 77.8% average success, compared with 67.5% for Qwen–π₀.₅-ft, and improves success on eight of ten tasks. These results demonstrate that our purposed method has visual generalization in scenarios, object categories, and appearance. Please check more details in our revision.

AuthorsOpenReview ↗

Response to Reviewer e6wr(2/2)

W2&Q2 Contributions of visual alignment and language revision

A: To verify the contribution of different variants, we retain the original TGVA configuration and compare it with alignment over all top-camera visual tokens and a randomly selected 20% subset. We also separately examine gate removal and a lightweight variant that retains the gate while removing TransLayer, Modular, and Lsem\mathcal L_{\mathrm{sem}}. All variants use the same adaptation data and supplied instruction relations.

Table 2.1 Ablation study on the effect of TGVA and different configurations of NTL

SettingLayerVisual alignmentNTL variantPos. (%)Neg. (%)
Exp. 3MiddleNoneFull91.27 (-1.24)21.35 (-67.10)
Exp. 4MiddleAll tokensFull91.78 (-0.73)83.45 (-5.00)
Exp. 5MiddleRandom (20%)Full90.84 (-1.67)84.60 (-3.85)
OursMiddleTGVAFull92.5188.45

Table 2.2 Ablation study on the effect of TGVA and different configurations of NTL

SettingLayerVisual alignmentNTL variantPos. (%)Neg. (%)
Exp. 6MiddleTGVAUngated40.52 (-51.99)86.65 (-1.80)
Exp. 7MiddleTGVALightweight91.09 (-1.42)85.25 (-3.20)
OursMiddleTGVAFull92.5188.45

TGVA improves negated success by 5.00 percentage points over alignment on all top-camera tokens and by 3.85 percentage points over random 20% alignment. These comparisons support the contribution of TGVA relative to alternative strategies that also provide visual alignment.

Removing the gate reduces affirmative success by 51.99 percentage points, while negated success decreases by 1.80 percentage points. This result highlights the importance of controlling instruction revision to preserve affirmative behavior. The lightweight gated variant achieves 85.25% negated success, compared with 88.45% for the full design. Its affirmative success is 91.09%, compared with 92.51%. Because this variant removes TransLayer, Modular, and Lsem\mathcal L_{\mathrm{sem}}, the comparison measures their combined contribution.

Overall, these results support complementary roles for TGVA, gating, and semantic transformation with its associated objective in achieving negated instruction following while preserving affirmative performance. Please check more details in our revision.

Dear Reviewer e6wr,

We would like to follow up and ask whether our reponse, revised manuscript, and additional experiments have addressed your concerns. Your feedback is valuable in helping us improve this work. If any questions remain or you have further suggestions, please let us know and we would be happy to discuss them.

Thank you again for your time and effort!

Best regards,

The Authors

Reviewer_Ac63OpenReview ↗
Rating
3
Confidence
2
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

The paper studies how Vision-Language-Action models handle negated instructions, where a robot must complete a task while avoiding an explicitly excluded object or outcome. The authors show that VLAs trained on affirmative instructions perform poorly on such commands: on NegaBench, the negated-instruction success rates are only 1.05% for GR00T, 15.40% for π0, and 2.60% for π0.5. The authors propose NegaAlign, which keeps the pretrained VLA frozen and adds Negation Transformation Layers together with Teacher-Guided Visual Alignment. Instead of using negated robot trajectories, the method is trained using affirmative demonstrations and manually constructed relations between a negated instruction, a satisfying affirmative instruction, and an excluded instruction. For π0 and π0.5, only 11.6M parameters are trained.

The paper also introduces NegaBench, with 10 manipulation scenarios across five types of negation. NegaAlign improves negated success to 57.75% on GR00T, 63.30% on π0, and 88.45% on π0.5. For π0.5, this is close to the 88.60% obtained by training with explicit negated trajectories. The method is also tested on five real-world xArm6 tasks, where π0.5 improves from 12.4% to 88.8% negated success while affirmative success changes only from 91.6% to 90.8%.

Critical strengths
  1. The paper shows a clear practical problem: on NegaBench, affirmative-trained GR00T, π0, and π0.5 achieve only 1.05%, 15.40%, and 2.60% success on negated instructions.

  2. NegaAlign gives large improvements across all three backbones. On π0.5, it reaches 88.45% negated success with only 11.6M trainable parameters, compared with 88.60% from training 467M parameters with explicit negated trajectories. The real-robot result is also strong: 12.4% → 88.8% negated success across 250 trials.

Critical weaknesses
  1. Generalization to new negated instructions is not clearly tested. The simulation post-training uses 13 manually constructed negation relations, and the real-world post-training uses five relations. The same five real-world negated instructions are then evaluated, so it is unclear how well the method would work on constraints not seen during post-training.

  2. The paper does not include a simple generic lightweight adapter trained with the same negated/satisfying/excluded supervision. Therefore, it is difficult to separate the benefit of the specific NegaAlign design from the benefit of this strong supervision itself.

Questions for authors
  1. How does NegaAlign perform on negated instructions or constraint relations that were not included during post-training? Have you evaluated new wording of the same constraint or completely new negation relations?

  2. Have you compared NegaAlign with a simpler lightweight adapter trained using exactly the same negated, satisfying, and excluded instruction relations?

Overall, the results are strong and the method looks promising. My main concern is the lack of evaluation on unseen negation relations, but I do not think this is enough to outweigh the overall contribution.

4 comments
AuthorsOpenReview ↗

Response to Reviewer Ac63 (1/2)

Thank you for the constructive questions about generalization and the contributions of the proposed components.

W1&Q1 Generalization of purposed method

A: We further evaluate whether NegaAlign generalizes to OOD scenarios with changes in object instances, appearances, and scene configurations. Specifically, we directly use the checkpoint obtained after adaptation stage, without additional training on the OOD scenarios. The instruction text remains identical to that used during adaptation, while object positions, colors, sizes, and scene arrangements change, as Figure 6 illustrates in revised manuscript.

Table 3 Success rates (%) on OOD tasks with negation instructions. Bold marks the best SR in each column.
SettingObject Task1Object Task2Attribute Task1Attribute Task2Comparison Task1Comparison Task2Goal Task1Goal Task2Complex Task1Complex Task2Avg.
Qwen-π₀.₅-ft47.027.067.075.077.042.078.0100.093.069.067.5
π₀.₅ w/ Ours63.072.075.070.082.043.082.099.0100.092.077.8

As Table 3 shows, NegaAlign achieves an average success rate of 77.8% in negation instruction tasks, compared with 67.5% for Qwen–π₀.₅-ft, an improvement of 10.3 percentage points. Qwen–π₀.₅-ft is composed with a finetuned Qwen3-VL-2B-Instruct using our negation supervision constructed in Sec 3.2 and the frozen pretrained π₀.₅. NegaAlign achieves higher success rates on eight of the ten tasks, demonstrating stronger visual generalization across scenes, object categories, and appearances. Compared with the VLM-based instruction-rewriting baseline, which depends heavily on the VLM’s visual perception and reasoning capabilities, NegaAlign follows negation instructions more reliably across visual variations.

The question of unseen negation relations concerns an additional dimension of generalization. When the negation construction and the underlying manipulation skills are individually familiar, applying them in an unseen combination tests compositional generalization. However, the compositional generalization of physical intelligence is still an unsolved problem[1]. Therefore, our setting studies how an affirmative-trained VLA acquires negated instruction following through lightweight adaptation. NegaAlign connects the supplied negation relations to existing manipulation capabilities through image–language supervision. The low negated success rate of the unadapted backbones motivates this adaptation, and the additional OOD results establish transfer of the resulting behavior across visual conditions. Please check more details in our revision.

[1] Ai B, Amin A, et al. Intelligence, Physical, et al. "${\pi} _ {0.7} $: a Steerable Generalist Robotic Foundation Model with Emergent Capabilities." arXiv preprint arXiv:2604.15483 (2026).

AuthorsOpenReview ↗

Response to Reviewer Ac63 (2/2)

W2&Q2 Contributions of TGVA and NTL under the same relational supervision A:We compare alternative visual-alignment strategies and NTL variants using the same adaptation data and supplied instruction relations.

Table 2.1 Ablation study on the effect of TGVA and different configurations of NTL

SettingLayerVisual alignmentNTL variantPos. (%)Neg. (%)
Exp. 3MiddleNoneFull91.27 (-1.24)21.35 (-67.10)
Exp. 4MiddleAll tokensFull91.78 (-0.73)83.45 (-5.00)
Exp. 5MiddleRandom (20%)Full90.84 (-1.67)84.60 (-3.85)
OursMiddleTGVAFull92.5188.45

Table 2.2 Ablation study on the effect of TGVA and different configurations of NTL

SettingLayerVisual alignmentNTL variantPos. (%)Neg. (%)
Exp. 6MiddleTGVAUngated40.52 (-51.99)86.65 (-1.80)
Exp. 7MiddleTGVALightweight91.09 (-1.42)85.25 (-3.20)
OursMiddleTGVAFull92.5188.45

For visual token selection, we retain the original TGVA configuration and compare it with alignment over all top-camera visual tokens and alignment over a randomly selected 20% of these tokens in Exp 3, 4, and 5. Table 2 shows that TGVA achieves 88.45%(Ours) success rate on negated instructions, compared with 83.45%(Exp.4) and 84.60%(Exp.5), respectively. When the TGVA is removed, the performance of negated instruction tasks sharply decreases to 21.35%(Exp.3). The results support the contribution of the visual token selection strategy of TGVA beyond the inclusion of visual alignment alone.

For NTL variants, removing the Gate in NTL(Exp.6) reduces affirmative success rate from 92.51% to 40.52%, while negated success changes from 88.45% to 86.65%. This comparison highlights the role of gate in NTL in preserving affirmative instruction following. We also evaluate a lightweight gated adapter variant that removes Trans. Layer, its semantic objective Lsem\mathcal L_{\mathrm{sem}}, and the Modular, while retaining the Gate. This variant (Exp.7) achieves 91.09% affirmative success and 85.25% negated success, compared with 92.51% and 88.45% for the full design. This joint ablation results support the combined contribution of the design that except the Gate.

Overall, these comparisons provide evidence for the contributions of TGVA, gate in NTL, and the complete semantic-transformation design using the supplied relation supervisions. Please check more details in our revision.

Dear Reviewer Ac63,

We would like to follow up and ask whether our reponse, revised manuscript, and additional experiments have addressed your concerns. Your feedback is valuable in helping us improve this work. If any questions remain or you have further suggestions, please let us know and we would be happy to discuss them.

Thank you again for your time and effort!

Best regards,

Authors

These results address the points I raised. I am leaving the initial positive score. The revision matches the evidence on which this score was based.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.