{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BQLHJ5YUIQ6SQ7DILWSXSWDENX","short_pith_number":"pith:BQLHJ5YU","schema_version":"1.0","canonical_sha256":"0c1674f714443d287c685da57958646de7a2d66a26f9ca9fa127139baf262963","source":{"kind":"arxiv","id":"1807.07619","version":1},"attestation_state":"computed","paper":{"title":"Generalized Metric Repair on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna C. Gilbert, Rishi Sonthalia","submitted_at":"2018-07-19T19:34:28Z","abstract_excerpt":"Many modern data analysis algorithms either assume that or are considerably more efficient if the distances between the data points satisfy a metric. These algorithms include metric learning, clustering, and dimensionality reduction. Because real data sets are noisy, the similarity measures often fail to satisfy a metric. For this reason, Gilbert and Jain [11] and Fan, et al. [8] introduce the closely related problems of $\\textit{sparse metric repair}$ and $\\textit{metric violation distance}$. The goal of each problem is to repair as few distances as possible to ensure that the distances betwe"},"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.07619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T19:34:28Z","cross_cats_sorted":[],"title_canon_sha256":"251450cf920dd92e8b0b5a5ec1681322d082815d6faf5c08979f60bc110cb64c","abstract_canon_sha256":"1a0d964d01698cfdca02d4a78f0f1d60b7aea8c1355030939ec5ae2729669217"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.099588Z","signature_b64":"djp2l5+ravh2WsOFTp5oX5dyXPonziOea0pKxzPXYS0e2r+v32g3HWQUMS8gol7Xi2hLnDe/cOAgGBRkjYJuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c1674f714443d287c685da57958646de7a2d66a26f9ca9fa127139baf262963","last_reissued_at":"2026-05-18T00:10:16.098917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.098917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Metric Repair on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna C. Gilbert, Rishi Sonthalia","submitted_at":"2018-07-19T19:34:28Z","abstract_excerpt":"Many modern data analysis algorithms either assume that or are considerably more efficient if the distances between the data points satisfy a metric. These algorithms include metric learning, clustering, and dimensionality reduction. Because real data sets are noisy, the similarity measures often fail to satisfy a metric. For this reason, Gilbert and Jain [11] and Fan, et al. [8] introduce the closely related problems of $\\textit{sparse metric repair}$ and $\\textit{metric violation distance}$. The goal of each problem is to repair as few distances as possible to ensure that the distances betwe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07619","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.07619","created_at":"2026-05-18T00:10:16.099010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07619v1","created_at":"2026-05-18T00:10:16.099010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07619","created_at":"2026-05-18T00:10:16.099010+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQLHJ5YUIQ6S","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQLHJ5YUIQ6SQ7DI","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQLHJ5YU","created_at":"2026-05-18T12:32:16.446611+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":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX","json":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX.json","graph_json":"https://pith.science/api/pith-number/BQLHJ5YUIQ6SQ7DILWSXSWDENX/graph.json","events_json":"https://pith.science/api/pith-number/BQLHJ5YUIQ6SQ7DILWSXSWDENX/events.json","paper":"https://pith.science/paper/BQLHJ5YU"},"agent_actions":{"view_html":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX","download_json":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX.json","view_paper":"https://pith.science/paper/BQLHJ5YU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07619&json=true","fetch_graph":"https://pith.science/api/pith-number/BQLHJ5YUIQ6SQ7DILWSXSWDENX/graph.json","fetch_events":"https://pith.science/api/pith-number/BQLHJ5YUIQ6SQ7DILWSXSWDENX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX/action/storage_attestation","attest_author":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX/action/author_attestation","sign_citation":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX/action/citation_signature","submit_replication":"https://pith.science/pith/BQLHJ5YUIQ6SQ7DILWSXSWDENX/action/replication_record"}},"created_at":"2026-05-18T00:10:16.099010+00:00","updated_at":"2026-05-18T00:10:16.099010+00:00"}