{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JCCRHYMMAG4N6OHO4IFYTMLVTE","short_pith_number":"pith:JCCRHYMM","canonical_record":{"source":{"id":"2605.14624","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T09:39:15Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"6bf6d7e5356b46f7fab78fc28f445600a8f5aeb37bbae8120bb9f4f0a8fdd5e8","abstract_canon_sha256":"4d8dc6e7a6cb65a322eb2a85b7cc2277edd55a095ecc8ccc43db2ac767d6ed05"},"schema_version":"1.0"},"canonical_sha256":"488513e18c01b8df38eee20b89b175991793db6e15c2bd3efcbe76bf8cb255af","source":{"kind":"arxiv","id":"2605.14624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14624","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14624v1","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14624","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"JCCRHYMMAG4N","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JCCRHYMMAG4N6OHO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JCCRHYMM","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JCCRHYMMAG4N6OHO4IFYTMLVTE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14624","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T09:39:15Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"6bf6d7e5356b46f7fab78fc28f445600a8f5aeb37bbae8120bb9f4f0a8fdd5e8","abstract_canon_sha256":"4d8dc6e7a6cb65a322eb2a85b7cc2277edd55a095ecc8ccc43db2ac767d6ed05"},"schema_version":"1.0"},"canonical_sha256":"488513e18c01b8df38eee20b89b175991793db6e15c2bd3efcbe76bf8cb255af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:04.035016Z","signature_b64":"TEeIzau7O1Jtp7qkf08lATbTMaYRY6jXw6kdEEHR8nshjp3sgFAXzUXPTA7NwGuC4toWfbXIdQLLmabg/U4yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"488513e18c01b8df38eee20b89b175991793db6e15c2bd3efcbe76bf8cb255af","last_reissued_at":"2026-05-17T23:39:04.034391Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:04.034391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14624","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROO7rAH2HQLRJBRxCtqmjHceQSfXl8OqOvQkzM69pdnKCAEucS53xcAjGasJAzUpwd0uR65zztBOSNaehVo8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:37:12.899573Z"},"content_sha256":"69cfcdf8d0549672418d46e28034abfbfe49d3ead6ee9305a8610382670ada34","schema_version":"1.0","event_id":"sha256:69cfcdf8d0549672418d46e28034abfbfe49d3ead6ee9305a8610382670ada34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JCCRHYMMAG4N6OHO4IFYTMLVTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Amortized Efficiency Threshold for Comparing Neural and Heuristic Solvers in Combinatorial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Neural solvers become net energy-efficient after a fixed number of deployments once training cost is amortized against lower per-instance use.","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Sohaib Afifi","submitted_at":"2026-05-14T09:39:15Z","abstract_excerpt":"A common critique of neural combinatorial-optimization solvers is that they are less energy-efficient than CPU metaheuristics, given the operational energy cost of training them on GPUs. This paper examines the inferential step from \"training is expensive\" to \"neural solvers are net-inefficient\", which is where the critique actually goes wrong. Training the network costs a large fixed amount of GPU energy; running the metaheuristic costs a small amount of CPU energy on every instance, repeated as long as the solver is deployed. The two are not commensurable until a deployment volume is fixed. "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We define the Amortized Efficiency Threshold (AET) as the deployment volume above which a neural solver breaks even with a heuristic baseline in total energy or carbon, under an explicit constraint on solution quality. We show that the cumulative-energy ratio between the two solvers tends to a constant strictly below one whenever the network wins per-instance.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The per-instance energy consumption of the neural solver is lower than the heuristic and remains constant across deployments, allowing the cumulative ratio to converge to a value below one independent of training cost measurement.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper introduces the Amortized Efficiency Threshold (AET) to identify the deployment volume at which neural combinatorial optimization solvers become more energy-efficient overall than heuristic baselines after amortizing training costs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Neural solvers become net energy-efficient after a fixed number of deployments once training cost is amortized against lower per-instance use.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"bbb371b799f51a08f68f586748ea7b4176874ccf179edddce6b4f5e0ee05d288"},"source":{"id":"2605.14624","kind":"arxiv","version":1},"verdict":{"id":"4ae45ebc-2368-4559-876f-16a64c4de455","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T04:44:29.917885Z","strongest_claim":"We define the Amortized Efficiency Threshold (AET) as the deployment volume above which a neural solver breaks even with a heuristic baseline in total energy or carbon, under an explicit constraint on solution quality. We show that the cumulative-energy ratio between the two solvers tends to a constant strictly below one whenever the network wins per-instance.","one_line_summary":"The paper introduces the Amortized Efficiency Threshold (AET) to identify the deployment volume at which neural combinatorial optimization solvers become more energy-efficient overall than heuristic baselines after amortizing training costs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The per-instance energy consumption of the neural solver is lower than the heuristic and remains constant across deployments, allowing the cumulative ratio to converge to a value below one independent of training cost measurement.","pith_extraction_headline":"Neural solvers become net energy-efficient after a fixed number of deployments once training cost is amortized against lower per-instance use."},"references":{"count":26,"sample":[{"doi":"","year":2023,"title":"Product environmental reports.https://www.apple.com/environment/, 2023","work_id":"5f9f781b-5368-4751-bc49-0585ce805838","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Le, Mohammad Norouzi, and Samy Bengio","work_id":"1b791fa7-1cef-43c0-956c-d5e913bc8422","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"RL4CO: An extensive reinforcement learning for combinatorial optimization benchmark","work_id":"84e58379-ff41-4527-8df1-59b211f2038d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Lee, Gu-Yeon Wei, David Brooks, and Carole-Jean Wu","work_id":"6e9b3f1d-73e2-4d27-9b3f-bf147ec06aa8","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems.Roskilde University Technical Report, 2017","work_id":"0899700f-2edc-4739-ad10-c96825279761","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":26,"snapshot_sha256":"b3ab6478e0fe7ba6eba4bbb6db7e5d63aa11d0bc4195a99ac88de517e6439704","internal_anchors":2},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"4ae45ebc-2368-4559-876f-16a64c4de455"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmLI8t6r9308wYnA0htXXzlU5WXk5fKCweb+vt5AKlSQdS2gkMg+I/LAdSCh/fcjBk0UXWAaStx6tiAPyFDaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:37:12.900105Z"},"content_sha256":"f0fd23b013317437c75739a543e85628bf2da7a4b5bc0de4f25d80c65c62cbb4","schema_version":"1.0","event_id":"sha256:f0fd23b013317437c75739a543e85628bf2da7a4b5bc0de4f25d80c65c62cbb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCCRHYMMAG4N6OHO4IFYTMLVTE/bundle.json","state_url":"https://pith.science/pith/JCCRHYMMAG4N6OHO4IFYTMLVTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCCRHYMMAG4N6OHO4IFYTMLVTE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T05:37:12Z","links":{"resolver":"https://pith.science/pith/JCCRHYMMAG4N6OHO4IFYTMLVTE","bundle":"https://pith.science/pith/JCCRHYMMAG4N6OHO4IFYTMLVTE/bundle.json","state":"https://pith.science/pith/JCCRHYMMAG4N6OHO4IFYTMLVTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCCRHYMMAG4N6OHO4IFYTMLVTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JCCRHYMMAG4N6OHO4IFYTMLVTE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4d8dc6e7a6cb65a322eb2a85b7cc2277edd55a095ecc8ccc43db2ac767d6ed05","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T09:39:15Z","title_canon_sha256":"6bf6d7e5356b46f7fab78fc28f445600a8f5aeb37bbae8120bb9f4f0a8fdd5e8"},"schema_version":"1.0","source":{"id":"2605.14624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14624","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14624v1","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14624","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"JCCRHYMMAG4N","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JCCRHYMMAG4N6OHO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JCCRHYMM","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f0fd23b013317437c75739a543e85628bf2da7a4b5bc0de4f25d80c65c62cbb4","target":"graph","created_at":"2026-05-17T23:39:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We define the Amortized Efficiency Threshold (AET) as the deployment volume above which a neural solver breaks even with a heuristic baseline in total energy or carbon, under an explicit constraint on solution quality. We show that the cumulative-energy ratio between the two solvers tends to a constant strictly below one whenever the network wins per-instance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The per-instance energy consumption of the neural solver is lower than the heuristic and remains constant across deployments, allowing the cumulative ratio to converge to a value below one independent of training cost measurement."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper introduces the Amortized Efficiency Threshold (AET) to identify the deployment volume at which neural combinatorial optimization solvers become more energy-efficient overall than heuristic baselines after amortizing training costs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Neural solvers become net energy-efficient after a fixed number of deployments once training cost is amortized against lower per-instance use."}],"snapshot_sha256":"bbb371b799f51a08f68f586748ea7b4176874ccf179edddce6b4f5e0ee05d288"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A common critique of neural combinatorial-optimization solvers is that they are less energy-efficient than CPU metaheuristics, given the operational energy cost of training them on GPUs. This paper examines the inferential step from \"training is expensive\" to \"neural solvers are net-inefficient\", which is where the critique actually goes wrong. Training the network costs a large fixed amount of GPU energy; running the metaheuristic costs a small amount of CPU energy on every instance, repeated as long as the solver is deployed. The two are not commensurable until a deployment volume is fixed. ","authors_text":"Sohaib Afifi","cross_cats":["cs.AI","cs.NE"],"headline":"Neural solvers become net energy-efficient after a fixed number of deployments once training cost is amortized against lower per-instance use.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T09:39:15Z","title":"An Amortized Efficiency Threshold for Comparing Neural and Heuristic Solvers in Combinatorial Optimization"},"references":{"count":26,"internal_anchors":2,"resolved_work":26,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Product environmental reports.https://www.apple.com/environment/, 2023","work_id":"5f9f781b-5368-4751-bc49-0585ce805838","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Le, Mohammad Norouzi, and Samy Bengio","work_id":"1b791fa7-1cef-43c0-956c-d5e913bc8422","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"RL4CO: An extensive reinforcement learning for combinatorial optimization benchmark","work_id":"84e58379-ff41-4527-8df1-59b211f2038d","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Lee, Gu-Yeon Wei, David Brooks, and Carole-Jean Wu","work_id":"6e9b3f1d-73e2-4d27-9b3f-bf147ec06aa8","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems.Roskilde University Technical Report, 2017","work_id":"0899700f-2edc-4739-ad10-c96825279761","year":2017}],"snapshot_sha256":"b3ab6478e0fe7ba6eba4bbb6db7e5d63aa11d0bc4195a99ac88de517e6439704"},"source":{"id":"2605.14624","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T04:44:29.917885Z","id":"4ae45ebc-2368-4559-876f-16a64c4de455","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper introduces the Amortized Efficiency Threshold (AET) to identify the deployment volume at which neural combinatorial optimization solvers become more energy-efficient overall than heuristic baselines after amortizing training costs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Neural solvers become net energy-efficient after a fixed number of deployments once training cost is amortized against lower per-instance use.","strongest_claim":"We define the Amortized Efficiency Threshold (AET) as the deployment volume above which a neural solver breaks even with a heuristic baseline in total energy or carbon, under an explicit constraint on solution quality. We show that the cumulative-energy ratio between the two solvers tends to a constant strictly below one whenever the network wins per-instance.","weakest_assumption":"The per-instance energy consumption of the neural solver is lower than the heuristic and remains constant across deployments, allowing the cumulative ratio to converge to a value below one independent of training cost measurement."}},"verdict_id":"4ae45ebc-2368-4559-876f-16a64c4de455"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:69cfcdf8d0549672418d46e28034abfbfe49d3ead6ee9305a8610382670ada34","target":"record","created_at":"2026-05-17T23:39:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4d8dc6e7a6cb65a322eb2a85b7cc2277edd55a095ecc8ccc43db2ac767d6ed05","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T09:39:15Z","title_canon_sha256":"6bf6d7e5356b46f7fab78fc28f445600a8f5aeb37bbae8120bb9f4f0a8fdd5e8"},"schema_version":"1.0","source":{"id":"2605.14624","kind":"arxiv","version":1}},"canonical_sha256":"488513e18c01b8df38eee20b89b175991793db6e15c2bd3efcbe76bf8cb255af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"488513e18c01b8df38eee20b89b175991793db6e15c2bd3efcbe76bf8cb255af","first_computed_at":"2026-05-17T23:39:04.034391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:04.034391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TEeIzau7O1Jtp7qkf08lATbTMaYRY6jXw6kdEEHR8nshjp3sgFAXzUXPTA7NwGuC4toWfbXIdQLLmabg/U4yAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:04.035016Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69cfcdf8d0549672418d46e28034abfbfe49d3ead6ee9305a8610382670ada34","sha256:f0fd23b013317437c75739a543e85628bf2da7a4b5bc0de4f25d80c65c62cbb4"],"state_sha256":"de535af9a97302b740d88a7b2b8e99f072b3c9e46290058fa6b089cfe67d2e39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/Z7jXoqGmz9DSRgDgsUVY3ywpZU3J6X9zaPLA3TIRus7/ThjpCg03bRtWW8iP381+HMNDN5oTQChf6h4yIXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:37:12.902847Z","bundle_sha256":"9ec1497756425df726c86915ca1abad67ad009e196663ad69829e1cf6d0d64f4"}}