{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O5ELWWP72GBZTH2XRIP2NQEDP7","short_pith_number":"pith:O5ELWWP7","schema_version":"1.0","canonical_sha256":"7748bb59ffd183999f578a1fa6c0837ff4c96718b897f87160b7750d37ab44c0","source":{"kind":"arxiv","id":"1704.01862","version":3},"attestation_state":"computed","paper":{"title":"Approximate Clustering with Same-Cluster Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anup Bhattacharya, Nir Ailon, Ragesh Jaiswal","submitted_at":"2017-04-06T14:36:58Z","abstract_excerpt":"Ashtiani et al. proposed a Semi-Supervised Active Clustering framework (SSAC), where the learner is allowed to make adaptive queries to a domain expert. The queries are of the kind \"do two given points belong to the same optimal cluster?\" There are many clustering contexts where such same-cluster queries are feasible. Ashtiani et al. exhibited the power of such queries by showing that any instance of the $k$-means clustering problem, with additional margin assumption, can be solved efficiently if one is allowed $O(k^2 \\log{k} + k \\log{n})$ same-cluster queries. This is interesting since the $k"},"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":"1704.01862","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-06T14:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"857aa16ca3dc7f233e88d0042ad5b2fed5731fa0e2767d3584d20cae02712d26","abstract_canon_sha256":"7eac0776ee6d04ea8e5629e0c2a67f351b58a9519f9f29315bfa303cfec34c00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:43.701396Z","signature_b64":"thNIYIGdb0N2vhqEwCPqLJ34oXoLizRXPdfyL5mYUTQwtsWyt+lNsgPIuu2gUg+qQ7tth+viQFeTWq1Cp3L5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7748bb59ffd183999f578a1fa6c0837ff4c96718b897f87160b7750d37ab44c0","last_reissued_at":"2026-05-18T00:33:43.700757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:43.700757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Clustering with Same-Cluster Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anup Bhattacharya, Nir Ailon, Ragesh Jaiswal","submitted_at":"2017-04-06T14:36:58Z","abstract_excerpt":"Ashtiani et al. proposed a Semi-Supervised Active Clustering framework (SSAC), where the learner is allowed to make adaptive queries to a domain expert. The queries are of the kind \"do two given points belong to the same optimal cluster?\" There are many clustering contexts where such same-cluster queries are feasible. Ashtiani et al. exhibited the power of such queries by showing that any instance of the $k$-means clustering problem, with additional margin assumption, can be solved efficiently if one is allowed $O(k^2 \\log{k} + k \\log{n})$ same-cluster queries. This is interesting since the $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01862","kind":"arxiv","version":3},"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":"1704.01862","created_at":"2026-05-18T00:33:43.700838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01862v3","created_at":"2026-05-18T00:33:43.700838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01862","created_at":"2026-05-18T00:33:43.700838+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5ELWWP72GBZ","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5ELWWP72GBZTH2X","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5ELWWP7","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03346","citing_title":"Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch","ref_index":197,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17461","citing_title":"Optimal Phylogenetic Reconstruction from Sampled Quartets","ref_index":197,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7","json":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7.json","graph_json":"https://pith.science/api/pith-number/O5ELWWP72GBZTH2XRIP2NQEDP7/graph.json","events_json":"https://pith.science/api/pith-number/O5ELWWP72GBZTH2XRIP2NQEDP7/events.json","paper":"https://pith.science/paper/O5ELWWP7"},"agent_actions":{"view_html":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7","download_json":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7.json","view_paper":"https://pith.science/paper/O5ELWWP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01862&json=true","fetch_graph":"https://pith.science/api/pith-number/O5ELWWP72GBZTH2XRIP2NQEDP7/graph.json","fetch_events":"https://pith.science/api/pith-number/O5ELWWP72GBZTH2XRIP2NQEDP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7/action/storage_attestation","attest_author":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7/action/author_attestation","sign_citation":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7/action/citation_signature","submit_replication":"https://pith.science/pith/O5ELWWP72GBZTH2XRIP2NQEDP7/action/replication_record"}},"created_at":"2026-05-18T00:33:43.700838+00:00","updated_at":"2026-05-18T00:33:43.700838+00:00"}