{"paper":{"title":"From tree- to loop-simplicity in affine Toda theories II: higher-order poles and cut decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-th","authors_text":"Davide Polvara, Patrick Dorey","submitted_at":"2023-07-28T11:50:46Z","abstract_excerpt":"Recently we showed how, in two-dimensional scalar theories, one-loop threshold diagrams can be cut into the product of one or more tree-level diagrams arXiv:2206.09368. Using this method on the ADE series of Toda models, we computed the double- and single-pole coefficients of the Laurent expansion of the S-matrix around a pole of arbitrary even order, finding agreement with the bootstrapped results. Here we generalise the cut method explained in arXiv:2206.09368 to multiple loops and use it to simplify large networks of singular diagrams. We observe that only a small number of cut diagrams sur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15498","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.15498/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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"}