{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DYQDSUAPLU5ENLZ7WCDXQUGHOK","short_pith_number":"pith:DYQDSUAP","schema_version":"1.0","canonical_sha256":"1e2039500f5d3a46af3fb0877850c77286507daac77d314a7ac8737c3567f88d","source":{"kind":"arxiv","id":"1603.07077","version":1},"attestation_state":"computed","paper":{"title":"Computing Nonsimple Polygons of Minimum Perimeter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Andreas Haas, Arne Schmidt, Christiane Schmidt, Dominik Krupke, Florian Maurer, Irina Kostitsyna, Joseph S. B. Mitchell, Julian Troegel, Michael Hemmer, Michael Hoffmann, S\\'andor P. Fekete","submitted_at":"2016-03-23T06:25:07Z","abstract_excerpt":"We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP) asks for a (not necessarily simply connected) polygon with shortest possible boundary length. Even though the closely related problem of finding a minimum cycle cover is polynomially solvable by matching techniques, we prove how the topological structure of a polygon leads to NP-hardness of the MPP. On the positive side, we show how to achieve a constant-fa"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1603.07077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-23T06:25:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8948eb35cf9caeff71715dd0831973f011ba46521d1e6900bc470764b4da4b07","abstract_canon_sha256":"5e7dfeda8a8ee5ad145985179914e1011ede06d89e1cf6c9197d9148910e94d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:24.536001Z","signature_b64":"t7RraUX1AxC3FyjWEJ/D8cyJMIwsatQOCM45OLLo/R3QiSUp51RVEKhxI11Yg07shGOkDqlKaAfPoRWAiLgbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e2039500f5d3a46af3fb0877850c77286507daac77d314a7ac8737c3567f88d","last_reissued_at":"2026-05-18T01:18:24.535481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:24.535481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Nonsimple Polygons of Minimum Perimeter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Andreas Haas, Arne Schmidt, Christiane Schmidt, Dominik Krupke, Florian Maurer, Irina Kostitsyna, Joseph S. B. Mitchell, Julian Troegel, Michael Hemmer, Michael Hoffmann, S\\'andor P. Fekete","submitted_at":"2016-03-23T06:25:07Z","abstract_excerpt":"We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP) asks for a (not necessarily simply connected) polygon with shortest possible boundary length. Even though the closely related problem of finding a minimum cycle cover is polynomially solvable by matching techniques, we prove how the topological structure of a polygon leads to NP-hardness of the MPP. On the positive side, we show how to achieve a constant-fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07077","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.07077","created_at":"2026-05-18T01:18:24.535561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07077v1","created_at":"2026-05-18T01:18:24.535561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07077","created_at":"2026-05-18T01:18:24.535561+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYQDSUAPLU5E","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYQDSUAPLU5ENLZ7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYQDSUAP","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK","json":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK.json","graph_json":"https://pith.science/api/pith-number/DYQDSUAPLU5ENLZ7WCDXQUGHOK/graph.json","events_json":"https://pith.science/api/pith-number/DYQDSUAPLU5ENLZ7WCDXQUGHOK/events.json","paper":"https://pith.science/paper/DYQDSUAP"},"agent_actions":{"view_html":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK","download_json":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK.json","view_paper":"https://pith.science/paper/DYQDSUAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07077&json=true","fetch_graph":"https://pith.science/api/pith-number/DYQDSUAPLU5ENLZ7WCDXQUGHOK/graph.json","fetch_events":"https://pith.science/api/pith-number/DYQDSUAPLU5ENLZ7WCDXQUGHOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/action/storage_attestation","attest_author":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/action/author_attestation","sign_citation":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/action/citation_signature","submit_replication":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/action/replication_record"}},"created_at":"2026-05-18T01:18:24.535561+00:00","updated_at":"2026-05-18T01:18:24.535561+00:00"}