{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FH6QYNSI3GCXA5ZCYXH2ZFT62D","short_pith_number":"pith:FH6QYNSI","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"},"canonical_sha256":"29fd0c3648d985707722c5cfac967ed0df070071c5d2815ee89b16e89e98e4c1","source":{"kind":"arxiv","id":"2310.15863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.15863","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2310.15863v1","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.15863","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"FH6QYNSI3GCX","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"FH6QYNSI3GCXA5ZC","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"FH6QYNSI","created_at":"2026-07-05T07:04:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FH6QYNSI3GCXA5ZCYXH2ZFT62D","target":"record","payload":{"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"},"canonical_sha256":"29fd0c3648d985707722c5cfac967ed0df070071c5d2815ee89b16e89e98e4c1","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"},"source_kind":"arxiv","source_id":"2310.15863","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rTBaC2C82sC17KW4oM1tr7onLHCcWtP/UFq4KmGnmpuj03u4nBWJ1UxebgezDgwEzeufOpbQrTpt3I6gATlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:05:40.552425Z"},"content_sha256":"def0c243cf9161562c23d65de5914d3e08627aa3ced9c797f1570934a5c34423","schema_version":"1.0","event_id":"sha256:def0c243cf9161562c23d65de5914d3e08627aa3ced9c797f1570934a5c34423"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FH6QYNSI3GCXA5ZCYXH2ZFT62D","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBUKn+46nZiVZW3XJtZCLuk7xO5sHfYVetmjU4nIkvzWSQkLyyr2CLVJGNW/oYvSKKynqnENBHaGMH1zDKCcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:05:40.553531Z"},"content_sha256":"56b4ea2d6a4260c0fcca131dd2c7e330f3b5925c17e77264d785cea491830f3b","schema_version":"1.0","event_id":"sha256:56b4ea2d6a4260c0fcca131dd2c7e330f3b5925c17e77264d785cea491830f3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/bundle.json","state_url":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T15:05:40Z","links":{"resolver":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D","bundle":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/bundle.json","state":"https://pith.science/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FH6QYNSI3GCXA5ZCYXH2ZFT62D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FH6QYNSI3GCXA5ZCYXH2ZFT62D","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":"992ed9871aa05e62cce549856efc514e69a14520647addd3ad67cc181f828a57","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-24T14:22:29Z","title_canon_sha256":"b282d3cfad89aa0b11913ed6823f9c4afaaf1269e06c004e3f9759ba5614b11e"},"schema_version":"1.0","source":{"id":"2310.15863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.15863","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2310.15863v1","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.15863","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"FH6QYNSI3GCX","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"FH6QYNSI3GCXA5ZC","created_at":"2026-07-05T07:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"FH6QYNSI","created_at":"2026-07-05T07:04:31Z"}],"graph_snapshots":[{"event_id":"sha256:56b4ea2d6a4260c0fcca131dd2c7e330f3b5925c17e77264d785cea491830f3b","target":"graph","created_at":"2026-07-05T07:04:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.15863/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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'', ","authors_text":"Chen Wang, MohammadHossein Bateni, Prathamesh Dharangutte, Rajesh Jayaram","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-24T14:22:29Z","title":"Metric Clustering and MST with Strong and Weak Distance Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.15863","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:def0c243cf9161562c23d65de5914d3e08627aa3ced9c797f1570934a5c34423","target":"record","created_at":"2026-07-05T07:04:31Z","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":"992ed9871aa05e62cce549856efc514e69a14520647addd3ad67cc181f828a57","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-24T14:22:29Z","title_canon_sha256":"b282d3cfad89aa0b11913ed6823f9c4afaaf1269e06c004e3f9759ba5614b11e"},"schema_version":"1.0","source":{"id":"2310.15863","kind":"arxiv","version":1}},"canonical_sha256":"29fd0c3648d985707722c5cfac967ed0df070071c5d2815ee89b16e89e98e4c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29fd0c3648d985707722c5cfac967ed0df070071c5d2815ee89b16e89e98e4c1","first_computed_at":"2026-07-05T07:04:31.857693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:04:31.857693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"apiHQvE1IeGLp6CRNswqd2lDoVM3JUdqzqVRDPrTTxOjloTZHAPHHwMX1ePtC7lu6S2DXSB56T2eTUbw2bwyCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:04:31.858109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.15863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:def0c243cf9161562c23d65de5914d3e08627aa3ced9c797f1570934a5c34423","sha256:56b4ea2d6a4260c0fcca131dd2c7e330f3b5925c17e77264d785cea491830f3b"],"state_sha256":"1533c97b97d0a4bf6a72d864332b23bc57e7cd22fedd266884e974d13df95b3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cObX+Z+IAD9Rq3hhW3kK9pD/KjEtEQdf2ME+KJvCKKRNLUgVnwtTz7KYZSkl2mwn1yeVLRKqdan/2rU0nQkbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T15:05:40.560926Z","bundle_sha256":"8620e698e04db5519a16d464e9616e8e677b583ec2d96762a2a5cfb4c61cfe0c"}}