{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5RVKK7KSX4A4WYTJ46CQZBJECH","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":"ab6b21918534bde2230c8e0854f35e46e914c5af3b57ce3c3412b3ebd3093ac0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-01-25T10:01:27Z","title_canon_sha256":"b32719e2efd20ae445bd7ab610d83ad95175e7d71efa4c8fcbb052bb8614cc32"},"schema_version":"1.0","source":{"id":"1901.08805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08805","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08805v1","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08805","created_at":"2026-05-17T23:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"5RVKK7KSX4A4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5RVKK7KSX4A4WYTJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5RVKK7KS","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:aa24217e6be56af2cd1e24914a8d8695c7d3b33c1cceb9c0f77b38c9d7203d01","target":"graph","created_at":"2026-05-17T23:55:33Z","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":"In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We introduce a different model where we assume that the computation of a single distance is an expensive operation and consequently, the goal is to minimize the number of such distance queries. This model is motivated by metric spaces that appear in the context of topological data analysis.\n  We consider two standard operations on metric spaces, namely the construction","authors_text":"Arnur Nigmetov, Michael Kerber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-01-25T10:01:27Z","title":"Metric Spaces with Expensive Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08805","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:9e4517c14eba07f5359b2a8f83337371566bbd384592a0080e7ecd0e1ab52c51","target":"record","created_at":"2026-05-17T23:55:33Z","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":"ab6b21918534bde2230c8e0854f35e46e914c5af3b57ce3c3412b3ebd3093ac0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-01-25T10:01:27Z","title_canon_sha256":"b32719e2efd20ae445bd7ab610d83ad95175e7d71efa4c8fcbb052bb8614cc32"},"schema_version":"1.0","source":{"id":"1901.08805","kind":"arxiv","version":1}},"canonical_sha256":"ec6aa57d52bf01cb6269e7850c852411e8e5c104b81bf4e0040a15eb6bf37dff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec6aa57d52bf01cb6269e7850c852411e8e5c104b81bf4e0040a15eb6bf37dff","first_computed_at":"2026-05-17T23:55:33.074020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:33.074020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VjVmoMGLyuSsd9+sTOvWgmBfd12snDE0tH7sGtk9UshNhdnmMOF6fdwR31DPH21VS1kzU8IN/yDh/PltoPFiDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:33.074630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e4517c14eba07f5359b2a8f83337371566bbd384592a0080e7ecd0e1ab52c51","sha256:aa24217e6be56af2cd1e24914a8d8695c7d3b33c1cceb9c0f77b38c9d7203d01"],"state_sha256":"af72742e613d3521f5ae17f1debfa35586c12ed466306b47f62e98fac35eaf93"}