{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZO63RF3HLMKNWCOVLM52643KWA","short_pith_number":"pith:ZO63RF3H","schema_version":"1.0","canonical_sha256":"cbbdb897675b14db09d55b3baf736ab0134f99e428ff57725b24451c014fabba","source":{"kind":"arxiv","id":"1011.6498","version":1},"attestation_state":"computed","paper":{"title":"Approximate Shortest Path through a Weighted Planar Subdivision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor","submitted_at":"2010-11-30T09:38:47Z","abstract_excerpt":"This paper presents an approximation algorithm for finding a shortest path between two points $s$ and $t$ in a weighted planar subdivision $\\PS$. Each face $f$ of $\\PS$ is associated with a weight $w_f$, and the cost of travel along a line segment on $f$ is $w_f$ multiplied by the Euclidean norm of that line segment. The cost of a path which traverses across several faces of the subdivision is the sum of the costs of travel along each face. Our algorithm progreeses the discretized shortest path wavefront from source $s$, and takes polynomial time in finding an $\\epsilon$-approximate shortest p"},"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":"1011.6498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-30T09:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"3f0f37709c58870a8681f15fe07f22cae6bdda9909191305de7cc749d7c04ed0","abstract_canon_sha256":"b45348b31ee93f059b4470e5235e77b2141e726804893f1b8abd3362765a99ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:26.784150Z","signature_b64":"BuHzyLsWIUeQ3iaB4nLm/4o+SfMv9JRggAu2fIhjbLWv751VttrM77+erystwZuBGd/CYOL7BIU9li15MpDICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbbdb897675b14db09d55b3baf736ab0134f99e428ff57725b24451c014fabba","last_reissued_at":"2026-05-18T04:34:26.783603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:26.783603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Shortest Path through a Weighted Planar Subdivision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor","submitted_at":"2010-11-30T09:38:47Z","abstract_excerpt":"This paper presents an approximation algorithm for finding a shortest path between two points $s$ and $t$ in a weighted planar subdivision $\\PS$. Each face $f$ of $\\PS$ is associated with a weight $w_f$, and the cost of travel along a line segment on $f$ is $w_f$ multiplied by the Euclidean norm of that line segment. The cost of a path which traverses across several faces of the subdivision is the sum of the costs of travel along each face. Our algorithm progreeses the discretized shortest path wavefront from source $s$, and takes polynomial time in finding an $\\epsilon$-approximate shortest p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6498","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.6498","created_at":"2026-05-18T04:34:26.783680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.6498v1","created_at":"2026-05-18T04:34:26.783680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6498","created_at":"2026-05-18T04:34:26.783680+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZO63RF3HLMKN","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZO63RF3HLMKNWCOV","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZO63RF3H","created_at":"2026-05-18T12:26:18.847500+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/ZO63RF3HLMKNWCOVLM52643KWA","json":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA.json","graph_json":"https://pith.science/api/pith-number/ZO63RF3HLMKNWCOVLM52643KWA/graph.json","events_json":"https://pith.science/api/pith-number/ZO63RF3HLMKNWCOVLM52643KWA/events.json","paper":"https://pith.science/paper/ZO63RF3H"},"agent_actions":{"view_html":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA","download_json":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA.json","view_paper":"https://pith.science/paper/ZO63RF3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.6498&json=true","fetch_graph":"https://pith.science/api/pith-number/ZO63RF3HLMKNWCOVLM52643KWA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZO63RF3HLMKNWCOVLM52643KWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/action/storage_attestation","attest_author":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/action/author_attestation","sign_citation":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/action/citation_signature","submit_replication":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/action/replication_record"}},"created_at":"2026-05-18T04:34:26.783680+00:00","updated_at":"2026-05-18T04:34:26.783680+00:00"}