{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZO63RF3HLMKNWCOVLM52643KWA","short_pith_number":"pith:ZO63RF3H","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"},"canonical_sha256":"cbbdb897675b14db09d55b3baf736ab0134f99e428ff57725b24451c014fabba","source":{"kind":"arxiv","id":"1011.6498","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6498","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6498v1","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6498","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZO63RF3HLMKN","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZO63RF3HLMKNWCOV","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZO63RF3H","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZO63RF3HLMKNWCOVLM52643KWA","target":"record","payload":{"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"},"canonical_sha256":"cbbdb897675b14db09d55b3baf736ab0134f99e428ff57725b24451c014fabba","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"},"source_kind":"arxiv","source_id":"1011.6498","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-18T04:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4gHXvjSnwj7wtQLdYc7p43mdG4sTFWlrLiOiOtbhNHlc+z8NSr8e0yAs3fkFzMHT1YCQEPgpnwuYpCe/BmZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:13:56.525527Z"},"content_sha256":"c92a4e529e0a4d29aa984348bc24668a61a9e45d05564960fd92a552092aea25","schema_version":"1.0","event_id":"sha256:c92a4e529e0a4d29aa984348bc24668a61a9e45d05564960fd92a552092aea25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZO63RF3HLMKNWCOVLM52643KWA","target":"graph","payload":{"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"},"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-18T04:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmA0RocB9sgtOkLkcmCSL9LYctX6CjMXOWhsFDkU9d7oBNU5SyCWl/sQjj0J0dwq6PJ82IWSxjBp/SZdJXV5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:13:56.526003Z"},"content_sha256":"56697e80808fa1a1138c245d5d758982bdb7ace4a3fea092759f95f8517d7b73","schema_version":"1.0","event_id":"sha256:56697e80808fa1a1138c245d5d758982bdb7ace4a3fea092759f95f8517d7b73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/bundle.json","state_url":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZO63RF3HLMKNWCOVLM52643KWA/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-28T15:13:56Z","links":{"resolver":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA","bundle":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/bundle.json","state":"https://pith.science/pith/ZO63RF3HLMKNWCOVLM52643KWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZO63RF3HLMKNWCOVLM52643KWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZO63RF3HLMKNWCOVLM52643KWA","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":"b45348b31ee93f059b4470e5235e77b2141e726804893f1b8abd3362765a99ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-30T09:38:47Z","title_canon_sha256":"3f0f37709c58870a8681f15fe07f22cae6bdda9909191305de7cc749d7c04ed0"},"schema_version":"1.0","source":{"id":"1011.6498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6498","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6498v1","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6498","created_at":"2026-05-18T04:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZO63RF3HLMKN","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZO63RF3HLMKNWCOV","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZO63RF3H","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:56697e80808fa1a1138c245d5d758982bdb7ace4a3fea092759f95f8517d7b73","target":"graph","created_at":"2026-05-18T04:34:26Z","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":"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","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-30T09:38:47Z","title":"Approximate Shortest Path through a Weighted Planar Subdivision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6498","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:c92a4e529e0a4d29aa984348bc24668a61a9e45d05564960fd92a552092aea25","target":"record","created_at":"2026-05-18T04:34:26Z","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":"b45348b31ee93f059b4470e5235e77b2141e726804893f1b8abd3362765a99ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-30T09:38:47Z","title_canon_sha256":"3f0f37709c58870a8681f15fe07f22cae6bdda9909191305de7cc749d7c04ed0"},"schema_version":"1.0","source":{"id":"1011.6498","kind":"arxiv","version":1}},"canonical_sha256":"cbbdb897675b14db09d55b3baf736ab0134f99e428ff57725b24451c014fabba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbbdb897675b14db09d55b3baf736ab0134f99e428ff57725b24451c014fabba","first_computed_at":"2026-05-18T04:34:26.783603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:26.783603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BuHzyLsWIUeQ3iaB4nLm/4o+SfMv9JRggAu2fIhjbLWv751VttrM77+erystwZuBGd/CYOL7BIU9li15MpDICg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:26.784150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.6498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c92a4e529e0a4d29aa984348bc24668a61a9e45d05564960fd92a552092aea25","sha256:56697e80808fa1a1138c245d5d758982bdb7ace4a3fea092759f95f8517d7b73"],"state_sha256":"06c5f3918a679b8305205993e3fccf037e87ca76c57828ac8b0492cfcde44510"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTCNHIqzSGNz4wfTqv2H5vWiBEH1LL7uEFtC5NQCZ4HFBkZmQdjeOoJNrLftyAK8PFc5w1ZxpXDySsOlTkt2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:13:56.528308Z","bundle_sha256":"82b7c959b2e9ec8427f2cdc04d586aa8015485c61d3d31e1700e6c5d867f5dee"}}