{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O4WDVRQKD5E3UPHO7JGABBTJLJ","short_pith_number":"pith:O4WDVRQK","schema_version":"1.0","canonical_sha256":"772c3ac60a1f49ba3ceefa4c0086695a703b1a69a6f161401382997019295855","source":{"kind":"arxiv","id":"1706.07510","version":1},"attestation_state":"computed","paper":{"title":"Clustering with Noisy Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Arya Mazumdar, Barna Saha","submitted_at":"2017-06-22T22:22:04Z","abstract_excerpt":"In this paper, we initiate a rigorous theoretical study of clustering with noisy queries (or a faulty oracle). Given a set of $n$ elements, our goal is to recover the true clustering by asking minimum number of pairwise queries to an oracle. Oracle can answer queries of the form : \"do elements $u$ and $v$ belong to the same cluster?\" -- the queries can be asked interactively (adaptive queries), or non-adaptively up-front, but its answer can be erroneous with probability $p$. In this paper, we provide the first information theoretic lower bound on the number of queries for clustering with noisy"},"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":"1706.07510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-22T22:22:04Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"0d5dd124db66c730859e9aaf8cc92038f8711c7e951e6613c356ed9288ae412f","abstract_canon_sha256":"2e95d05a457461658d867a6b2418be58928d4aa0e08ec3a38f4be3850af7fcf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:48.921771Z","signature_b64":"0AshLtIUrfiFgc2Egw0iSP5Y7238O/TNPWBa3VZYirwWJ00qqFl3fo7CHrlVHBFEfWJck55SMevMam7m/8MZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"772c3ac60a1f49ba3ceefa4c0086695a703b1a69a6f161401382997019295855","last_reissued_at":"2026-05-18T00:41:48.921407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:48.921407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering with Noisy Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Arya Mazumdar, Barna Saha","submitted_at":"2017-06-22T22:22:04Z","abstract_excerpt":"In this paper, we initiate a rigorous theoretical study of clustering with noisy queries (or a faulty oracle). Given a set of $n$ elements, our goal is to recover the true clustering by asking minimum number of pairwise queries to an oracle. Oracle can answer queries of the form : \"do elements $u$ and $v$ belong to the same cluster?\" -- the queries can be asked interactively (adaptive queries), or non-adaptively up-front, but its answer can be erroneous with probability $p$. In this paper, we provide the first information theoretic lower bound on the number of queries for clustering with noisy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07510","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":"1706.07510","created_at":"2026-05-18T00:41:48.921461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07510v1","created_at":"2026-05-18T00:41:48.921461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07510","created_at":"2026-05-18T00:41:48.921461+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4WDVRQKD5E3","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4WDVRQKD5E3UPHO","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4WDVRQK","created_at":"2026-05-18T12:31:34.259226+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/O4WDVRQKD5E3UPHO7JGABBTJLJ","json":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ.json","graph_json":"https://pith.science/api/pith-number/O4WDVRQKD5E3UPHO7JGABBTJLJ/graph.json","events_json":"https://pith.science/api/pith-number/O4WDVRQKD5E3UPHO7JGABBTJLJ/events.json","paper":"https://pith.science/paper/O4WDVRQK"},"agent_actions":{"view_html":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ","download_json":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ.json","view_paper":"https://pith.science/paper/O4WDVRQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07510&json=true","fetch_graph":"https://pith.science/api/pith-number/O4WDVRQKD5E3UPHO7JGABBTJLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/O4WDVRQKD5E3UPHO7JGABBTJLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/action/storage_attestation","attest_author":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/action/author_attestation","sign_citation":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/action/citation_signature","submit_replication":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/action/replication_record"}},"created_at":"2026-05-18T00:41:48.921461+00:00","updated_at":"2026-05-18T00:41:48.921461+00:00"}