{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NMEP246O2GWEW2SZSGVDNEQEJB","short_pith_number":"pith:NMEP246O","schema_version":"1.0","canonical_sha256":"6b08fd73ced1ac4b6a5991aa369204485030bf9958d6a0e6d899ee071c5eafdc","source":{"kind":"arxiv","id":"1807.08078","version":1},"attestation_state":"computed","paper":{"title":"Metric Violation Distance: Revisited and Extended","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Benjamin Raichel, Chenglin Fan, Gregory Van Buskirk","submitted_at":"2018-07-21T03:41:52Z","abstract_excerpt":"Metric data plays an important role in various settings such as metric-based indexing, clustering, classification, and approximation algorithms in general. Due to measurement error, noise, or an inability to completely gather all the data, a collection of distances may not satisfy the basic metric requirements, most notably the triangle inequality. Thus last year the authors introduced the Metric Violation Distance (MVD) problem, where the input is an undirected and positively-weighted complete graph, and the goal is to identify a minimum cardinality subset of edges whose weights can be modifi"},"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":"1807.08078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-21T03:41:52Z","cross_cats_sorted":[],"title_canon_sha256":"111694fcd7a3f1dcac9083544b99ff67eae4d0e43e033097191c6b02f7b41c21","abstract_canon_sha256":"827f23f5bd259fa7a8e90a1879f213a8bbde19e44bf944dbb0c7e99110feab75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:09.381257Z","signature_b64":"gRVceOQVAUKXg5J+8YjQAVBXkEgZxr4LjyOqki/Uvr8AXzHMD9/PfvUIwKkQ8IQS3DehJp0D9pA2zQYM9KdbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b08fd73ced1ac4b6a5991aa369204485030bf9958d6a0e6d899ee071c5eafdc","last_reissued_at":"2026-05-18T00:10:09.380572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:09.380572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Violation Distance: Revisited and Extended","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Benjamin Raichel, Chenglin Fan, Gregory Van Buskirk","submitted_at":"2018-07-21T03:41:52Z","abstract_excerpt":"Metric data plays an important role in various settings such as metric-based indexing, clustering, classification, and approximation algorithms in general. Due to measurement error, noise, or an inability to completely gather all the data, a collection of distances may not satisfy the basic metric requirements, most notably the triangle inequality. Thus last year the authors introduced the Metric Violation Distance (MVD) problem, where the input is an undirected and positively-weighted complete graph, and the goal is to identify a minimum cardinality subset of edges whose weights can be modifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08078","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":"1807.08078","created_at":"2026-05-18T00:10:09.380691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08078v1","created_at":"2026-05-18T00:10:09.380691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08078","created_at":"2026-05-18T00:10:09.380691+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMEP246O2GWE","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMEP246O2GWEW2SZ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMEP246O","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08411","citing_title":"Generalized Metric Repair on Graphs","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB","json":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB.json","graph_json":"https://pith.science/api/pith-number/NMEP246O2GWEW2SZSGVDNEQEJB/graph.json","events_json":"https://pith.science/api/pith-number/NMEP246O2GWEW2SZSGVDNEQEJB/events.json","paper":"https://pith.science/paper/NMEP246O"},"agent_actions":{"view_html":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB","download_json":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB.json","view_paper":"https://pith.science/paper/NMEP246O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08078&json=true","fetch_graph":"https://pith.science/api/pith-number/NMEP246O2GWEW2SZSGVDNEQEJB/graph.json","fetch_events":"https://pith.science/api/pith-number/NMEP246O2GWEW2SZSGVDNEQEJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB/action/storage_attestation","attest_author":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB/action/author_attestation","sign_citation":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB/action/citation_signature","submit_replication":"https://pith.science/pith/NMEP246O2GWEW2SZSGVDNEQEJB/action/replication_record"}},"created_at":"2026-05-18T00:10:09.380691+00:00","updated_at":"2026-05-18T00:10:09.380691+00:00"}