{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RYWGKLF23KEWZ4BKGW4IIHQSIT","short_pith_number":"pith:RYWGKLF2","canonical_record":{"source":{"id":"1905.00727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T13:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"b9b7760d9a5fde3b1ef6a44a2e57ccbf3515a0bdca4437b65a3528ee85b9677d","abstract_canon_sha256":"0de537321fdb1610b2eb4753bf16a042a816f25b86075861b813e19c8c79ace2"},"schema_version":"1.0"},"canonical_sha256":"8e2c652cbada896cf02a35b8841e1244dd9fd0470c3de5f823176f9c47289b2e","source":{"kind":"arxiv","id":"1905.00727","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00727","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00727v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00727","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"RYWGKLF23KEW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYWGKLF23KEWZ4BK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYWGKLF2","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RYWGKLF23KEWZ4BKGW4IIHQSIT","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T13:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"b9b7760d9a5fde3b1ef6a44a2e57ccbf3515a0bdca4437b65a3528ee85b9677d","abstract_canon_sha256":"0de537321fdb1610b2eb4753bf16a042a816f25b86075861b813e19c8c79ace2"},"schema_version":"1.0"},"canonical_sha256":"8e2c652cbada896cf02a35b8841e1244dd9fd0470c3de5f823176f9c47289b2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:09.491485Z","signature_b64":"LbSdRbSOyvH4H8McolbO55efuBL32alfudZOm/Q3cUzbMkZFJD1ZPKPkrHIoFQFsh7Okca/g+HfkfB4AgidaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e2c652cbada896cf02a35b8841e1244dd9fd0470c3de5f823176f9c47289b2e","last_reissued_at":"2026-05-17T23:47:09.490894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:09.490894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00727","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-17T23:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R40NeJrIKmZL0bf2bepMQvapt/hSbSMNBQgwRMtDwG2CCSaG+3FprougyxGvj6deLlOREV41Zc0Ty8Mu9aAxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:18:44.542296Z"},"content_sha256":"b1f3cf200f129ce24883af520c7d29384368bad0de7af2517596d20ee458074a","schema_version":"1.0","event_id":"sha256:b1f3cf200f129ce24883af520c7d29384368bad0de7af2517596d20ee458074a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RYWGKLF23KEWZ4BKGW4IIHQSIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudo-Triangle Visibility Graph: Characterization and Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alireza Zarei, Sahar Mehrpour","submitted_at":"2019-05-02T13:31:01Z","abstract_excerpt":"The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices in a plane in such a way that it will be consistent with this visibility graph. This problem has been solved for special cases when we know that the target polygon is a {\\it tower} or a {\\it spiral}. Knowing that a given visibility graph belongs to a simple polygon with at most three concave chains on its boundary, a {\\it pseuodo-triangle}, we propose a lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00727","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-17T23:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufi3+rdWTd96XIyl+o5Du/R9JPcFq6DUrO4inSxw9qnA5s4QhuF9LkadV3PqhFg7rYohk3rZFSHeBpPyxnwRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:18:44.542859Z"},"content_sha256":"b33644093a6f3ffd1948d913de28eab9af64d93623876fccedacc7eab4a1cce2","schema_version":"1.0","event_id":"sha256:b33644093a6f3ffd1948d913de28eab9af64d93623876fccedacc7eab4a1cce2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYWGKLF23KEWZ4BKGW4IIHQSIT/bundle.json","state_url":"https://pith.science/pith/RYWGKLF23KEWZ4BKGW4IIHQSIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYWGKLF23KEWZ4BKGW4IIHQSIT/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-07T10:18:44Z","links":{"resolver":"https://pith.science/pith/RYWGKLF23KEWZ4BKGW4IIHQSIT","bundle":"https://pith.science/pith/RYWGKLF23KEWZ4BKGW4IIHQSIT/bundle.json","state":"https://pith.science/pith/RYWGKLF23KEWZ4BKGW4IIHQSIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYWGKLF23KEWZ4BKGW4IIHQSIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RYWGKLF23KEWZ4BKGW4IIHQSIT","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":"0de537321fdb1610b2eb4753bf16a042a816f25b86075861b813e19c8c79ace2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T13:31:01Z","title_canon_sha256":"b9b7760d9a5fde3b1ef6a44a2e57ccbf3515a0bdca4437b65a3528ee85b9677d"},"schema_version":"1.0","source":{"id":"1905.00727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00727","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00727v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00727","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"RYWGKLF23KEW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYWGKLF23KEWZ4BK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYWGKLF2","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:b33644093a6f3ffd1948d913de28eab9af64d93623876fccedacc7eab4a1cce2","target":"graph","created_at":"2026-05-17T23:47:09Z","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":"The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices in a plane in such a way that it will be consistent with this visibility graph. This problem has been solved for special cases when we know that the target polygon is a {\\it tower} or a {\\it spiral}. Knowing that a given visibility graph belongs to a simple polygon with at most three concave chains on its boundary, a {\\it pseuodo-triangle}, we propose a lin","authors_text":"Alireza Zarei, Sahar Mehrpour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T13:31:01Z","title":"Pseudo-Triangle Visibility Graph: Characterization and Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00727","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:b1f3cf200f129ce24883af520c7d29384368bad0de7af2517596d20ee458074a","target":"record","created_at":"2026-05-17T23:47:09Z","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":"0de537321fdb1610b2eb4753bf16a042a816f25b86075861b813e19c8c79ace2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T13:31:01Z","title_canon_sha256":"b9b7760d9a5fde3b1ef6a44a2e57ccbf3515a0bdca4437b65a3528ee85b9677d"},"schema_version":"1.0","source":{"id":"1905.00727","kind":"arxiv","version":1}},"canonical_sha256":"8e2c652cbada896cf02a35b8841e1244dd9fd0470c3de5f823176f9c47289b2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e2c652cbada896cf02a35b8841e1244dd9fd0470c3de5f823176f9c47289b2e","first_computed_at":"2026-05-17T23:47:09.490894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:09.490894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LbSdRbSOyvH4H8McolbO55efuBL32alfudZOm/Q3cUzbMkZFJD1ZPKPkrHIoFQFsh7Okca/g+HfkfB4AgidaDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:09.491485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1f3cf200f129ce24883af520c7d29384368bad0de7af2517596d20ee458074a","sha256:b33644093a6f3ffd1948d913de28eab9af64d93623876fccedacc7eab4a1cce2"],"state_sha256":"33de62422312824130137805ea7e1718b84959ca438b26f2c3ad92176dfbd253"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bzjcx8pfDAi0RfwjtGTfsaerSrcueARFUqQUQlI5PbKY3/R24xxRYLRMCoLDzxEs4/WYRgoPpzU5grCrscrEBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:18:44.545773Z","bundle_sha256":"099ac2335c98b68c1534c962f70e91135abba524427ba3bda6c615cdf8bcb378"}}