{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O4WDVRQKD5E3UPHO7JGABBTJLJ","short_pith_number":"pith:O4WDVRQK","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"},"canonical_sha256":"772c3ac60a1f49ba3ceefa4c0086695a703b1a69a6f161401382997019295855","source":{"kind":"arxiv","id":"1706.07510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07510","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07510v1","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07510","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"O4WDVRQKD5E3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4WDVRQKD5E3UPHO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4WDVRQK","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O4WDVRQKD5E3UPHO7JGABBTJLJ","target":"record","payload":{"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"},"canonical_sha256":"772c3ac60a1f49ba3ceefa4c0086695a703b1a69a6f161401382997019295855","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"},"source_kind":"arxiv","source_id":"1706.07510","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-05-18T00:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6So1XmMAyXwZ5XMKsXLOthZZVGLXnR1aW1FKuklNevqKF8VDND6EdXf4Qd592NpW8EVMeijT3sUywq4RRRyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:48:30.247521Z"},"content_sha256":"eff1228987529146d67f32880d94bfb043de68c3e436e33317b4ae1d3f4d0914","schema_version":"1.0","event_id":"sha256:eff1228987529146d67f32880d94bfb043de68c3e436e33317b4ae1d3f4d0914"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O4WDVRQKD5E3UPHO7JGABBTJLJ","target":"graph","payload":{"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"},"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-05-18T00:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEIa/CQvkwjGJwwVSDRF9YVZ8wm+73bpMoJn5pI1QtRC+ym5PDg5akzzDiERxzYJNLcrX6PoVBfwM94ojYA1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:48:30.247879Z"},"content_sha256":"a20343f82c012a5b089e176478a0b4bf07b2743959aae1a639189550d6f5d76e","schema_version":"1.0","event_id":"sha256:a20343f82c012a5b089e176478a0b4bf07b2743959aae1a639189550d6f5d76e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/bundle.json","state_url":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/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-06-28T17:48:30Z","links":{"resolver":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ","bundle":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/bundle.json","state":"https://pith.science/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4WDVRQKD5E3UPHO7JGABBTJLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O4WDVRQKD5E3UPHO7JGABBTJLJ","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":"2e95d05a457461658d867a6b2418be58928d4aa0e08ec3a38f4be3850af7fcf9","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-22T22:22:04Z","title_canon_sha256":"0d5dd124db66c730859e9aaf8cc92038f8711c7e951e6613c356ed9288ae412f"},"schema_version":"1.0","source":{"id":"1706.07510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07510","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07510v1","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07510","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"O4WDVRQKD5E3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4WDVRQKD5E3UPHO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4WDVRQK","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:a20343f82c012a5b089e176478a0b4bf07b2743959aae1a639189550d6f5d76e","target":"graph","created_at":"2026-05-18T00:41:48Z","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"},"paper":{"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","authors_text":"Arya Mazumdar, Barna Saha","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-22T22:22:04Z","title":"Clustering with Noisy Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07510","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:eff1228987529146d67f32880d94bfb043de68c3e436e33317b4ae1d3f4d0914","target":"record","created_at":"2026-05-18T00:41:48Z","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":"2e95d05a457461658d867a6b2418be58928d4aa0e08ec3a38f4be3850af7fcf9","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-22T22:22:04Z","title_canon_sha256":"0d5dd124db66c730859e9aaf8cc92038f8711c7e951e6613c356ed9288ae412f"},"schema_version":"1.0","source":{"id":"1706.07510","kind":"arxiv","version":1}},"canonical_sha256":"772c3ac60a1f49ba3ceefa4c0086695a703b1a69a6f161401382997019295855","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"772c3ac60a1f49ba3ceefa4c0086695a703b1a69a6f161401382997019295855","first_computed_at":"2026-05-18T00:41:48.921407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:48.921407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0AshLtIUrfiFgc2Egw0iSP5Y7238O/TNPWBa3VZYirwWJ00qqFl3fo7CHrlVHBFEfWJck55SMevMam7m/8MZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:48.921771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eff1228987529146d67f32880d94bfb043de68c3e436e33317b4ae1d3f4d0914","sha256:a20343f82c012a5b089e176478a0b4bf07b2743959aae1a639189550d6f5d76e"],"state_sha256":"581ba0c313d9569c83821813bce86dd761e396b0180683372af52495d36d89d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccjs/x0emYxw3j8VdKzc6xQIJbh0mJLAkiTPF7YrXwdQp8s5bCIXzWnMZj0bbEjhTGlIMBzD3LNbPDL11PpDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:48:30.249986Z","bundle_sha256":"26a1aaf578821df28f65a62f43854ee1ce7b4df076f4c0cfc9018cea50315aa9"}}