{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XF62UKMIR3E4R4HVJGHKVKXMYJ","short_pith_number":"pith:XF62UKMI","canonical_record":{"source":{"id":"1708.01457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-04T11:27:22Z","cross_cats_sorted":[],"title_canon_sha256":"b79123213a3ec5284df638a05fb4d8db24a92a13bce6fc72829d6d03c956a12c","abstract_canon_sha256":"93d1aae99cf8b78567d35945b21b224d4a6e5f267d44c966f0ded0b1789be3ca"},"schema_version":"1.0"},"canonical_sha256":"b97daa29888ec9c8f0f5498eaaaaecc27e1e43d9b234e14832db26ba03845f7c","source":{"kind":"arxiv","id":"1708.01457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01457","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01457v1","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01457","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"XF62UKMIR3E4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XF62UKMIR3E4R4HV","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XF62UKMI","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XF62UKMIR3E4R4HVJGHKVKXMYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-04T11:27:22Z","cross_cats_sorted":[],"title_canon_sha256":"b79123213a3ec5284df638a05fb4d8db24a92a13bce6fc72829d6d03c956a12c","abstract_canon_sha256":"93d1aae99cf8b78567d35945b21b224d4a6e5f267d44c966f0ded0b1789be3ca"},"schema_version":"1.0"},"canonical_sha256":"b97daa29888ec9c8f0f5498eaaaaecc27e1e43d9b234e14832db26ba03845f7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:37.312999Z","signature_b64":"Qn7EP2w9jo3TjK6A3SDCN7e/Bt0VQj9axGdiGZOBgMM64ZKOWIVsAhCdL+B+1ZuZoH7HsJUufkkiGPsbv4jqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b97daa29888ec9c8f0f5498eaaaaecc27e1e43d9b234e14832db26ba03845f7c","last_reissued_at":"2026-05-18T00:38:37.312402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:37.312402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01457","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-18T00:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljTXM14tWGWx0BQ3SoF0JSgVhzQ8QLsUn3f9DUF2nIibD1HQCIGw79RnzfBMR3tz02w8XUCVuiVTbjjQ8JfRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:45:27.087011Z"},"content_sha256":"0287b65673bf3a8cf6d2d1cbf32e1617dc39b5f882cd30c33a77fa4fd9d88193","schema_version":"1.0","event_id":"sha256:0287b65673bf3a8cf6d2d1cbf32e1617dc39b5f882cd30c33a77fa4fd9d88193"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XF62UKMIR3E4R4HVJGHKVKXMYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Hamid Hoorfar","submitted_at":"2017-08-04T11:27:22Z","abstract_excerpt":"Given a graph $ G $ with $ n $ vertices and a set $ S $ of $ n $ points in the plane, a point-set embedding of $ G $ on $ S $ is a planar drawing such that each vertex of $ G $ is mapped to a distinct point of $ S $. A straight-line point-set embedding is a point-set embedding with no edge bends or curves. The point-set embeddability problem is NP-complete, even when $ G $ is $ 2 $-connected and $ 2 $-outerplanar. It has been solved polynomially only for a few classes of planar graphs. Suppose that $ S $ is the set of vertices of a simple polygon. A straight-line polygon embedding of a graph i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01457","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-18T00:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Hd9zmT55tBKLhkDFuUXRoK/iv9CvkFWDT/8JEltJuLJxHF47foLLqizE8HjPS749t3wL/qTkxf5cKiEQ6JxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:45:27.087364Z"},"content_sha256":"f8e4afa44e36cbc6a40baa971d236f63b5e853b3a8d76675be367770245dbfc6","schema_version":"1.0","event_id":"sha256:f8e4afa44e36cbc6a40baa971d236f63b5e853b3a8d76675be367770245dbfc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XF62UKMIR3E4R4HVJGHKVKXMYJ/bundle.json","state_url":"https://pith.science/pith/XF62UKMIR3E4R4HVJGHKVKXMYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XF62UKMIR3E4R4HVJGHKVKXMYJ/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-20T13:45:27Z","links":{"resolver":"https://pith.science/pith/XF62UKMIR3E4R4HVJGHKVKXMYJ","bundle":"https://pith.science/pith/XF62UKMIR3E4R4HVJGHKVKXMYJ/bundle.json","state":"https://pith.science/pith/XF62UKMIR3E4R4HVJGHKVKXMYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XF62UKMIR3E4R4HVJGHKVKXMYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XF62UKMIR3E4R4HVJGHKVKXMYJ","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":"93d1aae99cf8b78567d35945b21b224d4a6e5f267d44c966f0ded0b1789be3ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-04T11:27:22Z","title_canon_sha256":"b79123213a3ec5284df638a05fb4d8db24a92a13bce6fc72829d6d03c956a12c"},"schema_version":"1.0","source":{"id":"1708.01457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01457","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01457v1","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01457","created_at":"2026-05-18T00:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"XF62UKMIR3E4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XF62UKMIR3E4R4HV","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XF62UKMI","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:f8e4afa44e36cbc6a40baa971d236f63b5e853b3a8d76675be367770245dbfc6","target":"graph","created_at":"2026-05-18T00:38:37Z","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":"Given a graph $ G $ with $ n $ vertices and a set $ S $ of $ n $ points in the plane, a point-set embedding of $ G $ on $ S $ is a planar drawing such that each vertex of $ G $ is mapped to a distinct point of $ S $. A straight-line point-set embedding is a point-set embedding with no edge bends or curves. The point-set embeddability problem is NP-complete, even when $ G $ is $ 2 $-connected and $ 2 $-outerplanar. It has been solved polynomially only for a few classes of planar graphs. Suppose that $ S $ is the set of vertices of a simple polygon. A straight-line polygon embedding of a graph i","authors_text":"Alireza Bagheri, Hamid Hoorfar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-04T11:27:22Z","title":"Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01457","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:0287b65673bf3a8cf6d2d1cbf32e1617dc39b5f882cd30c33a77fa4fd9d88193","target":"record","created_at":"2026-05-18T00:38:37Z","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":"93d1aae99cf8b78567d35945b21b224d4a6e5f267d44c966f0ded0b1789be3ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-04T11:27:22Z","title_canon_sha256":"b79123213a3ec5284df638a05fb4d8db24a92a13bce6fc72829d6d03c956a12c"},"schema_version":"1.0","source":{"id":"1708.01457","kind":"arxiv","version":1}},"canonical_sha256":"b97daa29888ec9c8f0f5498eaaaaecc27e1e43d9b234e14832db26ba03845f7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b97daa29888ec9c8f0f5498eaaaaecc27e1e43d9b234e14832db26ba03845f7c","first_computed_at":"2026-05-18T00:38:37.312402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:37.312402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qn7EP2w9jo3TjK6A3SDCN7e/Bt0VQj9axGdiGZOBgMM64ZKOWIVsAhCdL+B+1ZuZoH7HsJUufkkiGPsbv4jqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:37.312999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0287b65673bf3a8cf6d2d1cbf32e1617dc39b5f882cd30c33a77fa4fd9d88193","sha256:f8e4afa44e36cbc6a40baa971d236f63b5e853b3a8d76675be367770245dbfc6"],"state_sha256":"91995b8699a605baae49592cb46123353c6876bd5aa987c094a284f946e297ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fksq1d7dftsbhMZCpujdBah2bVPABRiQSnYxNzc0K/9xlLpqgoAdEkABLitZ/I+4hGH7EYFJYnDz3VJs9pYnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T13:45:27.089280Z","bundle_sha256":"0a690dd49b19d27c60844bf4b9d140601701fa84729a47afab2d50094cab1c19"}}