{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JWQDVEHS67SDSHKROFRCOZITT2","short_pith_number":"pith:JWQDVEHS","canonical_record":{"source":{"id":"1412.0779","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T04:12:05Z","cross_cats_sorted":[],"title_canon_sha256":"359e3f8912b26541985cff00da54fd891131b84869cbb89b03afd6fd9fb0d5e9","abstract_canon_sha256":"59fa9f40254c142d1dca2fbb42befa7b44b1913a8ad1d507c1dd09646c0964d3"},"schema_version":"1.0"},"canonical_sha256":"4da03a90f2f7e4391d5171622765139e8aad5b3cc5ea78f6b52b6d171b8b5706","source":{"kind":"arxiv","id":"1412.0779","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0779","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0779v2","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0779","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"JWQDVEHS67SD","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JWQDVEHS67SDSHKR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JWQDVEHS","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JWQDVEHS67SDSHKROFRCOZITT2","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0779","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T04:12:05Z","cross_cats_sorted":[],"title_canon_sha256":"359e3f8912b26541985cff00da54fd891131b84869cbb89b03afd6fd9fb0d5e9","abstract_canon_sha256":"59fa9f40254c142d1dca2fbb42befa7b44b1913a8ad1d507c1dd09646c0964d3"},"schema_version":"1.0"},"canonical_sha256":"4da03a90f2f7e4391d5171622765139e8aad5b3cc5ea78f6b52b6d171b8b5706","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:47.410870Z","signature_b64":"F2hZ/gQzCanobH07SxBVo7gW7KuzjTpDjswmwYcN09vWxIs7qvLyo4Ud7xdtmIoRpuYuhrlF1mEneSDfOcIsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da03a90f2f7e4391d5171622765139e8aad5b3cc5ea78f6b52b6d171b8b5706","last_reissued_at":"2026-05-18T01:25:47.410188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:47.410188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0779","source_version":2,"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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kmZBB0+dJSrRA6Zm7arJKsY/+P7D4fS08M+zeH5Nl1d4/9RKbPFvzkUumdrkSVHDeR4MGOosqqFu6aRjsdYfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:41:53.176513Z"},"content_sha256":"8a9f2168f03bc6bcbc30da2214bb98b6478a7057516eff2e85391e6e488692b9","schema_version":"1.0","event_id":"sha256:8a9f2168f03bc6bcbc30da2214bb98b6478a7057516eff2e85391e6e488692b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JWQDVEHS67SDSHKROFRCOZITT2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Path in a Polygon using Sublinear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled","submitted_at":"2014-12-02T04:12:05Z","abstract_excerpt":"$\\renewcommand{\\Re}{{\\rm I\\!\\hspace{-0.025em} R}} \\newcommand{\\SetX}{\\mathsf{X}} \\newcommand{\\VorX}[1]{\\mathcal{V} \\pth{#1}} \\newcommand{\\Polygon}{\\mathsf{P}} \\newcommand{\\Space}{\\overline{\\mathsf{m}}} \\newcommand{\\pth}[2][\\!]{#1\\left({#2}\\right)}$ We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygon, given in a read only memory, using sublinear space and subquadratic time. Specifically, given a simple polygon $\\Polygon$ with $n$ vertices in a read only memory, and additional working memory of size $\\Space$, the new algorithm computes the shorte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0779","kind":"arxiv","version":2},"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:25:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uM9TRy54ncPxiQsG11zP1f3IeN2X5JHR7RTvXs4yJmIU2Cjwz8J61l0sMfE3tUt/NiBy8zsQ932ictKttXVqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:41:53.176972Z"},"content_sha256":"39797042d17312cecfdb91ef5aeab8b5a512f439db76d3a9146820df712027b5","schema_version":"1.0","event_id":"sha256:39797042d17312cecfdb91ef5aeab8b5a512f439db76d3a9146820df712027b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/bundle.json","state_url":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWQDVEHS67SDSHKROFRCOZITT2/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-08T16:41:53Z","links":{"resolver":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2","bundle":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/bundle.json","state":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWQDVEHS67SDSHKROFRCOZITT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JWQDVEHS67SDSHKROFRCOZITT2","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":"59fa9f40254c142d1dca2fbb42befa7b44b1913a8ad1d507c1dd09646c0964d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T04:12:05Z","title_canon_sha256":"359e3f8912b26541985cff00da54fd891131b84869cbb89b03afd6fd9fb0d5e9"},"schema_version":"1.0","source":{"id":"1412.0779","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0779","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0779v2","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0779","created_at":"2026-05-18T01:25:47Z"},{"alias_kind":"pith_short_12","alias_value":"JWQDVEHS67SD","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JWQDVEHS67SDSHKR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JWQDVEHS","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:39797042d17312cecfdb91ef5aeab8b5a512f439db76d3a9146820df712027b5","target":"graph","created_at":"2026-05-18T01:25:47Z","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":"$\\renewcommand{\\Re}{{\\rm I\\!\\hspace{-0.025em} R}} \\newcommand{\\SetX}{\\mathsf{X}} \\newcommand{\\VorX}[1]{\\mathcal{V} \\pth{#1}} \\newcommand{\\Polygon}{\\mathsf{P}} \\newcommand{\\Space}{\\overline{\\mathsf{m}}} \\newcommand{\\pth}[2][\\!]{#1\\left({#2}\\right)}$ We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygon, given in a read only memory, using sublinear space and subquadratic time. Specifically, given a simple polygon $\\Polygon$ with $n$ vertices in a read only memory, and additional working memory of size $\\Space$, the new algorithm computes the shorte","authors_text":"Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T04:12:05Z","title":"Shortest Path in a Polygon using Sublinear Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0779","kind":"arxiv","version":2},"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:8a9f2168f03bc6bcbc30da2214bb98b6478a7057516eff2e85391e6e488692b9","target":"record","created_at":"2026-05-18T01:25:47Z","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":"59fa9f40254c142d1dca2fbb42befa7b44b1913a8ad1d507c1dd09646c0964d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T04:12:05Z","title_canon_sha256":"359e3f8912b26541985cff00da54fd891131b84869cbb89b03afd6fd9fb0d5e9"},"schema_version":"1.0","source":{"id":"1412.0779","kind":"arxiv","version":2}},"canonical_sha256":"4da03a90f2f7e4391d5171622765139e8aad5b3cc5ea78f6b52b6d171b8b5706","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4da03a90f2f7e4391d5171622765139e8aad5b3cc5ea78f6b52b6d171b8b5706","first_computed_at":"2026-05-18T01:25:47.410188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:47.410188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F2hZ/gQzCanobH07SxBVo7gW7KuzjTpDjswmwYcN09vWxIs7qvLyo4Ud7xdtmIoRpuYuhrlF1mEneSDfOcIsCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:47.410870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0779","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a9f2168f03bc6bcbc30da2214bb98b6478a7057516eff2e85391e6e488692b9","sha256:39797042d17312cecfdb91ef5aeab8b5a512f439db76d3a9146820df712027b5"],"state_sha256":"bdf6b91b6cf0be2ca997e9ea2a32f343be27ce34a304a771e9dbf8575995ffd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DzjxMMAobr1EoBEM5fMKoI0ubhUTvHqnlkWKgSQXKgjkrYLqsMRvV6+U89HyiQ+VhD6dYb3A5Ak9c3gELD8gAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:41:53.179828Z","bundle_sha256":"c2cf6fc511291a849ec64a14a40f79f510a2e919e5c9e4655110dce542256c85"}}