{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BFZTJY2XDEO3GW6WHHEK52643S","short_pith_number":"pith:BFZTJY2X","canonical_record":{"source":{"id":"1703.06107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-17T17:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"04245197eae2b9cb9b91cac43d7935009ffcc4f050e078cc0c21fa659ab8d28c","abstract_canon_sha256":"ff3e6aeb02a71b6b47381d88f537345bfa42acd9c7a02cb16d0ca2ec706c2873"},"schema_version":"1.0"},"canonical_sha256":"097334e357191db35bd639c8aeebdcdc8f7fca267c1c93b4ae9a6155bcd25f18","source":{"kind":"arxiv","id":"1703.06107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06107","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06107v1","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06107","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"BFZTJY2XDEO3","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BFZTJY2XDEO3GW6W","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BFZTJY2X","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BFZTJY2XDEO3GW6WHHEK52643S","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-17T17:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"04245197eae2b9cb9b91cac43d7935009ffcc4f050e078cc0c21fa659ab8d28c","abstract_canon_sha256":"ff3e6aeb02a71b6b47381d88f537345bfa42acd9c7a02cb16d0ca2ec706c2873"},"schema_version":"1.0"},"canonical_sha256":"097334e357191db35bd639c8aeebdcdc8f7fca267c1c93b4ae9a6155bcd25f18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:29.480022Z","signature_b64":"TYoN3VUWAkO6S1Oq/bdu717mDVdkRBE9vnOO8C+k8G+qb5njhDH+ykcS5a+PJ4X5bTWgBcSfQTMQzXBdZZDDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"097334e357191db35bd639c8aeebdcdc8f7fca267c1c93b4ae9a6155bcd25f18","last_reissued_at":"2026-05-18T00:48:29.479555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:29.479555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06107","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:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wl1U49J1uZGdpyRrnls3Libx2+b0etM340z8u85ZqaK9Y36jXeEiY4wlicAvDnHyc5qeCULtEa9McxSLmHYeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:12:48.422703Z"},"content_sha256":"c5ddee5158359b77146ee1f5369da4795e7edf649b530b190a9fc42043732b60","schema_version":"1.0","event_id":"sha256:c5ddee5158359b77146ee1f5369da4795e7edf649b530b190a9fc42043732b60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BFZTJY2XDEO3GW6WHHEK52643S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-approaching paths in simple polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Irina Kostitsyna, Prosenjit Bose, Stefan Langerman","submitted_at":"2017-03-17T17:13:58Z","abstract_excerpt":"We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does not increase, that is, for all points $a$, $b$, and $c$ that appear in that order along the curve, $|ac| \\ge |bc|$. We analyze the properties, and present a characterization of shortest self-approaching paths. In particular, we show that a shortest self-approaching path connecting two points inside a polygon can be forced to use a general class of non-algebrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06107","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:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkkNqx2tMEtQLMvjB6/QBD3Vo338wFYoLbkfOzc4T5dm2v++02TGlrXqOJpsy5EorMfOPd5uq2auhH87Uw+vBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:12:48.423373Z"},"content_sha256":"f64fa84b5f26210d1317f8c7ac277047e6e9d3622f6bcfa1808fe0581840b3de","schema_version":"1.0","event_id":"sha256:f64fa84b5f26210d1317f8c7ac277047e6e9d3622f6bcfa1808fe0581840b3de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFZTJY2XDEO3GW6WHHEK52643S/bundle.json","state_url":"https://pith.science/pith/BFZTJY2XDEO3GW6WHHEK52643S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFZTJY2XDEO3GW6WHHEK52643S/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-05-26T07:12:48Z","links":{"resolver":"https://pith.science/pith/BFZTJY2XDEO3GW6WHHEK52643S","bundle":"https://pith.science/pith/BFZTJY2XDEO3GW6WHHEK52643S/bundle.json","state":"https://pith.science/pith/BFZTJY2XDEO3GW6WHHEK52643S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFZTJY2XDEO3GW6WHHEK52643S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BFZTJY2XDEO3GW6WHHEK52643S","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":"ff3e6aeb02a71b6b47381d88f537345bfa42acd9c7a02cb16d0ca2ec706c2873","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-17T17:13:58Z","title_canon_sha256":"04245197eae2b9cb9b91cac43d7935009ffcc4f050e078cc0c21fa659ab8d28c"},"schema_version":"1.0","source":{"id":"1703.06107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06107","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06107v1","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06107","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"BFZTJY2XDEO3","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BFZTJY2XDEO3GW6W","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BFZTJY2X","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:f64fa84b5f26210d1317f8c7ac277047e6e9d3622f6bcfa1808fe0581840b3de","target":"graph","created_at":"2026-05-18T00:48:29Z","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 study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does not increase, that is, for all points $a$, $b$, and $c$ that appear in that order along the curve, $|ac| \\ge |bc|$. We analyze the properties, and present a characterization of shortest self-approaching paths. In particular, we show that a shortest self-approaching path connecting two points inside a polygon can be forced to use a general class of non-algebrai","authors_text":"Irina Kostitsyna, Prosenjit Bose, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-17T17:13:58Z","title":"Self-approaching paths in simple polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06107","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:c5ddee5158359b77146ee1f5369da4795e7edf649b530b190a9fc42043732b60","target":"record","created_at":"2026-05-18T00:48:29Z","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":"ff3e6aeb02a71b6b47381d88f537345bfa42acd9c7a02cb16d0ca2ec706c2873","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-17T17:13:58Z","title_canon_sha256":"04245197eae2b9cb9b91cac43d7935009ffcc4f050e078cc0c21fa659ab8d28c"},"schema_version":"1.0","source":{"id":"1703.06107","kind":"arxiv","version":1}},"canonical_sha256":"097334e357191db35bd639c8aeebdcdc8f7fca267c1c93b4ae9a6155bcd25f18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"097334e357191db35bd639c8aeebdcdc8f7fca267c1c93b4ae9a6155bcd25f18","first_computed_at":"2026-05-18T00:48:29.479555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:29.479555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TYoN3VUWAkO6S1Oq/bdu717mDVdkRBE9vnOO8C+k8G+qb5njhDH+ykcS5a+PJ4X5bTWgBcSfQTMQzXBdZZDDCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:29.480022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5ddee5158359b77146ee1f5369da4795e7edf649b530b190a9fc42043732b60","sha256:f64fa84b5f26210d1317f8c7ac277047e6e9d3622f6bcfa1808fe0581840b3de"],"state_sha256":"c26d04291ccd97545596780451df16eda7ead60c07a0b80bcd23fa8baec6b763"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/APpg1NBHjm0KRm2ZYlIVeR1iU/39kp2SX0DkPUL/cvBa3OYAwO4y5nP/cHmzfCmXEhJ5BqsLrSgBCjGepWLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:12:48.426659Z","bundle_sha256":"99b90e739b6193f74c2a918c86f74ac5ac91c6f2f3f5b4ba3f2456abf5e2377b"}}