{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DYQDSUAPLU5ENLZ7WCDXQUGHOK","short_pith_number":"pith:DYQDSUAP","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"},"canonical_sha256":"1e2039500f5d3a46af3fb0877850c77286507daac77d314a7ac8737c3567f88d","source":{"kind":"arxiv","id":"1603.07077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07077","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07077v1","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07077","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"DYQDSUAPLU5E","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DYQDSUAPLU5ENLZ7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DYQDSUAP","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DYQDSUAPLU5ENLZ7WCDXQUGHOK","target":"record","payload":{"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"},"canonical_sha256":"1e2039500f5d3a46af3fb0877850c77286507daac77d314a7ac8737c3567f88d","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"},"source_kind":"arxiv","source_id":"1603.07077","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-18T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dwGLSEVRz8OyeAuDZt3LO4p2F1prm1tmKu97y4GVIoi0FaB6seYBoxJDuJK4GMHM8P2Noo6o+W8jvrxXeNNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:30.982150Z"},"content_sha256":"625bfa3f3c224904cc1730df46aa001c1fbe1819e8d4e97cf4ce3756b6a2143d","schema_version":"1.0","event_id":"sha256:625bfa3f3c224904cc1730df46aa001c1fbe1819e8d4e97cf4ce3756b6a2143d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DYQDSUAPLU5ENLZ7WCDXQUGHOK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfnZ5iCesLcUmZCTE3VBokV1TmO+FduX4hARIiNPpx4AFTf8epGXi9BANf9ygSGdvpCW3f7HTtLfqAFeeS+HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:30.982828Z"},"content_sha256":"dfece288ea0a2bd79af008a1baf2c36dfe361827b3cd30c21ae86cc42f77a22b","schema_version":"1.0","event_id":"sha256:dfece288ea0a2bd79af008a1baf2c36dfe361827b3cd30c21ae86cc42f77a22b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/bundle.json","state_url":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/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-05-27T19:43:30Z","links":{"resolver":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK","bundle":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/bundle.json","state":"https://pith.science/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYQDSUAPLU5ENLZ7WCDXQUGHOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DYQDSUAPLU5ENLZ7WCDXQUGHOK","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":"5e7dfeda8a8ee5ad145985179914e1011ede06d89e1cf6c9197d9148910e94d6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-23T06:25:07Z","title_canon_sha256":"8948eb35cf9caeff71715dd0831973f011ba46521d1e6900bc470764b4da4b07"},"schema_version":"1.0","source":{"id":"1603.07077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07077","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07077v1","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07077","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"DYQDSUAPLU5E","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DYQDSUAPLU5ENLZ7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DYQDSUAP","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:dfece288ea0a2bd79af008a1baf2c36dfe361827b3cd30c21ae86cc42f77a22b","target":"graph","created_at":"2026-05-18T01:18:24Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","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","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-23T06:25:07Z","title":"Computing Nonsimple Polygons of Minimum Perimeter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07077","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:625bfa3f3c224904cc1730df46aa001c1fbe1819e8d4e97cf4ce3756b6a2143d","target":"record","created_at":"2026-05-18T01:18:24Z","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":"5e7dfeda8a8ee5ad145985179914e1011ede06d89e1cf6c9197d9148910e94d6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-23T06:25:07Z","title_canon_sha256":"8948eb35cf9caeff71715dd0831973f011ba46521d1e6900bc470764b4da4b07"},"schema_version":"1.0","source":{"id":"1603.07077","kind":"arxiv","version":1}},"canonical_sha256":"1e2039500f5d3a46af3fb0877850c77286507daac77d314a7ac8737c3567f88d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e2039500f5d3a46af3fb0877850c77286507daac77d314a7ac8737c3567f88d","first_computed_at":"2026-05-18T01:18:24.535481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:24.535481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t7RraUX1AxC3FyjWEJ/D8cyJMIwsatQOCM45OLLo/R3QiSUp51RVEKhxI11Yg07shGOkDqlKaAfPoRWAiLgbDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:24.536001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:625bfa3f3c224904cc1730df46aa001c1fbe1819e8d4e97cf4ce3756b6a2143d","sha256:dfece288ea0a2bd79af008a1baf2c36dfe361827b3cd30c21ae86cc42f77a22b"],"state_sha256":"6322d43669b963c7dd060e833bac65635c831c6ac40b25f695ee76cf40b7f171"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lHiLPMBgzxj3LEY5/WF0iWnq3nLGqte3zImyD0zBD4Zr2DKx+cBQBQk1BEgaBRXvUJsuwjClirDB9S/EydJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:43:30.986357Z","bundle_sha256":"7a42585fa021cb0e7cb18980e98b3a7447191a0c00ed1f2485104015e7a4dd1e"}}