{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z5VJAXCLQ7KJTG3SNX26WT2E6W","short_pith_number":"pith:Z5VJAXCL","schema_version":"1.0","canonical_sha256":"cf6a905c4b87d4999b726df5eb4f44f59d649614df2af096ab1a1c7d296f3893","source":{"kind":"arxiv","id":"1607.05739","version":1},"attestation_state":"computed","paper":{"title":"Recognition of Triangulation Duals of Simple Polygons With and Without Holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alejandro L\\'opez-Ortiz, Daniela Maftuleac, Martin Derka","submitted_at":"2016-07-19T20:05:43Z","abstract_excerpt":"We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to the dual of a triangulation of a simple polygon with or without holes and interior points. We show that the difficulty of this problem depends critically on the amount of information given and we give a sharp boundary between the various tractable and intractable versions of the problem."},"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":"1607.05739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T20:05:43Z","cross_cats_sorted":[],"title_canon_sha256":"af4328465236b45ad4c6f49f1e4397bbeff856d0ef64bb76da4d201d757135be","abstract_canon_sha256":"9931d0128606cb4d4f39b8fa113a3c18562ddf5f0e0436797ebc034b5d14da7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:45.385794Z","signature_b64":"6bPcY4itcYPIXv6AFf2k2GooMLfRTgIgLiZG2fwS2hMP7Li0U97OzYLlpeA1l/kDGPowE2uoZr/4dLQsxHhHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf6a905c4b87d4999b726df5eb4f44f59d649614df2af096ab1a1c7d296f3893","last_reissued_at":"2026-05-18T01:10:45.385349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:45.385349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognition of Triangulation Duals of Simple Polygons With and Without Holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alejandro L\\'opez-Ortiz, Daniela Maftuleac, Martin Derka","submitted_at":"2016-07-19T20:05:43Z","abstract_excerpt":"We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to the dual of a triangulation of a simple polygon with or without holes and interior points. We show that the difficulty of this problem depends critically on the amount of information given and we give a sharp boundary between the various tractable and intractable versions of the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05739","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":"1607.05739","created_at":"2026-05-18T01:10:45.385420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05739v1","created_at":"2026-05-18T01:10:45.385420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05739","created_at":"2026-05-18T01:10:45.385420+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5VJAXCLQ7KJ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5VJAXCLQ7KJTG3S","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5VJAXCL","created_at":"2026-05-18T12:30:53.716459+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/Z5VJAXCLQ7KJTG3SNX26WT2E6W","json":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W.json","graph_json":"https://pith.science/api/pith-number/Z5VJAXCLQ7KJTG3SNX26WT2E6W/graph.json","events_json":"https://pith.science/api/pith-number/Z5VJAXCLQ7KJTG3SNX26WT2E6W/events.json","paper":"https://pith.science/paper/Z5VJAXCL"},"agent_actions":{"view_html":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W","download_json":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W.json","view_paper":"https://pith.science/paper/Z5VJAXCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05739&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5VJAXCLQ7KJTG3SNX26WT2E6W/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5VJAXCLQ7KJTG3SNX26WT2E6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/action/storage_attestation","attest_author":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/action/author_attestation","sign_citation":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/action/citation_signature","submit_replication":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/action/replication_record"}},"created_at":"2026-05-18T01:10:45.385420+00:00","updated_at":"2026-05-18T01:10:45.385420+00:00"}