{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JWQDVEHS67SDSHKROFRCOZITT2","short_pith_number":"pith:JWQDVEHS","schema_version":"1.0","canonical_sha256":"4da03a90f2f7e4391d5171622765139e8aad5b3cc5ea78f6b52b6d171b8b5706","source":{"kind":"arxiv","id":"1412.0779","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.0779","created_at":"2026-05-18T01:25:47.410277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0779v2","created_at":"2026-05-18T01:25:47.410277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0779","created_at":"2026-05-18T01:25:47.410277+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWQDVEHS67SD","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWQDVEHS67SDSHKR","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWQDVEHS","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2","json":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2.json","graph_json":"https://pith.science/api/pith-number/JWQDVEHS67SDSHKROFRCOZITT2/graph.json","events_json":"https://pith.science/api/pith-number/JWQDVEHS67SDSHKROFRCOZITT2/events.json","paper":"https://pith.science/paper/JWQDVEHS"},"agent_actions":{"view_html":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2","download_json":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2.json","view_paper":"https://pith.science/paper/JWQDVEHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0779&json=true","fetch_graph":"https://pith.science/api/pith-number/JWQDVEHS67SDSHKROFRCOZITT2/graph.json","fetch_events":"https://pith.science/api/pith-number/JWQDVEHS67SDSHKROFRCOZITT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/action/storage_attestation","attest_author":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/action/author_attestation","sign_citation":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/action/citation_signature","submit_replication":"https://pith.science/pith/JWQDVEHS67SDSHKROFRCOZITT2/action/replication_record"}},"created_at":"2026-05-18T01:25:47.410277+00:00","updated_at":"2026-05-18T01:25:47.410277+00:00"}