{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DN3IZ43SRYYCZEBT7PZC57GU35","short_pith_number":"pith:DN3IZ43S","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"},"canonical_sha256":"1b768cf3728e302c9033fbf22efcd4df7f1a7ee3807715c96964ee34332eb36c","source":{"kind":"arxiv","id":"1311.4665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4665","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4665v1","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4665","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"DN3IZ43SRYYC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DN3IZ43SRYYCZEBT","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DN3IZ43S","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DN3IZ43SRYYCZEBT7PZC57GU35","target":"record","payload":{"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"},"canonical_sha256":"1b768cf3728e302c9033fbf22efcd4df7f1a7ee3807715c96964ee34332eb36c","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"},"source_kind":"arxiv","source_id":"1311.4665","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-18T01:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4ZdezO7xSNWow5SXPX/ygueRU8QtsQ1DJzvHWXeUAKgnZccQc/q0nJyk79kfgPWyhcvX8yxGYrdFXvqT/fuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:58:45.386657Z"},"content_sha256":"38a52c0874466317d6575d902a45f869fe57407b5cc79e7c8b603f39ff716524","schema_version":"1.0","event_id":"sha256:38a52c0874466317d6575d902a45f869fe57407b5cc79e7c8b603f39ff716524"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DN3IZ43SRYYCZEBT7PZC57GU35","target":"graph","payload":{"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"},"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:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jpafv2ctSDbcvkNIsnjA3zCSq6h1YGUNVndXjhNNM2pwlpgYRKwd6BHHssbgrsQ4UCIYn5Wt9Ne4/Aptq7ZvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:58:45.387337Z"},"content_sha256":"d682eb9ee71a79225cafc8ac1c43bc49390a6bb3badefab352924955dd5bd9b4","schema_version":"1.0","event_id":"sha256:d682eb9ee71a79225cafc8ac1c43bc49390a6bb3badefab352924955dd5bd9b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/bundle.json","state_url":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DN3IZ43SRYYCZEBT7PZC57GU35/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-27T22:58:45Z","links":{"resolver":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35","bundle":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/bundle.json","state":"https://pith.science/pith/DN3IZ43SRYYCZEBT7PZC57GU35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DN3IZ43SRYYCZEBT7PZC57GU35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DN3IZ43SRYYCZEBT7PZC57GU35","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":"e9d29695aa7eeece9fc269ddb32087c0f04bacedeab4e6f9a54944d69e021a6a","cross_cats_sorted":["cs.CV","cs.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T09:22:18Z","title_canon_sha256":"4d09c521f97b86568524bf7ac63161a4a65b585e3b2a25b18f6e7cd18bd73b51"},"schema_version":"1.0","source":{"id":"1311.4665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4665","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4665v1","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4665","created_at":"2026-05-18T01:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"DN3IZ43SRYYC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DN3IZ43SRYYCZEBT","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DN3IZ43S","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:d682eb9ee71a79225cafc8ac1c43bc49390a6bb3badefab352924955dd5bd9b4","target":"graph","created_at":"2026-05-18T01:07:54Z","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":"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","authors_text":"Anil Maheshwari, Pegah Kamousi, Stefanie Wuhrer, Sylvain Lazard","cross_cats":["cs.CV","cs.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T09:22:18Z","title":"Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4665","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:38a52c0874466317d6575d902a45f869fe57407b5cc79e7c8b603f39ff716524","target":"record","created_at":"2026-05-18T01:07:54Z","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":"e9d29695aa7eeece9fc269ddb32087c0f04bacedeab4e6f9a54944d69e021a6a","cross_cats_sorted":["cs.CV","cs.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T09:22:18Z","title_canon_sha256":"4d09c521f97b86568524bf7ac63161a4a65b585e3b2a25b18f6e7cd18bd73b51"},"schema_version":"1.0","source":{"id":"1311.4665","kind":"arxiv","version":1}},"canonical_sha256":"1b768cf3728e302c9033fbf22efcd4df7f1a7ee3807715c96964ee34332eb36c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b768cf3728e302c9033fbf22efcd4df7f1a7ee3807715c96964ee34332eb36c","first_computed_at":"2026-05-18T01:07:54.312559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:54.312559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LQgURJGpe5w8SdH6/UVZLv3EPRVZ6hj1ibs3adMJIRF+0FIY3bkYyktE+K/1UeLbSK6LrY2S+ekaIBT0+getDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:54.312971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38a52c0874466317d6575d902a45f869fe57407b5cc79e7c8b603f39ff716524","sha256:d682eb9ee71a79225cafc8ac1c43bc49390a6bb3badefab352924955dd5bd9b4"],"state_sha256":"e555b2ed7c987299b655e660f4935e95028c3f25eaa8d0e5baf023b3d1f2f380"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AN4KwCvARcji1nmey4fUBwZh0hms4WJIOH6iaO+OTnCP3c02cvWpakWUozROMRb/j9COVje6HOozu2gktbxtAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:58:45.390971Z","bundle_sha256":"2e57b86c589727c07d1162f1b13f85da9cdd32ad92955e8e81537fb0422f26d4"}}