{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IFVIXD3XLJSAYX3QWZ6IFHC32F","short_pith_number":"pith:IFVIXD3X","schema_version":"1.0","canonical_sha256":"416a8b8f775a640c5f70b67c829c5bd1684e4092f9343e9b896054a8543ff961","source":{"kind":"arxiv","id":"1502.05543","version":2},"attestation_state":"computed","paper":{"title":"Prioritized Metric Structures and Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Michael Elkin, Ofer Neiman","submitted_at":"2015-02-19T12:15:58Z","abstract_excerpt":"Metric data structures (distance oracles, distance labeling schemes, routing schemes) and low-distortion embeddings provide a powerful algorithmic methodology, which has been successfully applied for approximation algorithms \\cite{llr}, online algorithms \\cite{BBMN11}, distributed algorithms \\cite{KKMPT12} and for computing sparsifiers \\cite{ST04}. However, this methodology appears to have a limitation: the worst-case performance inherently depends on the cardinality of the metric, and one could not specify in advance which vertices/points should enjoy a better service (i.e., stretch/distortio"},"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":"1502.05543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T12:15:58Z","cross_cats_sorted":[],"title_canon_sha256":"7ea4d0ac8b948dc9d6378d6ff11a9e5e704296c0a22590128b31007d509b01d4","abstract_canon_sha256":"d3b27c577b5ce49dadd0e5f11d4a9bdfbd0d32e78598cae7e46a13ab4ec110db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:27.593390Z","signature_b64":"dWNUZfgrlxuEr8qJK0LgvMih8v9fPFdzBWJQFP6rbCgJeK032PM7qPJq6EgaHEQBdRh+piPczm4yIIHurDrCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416a8b8f775a640c5f70b67c829c5bd1684e4092f9343e9b896054a8543ff961","last_reissued_at":"2026-05-18T02:19:27.592734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:27.592734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prioritized Metric Structures and Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Michael Elkin, Ofer Neiman","submitted_at":"2015-02-19T12:15:58Z","abstract_excerpt":"Metric data structures (distance oracles, distance labeling schemes, routing schemes) and low-distortion embeddings provide a powerful algorithmic methodology, which has been successfully applied for approximation algorithms \\cite{llr}, online algorithms \\cite{BBMN11}, distributed algorithms \\cite{KKMPT12} and for computing sparsifiers \\cite{ST04}. However, this methodology appears to have a limitation: the worst-case performance inherently depends on the cardinality of the metric, and one could not specify in advance which vertices/points should enjoy a better service (i.e., stretch/distortio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05543","kind":"arxiv","version":2},"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":"1502.05543","created_at":"2026-05-18T02:19:27.592827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05543v2","created_at":"2026-05-18T02:19:27.592827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05543","created_at":"2026-05-18T02:19:27.592827+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFVIXD3XLJSA","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFVIXD3XLJSAYX3Q","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFVIXD3X","created_at":"2026-05-18T12:29:25.134429+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/IFVIXD3XLJSAYX3QWZ6IFHC32F","json":"https://pith.science/pith/IFVIXD3XLJSAYX3QWZ6IFHC32F.json","graph_json":"https://pith.science/api/pith-number/IFVIXD3XLJSAYX3QWZ6IFHC32F/graph.json","events_json":"https://pith.science/api/pith-number/IFVIXD3XLJSAYX3QWZ6IFHC32F/events.json","paper":"https://pith.science/paper/IFVIXD3X"},"agent_actions":{"view_html":"https://pith.science/pith/IFVIXD3XLJSAYX3QWZ6IFHC32F","download_json":"https://pith.science/pith/IFVIXD3XLJSAYX3QWZ6IFHC32F.json","view_paper":"https://pith.science/paper/IFVIXD3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05543&json=true","fetch_graph":"https://pith.science/api/pith-number/IFVIXD3XLJSAYX3QWZ6IFHC32F/graph.json","fetch_events":"https://pith.science/api/pith-number/IFVIXD3XLJSAYX3QWZ6IFHC32F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFVIXD3XLJSAYX3QWZ6IFHC32F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFVIXD3XLJSAYX3QWZ6IFHC32F/action/storage_attestation","attest_author":"https://pith.science/pith/IFVIXD3XLJSAYX3QWZ6IFHC32F/action/author_attestation","sign_citation":"https://pith.science/pith/IFVIXD3XLJSAYX3QWZ6IFHC32F/action/citation_signature","submit_replication":"https://pith.science/pith/IFVIXD3XLJSAYX3QWZ6IFHC32F/action/replication_record"}},"created_at":"2026-05-18T02:19:27.592827+00:00","updated_at":"2026-05-18T02:19:27.592827+00:00"}