{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L5ZWA3GKITHSMFUDNR2GPWQBDL","short_pith_number":"pith:L5ZWA3GK","schema_version":"1.0","canonical_sha256":"5f73606cca44cf2616836c7467da011ae207c2f74e9d8b96eed92728cab853ef","source":{"kind":"arxiv","id":"1610.00361","version":1},"attestation_state":"computed","paper":{"title":"Reconstruction of weakly simple polygons from their edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Hugo A. Akitaya","submitted_at":"2016-10-02T22:12:56Z","abstract_excerpt":"Given $n$ line segments in the plane, do they form the edge set of a \\emph{weakly simple polygon}; that is, can the segment endpoints be perturbed by at most $\\varepsilon$, for any $\\varepsilon>0$, to obtain a simple polygon? While the analogous question for \\emph{simple polygons} can easily be answered in $O(n\\log n)$ time, we show that it is NP-complete for weakly simple polygons. We give $O(n)$-time algorithms in two special cases: when all segments are collinear, or the segment endpoints are in general position. These results extend to the variant in which the segments are \\emph{directed},"},"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":"1610.00361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-10-02T22:12:56Z","cross_cats_sorted":[],"title_canon_sha256":"0f2cda9c54d6aad4d28752367caed1a740438bb8b50f5cb97261a7840c7b90ed","abstract_canon_sha256":"76b3bc265dd21efff2184196810223664c9cf53079fcd1ef4c5e331398dcde93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:33.117162Z","signature_b64":"FGci3ayk90waqIRYuzwsNqSaY4IgJmZxEpsVYlKg4LoJTxYzDAs4qBTnDBaXG6FgMo9XN1m09sJW3Y+iLBx7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f73606cca44cf2616836c7467da011ae207c2f74e9d8b96eed92728cab853ef","last_reissued_at":"2026-05-17T23:57:33.116607Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:33.116607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction of weakly simple polygons from their edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Hugo A. Akitaya","submitted_at":"2016-10-02T22:12:56Z","abstract_excerpt":"Given $n$ line segments in the plane, do they form the edge set of a \\emph{weakly simple polygon}; that is, can the segment endpoints be perturbed by at most $\\varepsilon$, for any $\\varepsilon>0$, to obtain a simple polygon? While the analogous question for \\emph{simple polygons} can easily be answered in $O(n\\log n)$ time, we show that it is NP-complete for weakly simple polygons. We give $O(n)$-time algorithms in two special cases: when all segments are collinear, or the segment endpoints are in general position. These results extend to the variant in which the segments are \\emph{directed},"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00361","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":"1610.00361","created_at":"2026-05-17T23:57:33.116682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00361v1","created_at":"2026-05-17T23:57:33.116682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00361","created_at":"2026-05-17T23:57:33.116682+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5ZWA3GKITHS","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5ZWA3GKITHSMFUD","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5ZWA3GK","created_at":"2026-05-18T12:30:29.479603+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/L5ZWA3GKITHSMFUDNR2GPWQBDL","json":"https://pith.science/pith/L5ZWA3GKITHSMFUDNR2GPWQBDL.json","graph_json":"https://pith.science/api/pith-number/L5ZWA3GKITHSMFUDNR2GPWQBDL/graph.json","events_json":"https://pith.science/api/pith-number/L5ZWA3GKITHSMFUDNR2GPWQBDL/events.json","paper":"https://pith.science/paper/L5ZWA3GK"},"agent_actions":{"view_html":"https://pith.science/pith/L5ZWA3GKITHSMFUDNR2GPWQBDL","download_json":"https://pith.science/pith/L5ZWA3GKITHSMFUDNR2GPWQBDL.json","view_paper":"https://pith.science/paper/L5ZWA3GK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00361&json=true","fetch_graph":"https://pith.science/api/pith-number/L5ZWA3GKITHSMFUDNR2GPWQBDL/graph.json","fetch_events":"https://pith.science/api/pith-number/L5ZWA3GKITHSMFUDNR2GPWQBDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5ZWA3GKITHSMFUDNR2GPWQBDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5ZWA3GKITHSMFUDNR2GPWQBDL/action/storage_attestation","attest_author":"https://pith.science/pith/L5ZWA3GKITHSMFUDNR2GPWQBDL/action/author_attestation","sign_citation":"https://pith.science/pith/L5ZWA3GKITHSMFUDNR2GPWQBDL/action/citation_signature","submit_replication":"https://pith.science/pith/L5ZWA3GKITHSMFUDNR2GPWQBDL/action/replication_record"}},"created_at":"2026-05-17T23:57:33.116682+00:00","updated_at":"2026-05-17T23:57:33.116682+00:00"}