{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:44NX4K4ANOQQXWXOOHQ2PANDFZ","short_pith_number":"pith:44NX4K4A","canonical_record":{"source":{"id":"1712.06865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T11:04:48Z","cross_cats_sorted":[],"title_canon_sha256":"b7ef6e0d266b25255d4c7a7d540b81ed34c452daf09e0e3a167ab2297186689c","abstract_canon_sha256":"53b4bcaaed4751725bce0338afd91c2a3b0fb2264dffaf1dd3ad700b5d58e231"},"schema_version":"1.0"},"canonical_sha256":"e71b7e2b806ba10bdaee71e1a781a32e564c51a64f4238a4d6cd4e2301b7ba10","source":{"kind":"arxiv","id":"1712.06865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06865","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06865v1","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06865","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"44NX4K4ANOQQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"44NX4K4ANOQQXWXO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"44NX4K4A","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:44NX4K4ANOQQXWXOOHQ2PANDFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T11:04:48Z","cross_cats_sorted":[],"title_canon_sha256":"b7ef6e0d266b25255d4c7a7d540b81ed34c452daf09e0e3a167ab2297186689c","abstract_canon_sha256":"53b4bcaaed4751725bce0338afd91c2a3b0fb2264dffaf1dd3ad700b5d58e231"},"schema_version":"1.0"},"canonical_sha256":"e71b7e2b806ba10bdaee71e1a781a32e564c51a64f4238a4d6cd4e2301b7ba10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:40.141284Z","signature_b64":"t9r5YCefFWvFekH/MMrPxmLImphT6NNnh+MSnIUDYoPqkmw2uETWz6EZhsbLAyZlEeMruG480OwAat2AgOtbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e71b7e2b806ba10bdaee71e1a781a32e564c51a64f4238a4d6cd4e2301b7ba10","last_reissued_at":"2026-05-18T00:27:40.140549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:40.140549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06865","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:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04Yw1JMHRixxLqD4J8drlEIzWkDevfz+5em3lpv8zqSjtTFPo6u/JL2GMRpCGGRAorFbadH1sSu6OAxbT0vQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:57:04.781971Z"},"content_sha256":"100d9e3cf3f2cc57c80d917f43233ce628633f4ebaa21dfc163921ad651401e4","schema_version":"1.0","event_id":"sha256:100d9e3cf3f2cc57c80d917f43233ce628633f4ebaa21dfc163921ad651401e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:44NX4K4ANOQQXWXOOHQ2PANDFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Correlation Clustering Using Same-Cluster Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anup Bhattacharya, Nir Ailon, Ragesh Jaiswal","submitted_at":"2017-12-19T11:04:48Z","abstract_excerpt":"Ashtiani et al. (NIPS 2016) introduced a semi-supervised framework for clustering (SSAC) where a learner is allowed to make same-cluster queries. More specifically, in their model, there is a query oracle that answers queries of the form given any two vertices, do they belong to the same optimal cluster?. Ashtiani et al. showed the usefulness of such a query framework by giving a polynomial time algorithm for the k-means clustering problem where the input dataset satisfies some separation condition. Ailon et al. extended the above work to the approximation setting by giving an efficient (1+\\ep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06865","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:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7/l+R6ZkxAQXmsKSm1QxRahSMzEYlvy2Hu5nMTAiH/ai5/E5H6WL0jAptLcYlZ70iY3er9ZcR+b5y7BYP/gCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:57:04.782338Z"},"content_sha256":"0179f1d1fecdc7436461020a2bcfc98f724d476bb928102e226acaafac673f35","schema_version":"1.0","event_id":"sha256:0179f1d1fecdc7436461020a2bcfc98f724d476bb928102e226acaafac673f35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44NX4K4ANOQQXWXOOHQ2PANDFZ/bundle.json","state_url":"https://pith.science/pith/44NX4K4ANOQQXWXOOHQ2PANDFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44NX4K4ANOQQXWXOOHQ2PANDFZ/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-01T21:57:04Z","links":{"resolver":"https://pith.science/pith/44NX4K4ANOQQXWXOOHQ2PANDFZ","bundle":"https://pith.science/pith/44NX4K4ANOQQXWXOOHQ2PANDFZ/bundle.json","state":"https://pith.science/pith/44NX4K4ANOQQXWXOOHQ2PANDFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44NX4K4ANOQQXWXOOHQ2PANDFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:44NX4K4ANOQQXWXOOHQ2PANDFZ","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":"53b4bcaaed4751725bce0338afd91c2a3b0fb2264dffaf1dd3ad700b5d58e231","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T11:04:48Z","title_canon_sha256":"b7ef6e0d266b25255d4c7a7d540b81ed34c452daf09e0e3a167ab2297186689c"},"schema_version":"1.0","source":{"id":"1712.06865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06865","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06865v1","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06865","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"44NX4K4ANOQQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"44NX4K4ANOQQXWXO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"44NX4K4A","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:0179f1d1fecdc7436461020a2bcfc98f724d476bb928102e226acaafac673f35","target":"graph","created_at":"2026-05-18T00:27:40Z","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":"Ashtiani et al. (NIPS 2016) introduced a semi-supervised framework for clustering (SSAC) where a learner is allowed to make same-cluster queries. More specifically, in their model, there is a query oracle that answers queries of the form given any two vertices, do they belong to the same optimal cluster?. Ashtiani et al. showed the usefulness of such a query framework by giving a polynomial time algorithm for the k-means clustering problem where the input dataset satisfies some separation condition. Ailon et al. extended the above work to the approximation setting by giving an efficient (1+\\ep","authors_text":"Anup Bhattacharya, Nir Ailon, Ragesh Jaiswal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T11:04:48Z","title":"Approximate Correlation Clustering Using Same-Cluster Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06865","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:100d9e3cf3f2cc57c80d917f43233ce628633f4ebaa21dfc163921ad651401e4","target":"record","created_at":"2026-05-18T00:27:40Z","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":"53b4bcaaed4751725bce0338afd91c2a3b0fb2264dffaf1dd3ad700b5d58e231","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T11:04:48Z","title_canon_sha256":"b7ef6e0d266b25255d4c7a7d540b81ed34c452daf09e0e3a167ab2297186689c"},"schema_version":"1.0","source":{"id":"1712.06865","kind":"arxiv","version":1}},"canonical_sha256":"e71b7e2b806ba10bdaee71e1a781a32e564c51a64f4238a4d6cd4e2301b7ba10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e71b7e2b806ba10bdaee71e1a781a32e564c51a64f4238a4d6cd4e2301b7ba10","first_computed_at":"2026-05-18T00:27:40.140549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:40.140549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9r5YCefFWvFekH/MMrPxmLImphT6NNnh+MSnIUDYoPqkmw2uETWz6EZhsbLAyZlEeMruG480OwAat2AgOtbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:40.141284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:100d9e3cf3f2cc57c80d917f43233ce628633f4ebaa21dfc163921ad651401e4","sha256:0179f1d1fecdc7436461020a2bcfc98f724d476bb928102e226acaafac673f35"],"state_sha256":"775b3db2a515e2f99c38634fbf01169a9e139cf306bc4d0569332c21c4dfc9db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKT7QzDLMpb3/eM5WgeQWyF0M4MGyil919LeIWG3WGdit+9issdVk+2e99G9qDindlYkvm4cvEW8vthMq4XRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:57:04.784438Z","bundle_sha256":"584fa2c4fb97a64fd4bd8cb6de87b68f105790714dc8486d0bc42d4491d8283a"}}