{"paper":{"title":"An Interesting Gadget for Chain Pair Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Tim Wylie","submitted_at":"2016-07-22T02:07:17Z","abstract_excerpt":"In this paper we present an interesting gadget based on the chain pair simplification problem under the discrete Fr\\'echet distance (CPS-3F), which allows the construction of arbitrarily long paths that must be chosen in the simplification of the two curves. A pseudopolynomial time reduction from set partition is given as an example. For clarification, CPS-3F was recently shown to be in \\textbf{P}, and the reduction is merely to show how the gadget works."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06539","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"}