{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DN3IZ43SRYYCZEBT7PZC57GU35","short_pith_number":"pith:DN3IZ43S","schema_version":"1.0","canonical_sha256":"1b768cf3728e302c9033fbf22efcd4df7f1a7ee3807715c96964ee34332eb36c","source":{"kind":"arxiv","id":"1311.4665","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.GR"],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Pegah Kamousi, Stefanie Wuhrer, Sylvain Lazard","submitted_at":"2013-11-19T09:22:18Z","abstract_excerpt":"A standard way to approximate the distance between any two vertices $p$ and $q$ on a mesh is to compute, in the associated graph, a shortest path from $p$ to $q$ that goes through one of $k$ sources, which are well-chosen vertices. Precomputing the distance between each of the $k$ sources to all vertices of the graph yields an efficient computation of approximate distances between any two vertices. One standard method for choosing $k$ sources, which has been used extensively and successfully for isometry-invariant surface processing, is the so-called Farthest Point Sampling (FPS), which starts"},"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":"1311.4665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T09:22:18Z","cross_cats_sorted":["cs.CV","cs.GR"],"title_canon_sha256":"4d09c521f97b86568524bf7ac63161a4a65b585e3b2a25b18f6e7cd18bd73b51","abstract_canon_sha256":"e9d29695aa7eeece9fc269ddb32087c0f04bacedeab4e6f9a54944d69e021a6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:54.312971Z","signature_b64":"LQgURJGpe5w8SdH6/UVZLv3EPRVZ6hj1ibs3adMJIRF+0FIY3bkYyktE+K/1UeLbSK6LrY2S+ekaIBT0+getDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b768cf3728e302c9033fbf22efcd4df7f1a7ee3807715c96964ee34332eb36c","last_reissued_at":"2026-05-18T01:07:54.312559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:54.312559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.GR"],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Pegah Kamousi, Stefanie Wuhrer, Sylvain Lazard","submitted_at":"2013-11-19T09:22:18Z","abstract_excerpt":"A standard way to approximate the distance between any two vertices $p$ and $q$ on a mesh is to compute, in the associated graph, a shortest path from $p$ to $q$ that goes through one of $k$ sources, which are well-chosen vertices. Precomputing the distance between each of the $k$ sources to all vertices of the graph yields an efficient computation of approximate distances between any two vertices. One standard method for choosing $k$ sources, which has been used extensively and successfully for isometry-invariant surface processing, is the so-called Farthest Point Sampling (FPS), which starts"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4665","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":"1311.4665","created_at":"2026-05-18T01:07:54.312629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4665v1","created_at":"2026-05-18T01:07:54.312629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4665","created_at":"2026-05-18T01:07:54.312629+00:00"},{"alias_kind":"pith_short_12","alias_value":"DN3IZ43SRYYC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DN3IZ43SRYYCZEBT","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DN3IZ43S","created_at":"2026-05-18T12:27:43.054852+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/DN3IZ43SRYYCZEBT7PZC57GU35","json":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35.json","graph_json":"https://pith.science/api/pith-number/DN3IZ43SRYYCZEBT7PZC57GU35/graph.json","events_json":"https://pith.science/api/pith-number/DN3IZ43SRYYCZEBT7PZC57GU35/events.json","paper":"https://pith.science/paper/DN3IZ43S"},"agent_actions":{"view_html":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35","download_json":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35.json","view_paper":"https://pith.science/paper/DN3IZ43S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4665&json=true","fetch_graph":"https://pith.science/api/pith-number/DN3IZ43SRYYCZEBT7PZC57GU35/graph.json","fetch_events":"https://pith.science/api/pith-number/DN3IZ43SRYYCZEBT7PZC57GU35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/action/storage_attestation","attest_author":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/action/author_attestation","sign_citation":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/action/citation_signature","submit_replication":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/action/replication_record"}},"created_at":"2026-05-18T01:07:54.312629+00:00","updated_at":"2026-05-18T01:07:54.312629+00:00"}