{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FH6QYNSI3GCXA5ZCYXH2ZFT62D","short_pith_number":"pith:FH6QYNSI","schema_version":"1.0","canonical_sha256":"29fd0c3648d985707722c5cfac967ed0df070071c5d2815ee89b16e89e98e4c1","source":{"kind":"arxiv","id":"2310.15863","version":1},"attestation_state":"computed","paper":{"title":"Metric Clustering and MST with Strong and Weak Distance Oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chen Wang, MohammadHossein Bateni, Prathamesh Dharangutte, Rajesh Jayaram","submitted_at":"2023-10-24T14:22:29Z","abstract_excerpt":"We study optimization problems in a metric space $(\\mathcal{X},d)$ where we can compute distances in two ways: via a ''strong'' oracle that returns exact distances $d(x,y)$, and a ''weak'' oracle that returns distances $\\tilde{d}(x,y)$ which may be arbitrarily corrupted with some probability. This model captures the increasingly common trade-off between employing both an expensive similarity model (e.g. a large-scale embedding model), and a less accurate but cheaper model. Hence, the goal is to make as few queries to the strong oracle as possible. We consider both so-called ''point queries'', "},"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":"2310.15863","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-24T14:22:29Z","cross_cats_sorted":[],"title_canon_sha256":"b282d3cfad89aa0b11913ed6823f9c4afaaf1269e06c004e3f9759ba5614b11e","abstract_canon_sha256":"992ed9871aa05e62cce549856efc514e69a14520647addd3ad67cc181f828a57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:04:31.858109Z","signature_b64":"apiHQvE1IeGLp6CRNswqd2lDoVM3JUdqzqVRDPrTTxOjloTZHAPHHwMX1ePtC7lu6S2DXSB56T2eTUbw2bwyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29fd0c3648d985707722c5cfac967ed0df070071c5d2815ee89b16e89e98e4c1","last_reissued_at":"2026-07-05T07:04:31.857693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:04:31.857693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Clustering and MST with Strong and Weak Distance Oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chen Wang, MohammadHossein Bateni, Prathamesh Dharangutte, Rajesh Jayaram","submitted_at":"2023-10-24T14:22:29Z","abstract_excerpt":"We study optimization problems in a metric space $(\\mathcal{X},d)$ where we can compute distances in two ways: via a ''strong'' oracle that returns exact distances $d(x,y)$, and a ''weak'' oracle that returns distances $\\tilde{d}(x,y)$ which may be arbitrarily corrupted with some probability. This model captures the increasingly common trade-off between employing both an expensive similarity model (e.g. a large-scale embedding model), and a less accurate but cheaper model. Hence, the goal is to make as few queries to the strong oracle as possible. We consider both so-called ''point queries'', "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.15863","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.15863/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2310.15863","created_at":"2026-07-05T07:04:31.857753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.15863v1","created_at":"2026-07-05T07:04:31.857753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.15863","created_at":"2026-07-05T07:04:31.857753+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH6QYNSI3GCX","created_at":"2026-07-05T07:04:31.857753+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH6QYNSI3GCXA5ZC","created_at":"2026-07-05T07:04:31.857753+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH6QYNSI","created_at":"2026-07-05T07:04:31.857753+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/FH6QYNSI3GCXA5ZCYXH2ZFT62D","json":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D.json","graph_json":"https://pith.science/api/pith-number/FH6QYNSI3GCXA5ZCYXH2ZFT62D/graph.json","events_json":"https://pith.science/api/pith-number/FH6QYNSI3GCXA5ZCYXH2ZFT62D/events.json","paper":"https://pith.science/paper/FH6QYNSI"},"agent_actions":{"view_html":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D","download_json":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D.json","view_paper":"https://pith.science/paper/FH6QYNSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.15863&json=true","fetch_graph":"https://pith.science/api/pith-number/FH6QYNSI3GCXA5ZCYXH2ZFT62D/graph.json","fetch_events":"https://pith.science/api/pith-number/FH6QYNSI3GCXA5ZCYXH2ZFT62D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/action/storage_attestation","attest_author":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/action/author_attestation","sign_citation":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/action/citation_signature","submit_replication":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/action/replication_record"}},"created_at":"2026-07-05T07:04:31.857753+00:00","updated_at":"2026-07-05T07:04:31.857753+00:00"}