{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z5VJAXCLQ7KJTG3SNX26WT2E6W","short_pith_number":"pith:Z5VJAXCL","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"},"canonical_sha256":"cf6a905c4b87d4999b726df5eb4f44f59d649614df2af096ab1a1c7d296f3893","source":{"kind":"arxiv","id":"1607.05739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05739","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05739v1","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05739","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"Z5VJAXCLQ7KJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z5VJAXCLQ7KJTG3S","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z5VJAXCL","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z5VJAXCLQ7KJTG3SNX26WT2E6W","target":"record","payload":{"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"},"canonical_sha256":"cf6a905c4b87d4999b726df5eb4f44f59d649614df2af096ab1a1c7d296f3893","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"},"source_kind":"arxiv","source_id":"1607.05739","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:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVOh50J5KVt09YOKBOk5hqfFPnA7cp6vhHBt+0K2sNkM6X/8IK7bVJL4a/VmRhaDNQKRuJLTngnKK1cq6CYjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:31:42.745079Z"},"content_sha256":"3c117786967cee9901fe0c39682345cc46d8a182557340abb330c7d671b8984d","schema_version":"1.0","event_id":"sha256:3c117786967cee9901fe0c39682345cc46d8a182557340abb330c7d671b8984d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z5VJAXCLQ7KJTG3SNX26WT2E6W","target":"graph","payload":{"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"},"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:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pF/FWX99O8+6PfX6zCO4lHn7121VUutl5TQbepll5yyhFYaMkrnEFzMtean6nNksOls607Bt+2qNZ0FoIK4qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:31:42.745800Z"},"content_sha256":"3ba709f8dec0c532c7b03a2589b92ad24baaddb1a2106d6a29decfbbda41dc25","schema_version":"1.0","event_id":"sha256:3ba709f8dec0c532c7b03a2589b92ad24baaddb1a2106d6a29decfbbda41dc25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/bundle.json","state_url":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/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-06-01T01:31:42Z","links":{"resolver":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W","bundle":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/bundle.json","state":"https://pith.science/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5VJAXCLQ7KJTG3SNX26WT2E6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z5VJAXCLQ7KJTG3SNX26WT2E6W","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":"9931d0128606cb4d4f39b8fa113a3c18562ddf5f0e0436797ebc034b5d14da7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T20:05:43Z","title_canon_sha256":"af4328465236b45ad4c6f49f1e4397bbeff856d0ef64bb76da4d201d757135be"},"schema_version":"1.0","source":{"id":"1607.05739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05739","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05739v1","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05739","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"Z5VJAXCLQ7KJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z5VJAXCLQ7KJTG3S","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z5VJAXCL","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:3ba709f8dec0c532c7b03a2589b92ad24baaddb1a2106d6a29decfbbda41dc25","target":"graph","created_at":"2026-05-18T01:10:45Z","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 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.","authors_text":"Alejandro L\\'opez-Ortiz, Daniela Maftuleac, Martin Derka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T20:05:43Z","title":"Recognition of Triangulation Duals of Simple Polygons With and Without Holes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05739","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:3c117786967cee9901fe0c39682345cc46d8a182557340abb330c7d671b8984d","target":"record","created_at":"2026-05-18T01:10:45Z","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":"9931d0128606cb4d4f39b8fa113a3c18562ddf5f0e0436797ebc034b5d14da7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T20:05:43Z","title_canon_sha256":"af4328465236b45ad4c6f49f1e4397bbeff856d0ef64bb76da4d201d757135be"},"schema_version":"1.0","source":{"id":"1607.05739","kind":"arxiv","version":1}},"canonical_sha256":"cf6a905c4b87d4999b726df5eb4f44f59d649614df2af096ab1a1c7d296f3893","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf6a905c4b87d4999b726df5eb4f44f59d649614df2af096ab1a1c7d296f3893","first_computed_at":"2026-05-18T01:10:45.385349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:45.385349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6bPcY4itcYPIXv6AFf2k2GooMLfRTgIgLiZG2fwS2hMP7Li0U97OzYLlpeA1l/kDGPowE2uoZr/4dLQsxHhHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:45.385794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c117786967cee9901fe0c39682345cc46d8a182557340abb330c7d671b8984d","sha256:3ba709f8dec0c532c7b03a2589b92ad24baaddb1a2106d6a29decfbbda41dc25"],"state_sha256":"c0c50ff371a3159fcbddd4cb1babee43e8ac444475cb645c7e9355092fddbaf2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4U9g0T+lAk9XVwLsSbi4RSJD156UOkZsWoVWp5tsZzKZSp6l52OUHqvrxlxI1EZV6lq5RntI5+Lf9mGkWDAYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:31:42.750847Z","bundle_sha256":"f733eb1f813d0fce2fb8e5348cea8521980a95551f5f8947a1231a25f6a3054f"}}