{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:EJZJWLCWMGX5PQUDQM3TH6TQMC","short_pith_number":"pith:EJZJWLCW","canonical_record":{"source":{"id":"2107.00774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-01T23:49:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c5a76ee88036853a0627e8bed42977001565cd95097ffbfd319a4c05d1c9f28b","abstract_canon_sha256":"2fbaf733e646ace364dd1c7dab384a660aebbf74dfd9816305a98af1271e00f0"},"schema_version":"1.0"},"canonical_sha256":"22729b2c5661afd7c283833733fa7060919732658c22974c8ce4a6dcb154d922","source":{"kind":"arxiv","id":"2107.00774","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.00774","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"arxiv_version","alias_value":"2107.00774v2","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00774","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"pith_short_12","alias_value":"EJZJWLCWMGX5","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"pith_short_16","alias_value":"EJZJWLCWMGX5PQUD","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"pith_short_8","alias_value":"EJZJWLCW","created_at":"2026-07-05T02:58:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:EJZJWLCWMGX5PQUDQM3TH6TQMC","target":"record","payload":{"canonical_record":{"source":{"id":"2107.00774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-01T23:49:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c5a76ee88036853a0627e8bed42977001565cd95097ffbfd319a4c05d1c9f28b","abstract_canon_sha256":"2fbaf733e646ace364dd1c7dab384a660aebbf74dfd9816305a98af1271e00f0"},"schema_version":"1.0"},"canonical_sha256":"22729b2c5661afd7c283833733fa7060919732658c22974c8ce4a6dcb154d922","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:07.435021Z","signature_b64":"BhM0QRu/memS4Au0FFjhV0FKzzv7ixir9EMqD9lFWUvs7L7DBcfZNiVMhmZduSjjemFdjn7rLWLZb1F6EDUfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22729b2c5661afd7c283833733fa7060919732658c22974c8ce4a6dcb154d922","last_reissued_at":"2026-07-05T02:58:07.434673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:07.434673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.00774","source_version":2,"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-05T02:58:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MupWSufM18KdQwA6Zdltk7UryssNz/o4S4ktadXuykh+jPAtQhGYs9pWHFk/yDut+piKvlW8uCbgOcRHFOTQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:44:24.571979Z"},"content_sha256":"a85ee17038f08dbf03b00c8ffe4e261cdfd1fd9d081217b810698020ea9ba383","schema_version":"1.0","event_id":"sha256:a85ee17038f08dbf03b00c8ffe4e261cdfd1fd9d081217b810698020ea9ba383"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:EJZJWLCWMGX5PQUDQM3TH6TQMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Tight Approximation Algorithms for Explainable Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Hossein Esfandiari, Shyam Narayanan, Vahab Mirrokni","submitted_at":"2021-07-01T23:49:23Z","abstract_excerpt":"Recently, due to an increasing interest for transparency in artificial intelligence, several methods of explainable machine learning have been developed with the simultaneous goal of accuracy and interpretability by humans. In this paper, we study a recent framework of explainable clustering first suggested by Dasgupta et al.~\\cite{dasgupta2020explainable}. Specifically, we focus on the $k$-means and $k$-medians problems and provide nearly tight upper and lower bounds.\n  First, we provide an $O(\\log k \\log \\log k)$-approximation algorithm for explainable $k$-medians, improving on the best know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00774","kind":"arxiv","version":2},"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/2107.00774/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-05T02:58:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MedKGBX29Ekr2pLpZOd85HO9T8WI+Op290WDi/6zdH6lfXb2egA8LNzPf3eH5ZEYXcHZhdzGrppHFca7T7i+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:44:24.572486Z"},"content_sha256":"7b439dd1493dd989cee78b17005c599be1ac6c9ed22d430fc61a0760bb5b6260","schema_version":"1.0","event_id":"sha256:7b439dd1493dd989cee78b17005c599be1ac6c9ed22d430fc61a0760bb5b6260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJZJWLCWMGX5PQUDQM3TH6TQMC/bundle.json","state_url":"https://pith.science/pith/EJZJWLCWMGX5PQUDQM3TH6TQMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJZJWLCWMGX5PQUDQM3TH6TQMC/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-03T21:44:24Z","links":{"resolver":"https://pith.science/pith/EJZJWLCWMGX5PQUDQM3TH6TQMC","bundle":"https://pith.science/pith/EJZJWLCWMGX5PQUDQM3TH6TQMC/bundle.json","state":"https://pith.science/pith/EJZJWLCWMGX5PQUDQM3TH6TQMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJZJWLCWMGX5PQUDQM3TH6TQMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EJZJWLCWMGX5PQUDQM3TH6TQMC","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":"2fbaf733e646ace364dd1c7dab384a660aebbf74dfd9816305a98af1271e00f0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-01T23:49:23Z","title_canon_sha256":"c5a76ee88036853a0627e8bed42977001565cd95097ffbfd319a4c05d1c9f28b"},"schema_version":"1.0","source":{"id":"2107.00774","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.00774","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"arxiv_version","alias_value":"2107.00774v2","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00774","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"pith_short_12","alias_value":"EJZJWLCWMGX5","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"pith_short_16","alias_value":"EJZJWLCWMGX5PQUD","created_at":"2026-07-05T02:58:07Z"},{"alias_kind":"pith_short_8","alias_value":"EJZJWLCW","created_at":"2026-07-05T02:58:07Z"}],"graph_snapshots":[{"event_id":"sha256:7b439dd1493dd989cee78b17005c599be1ac6c9ed22d430fc61a0760bb5b6260","target":"graph","created_at":"2026-07-05T02:58:07Z","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/2107.00774/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, due to an increasing interest for transparency in artificial intelligence, several methods of explainable machine learning have been developed with the simultaneous goal of accuracy and interpretability by humans. In this paper, we study a recent framework of explainable clustering first suggested by Dasgupta et al.~\\cite{dasgupta2020explainable}. Specifically, we focus on the $k$-means and $k$-medians problems and provide nearly tight upper and lower bounds.\n  First, we provide an $O(\\log k \\log \\log k)$-approximation algorithm for explainable $k$-medians, improving on the best know","authors_text":"Hossein Esfandiari, Shyam Narayanan, Vahab Mirrokni","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-01T23:49:23Z","title":"Almost Tight Approximation Algorithms for Explainable Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00774","kind":"arxiv","version":2},"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:a85ee17038f08dbf03b00c8ffe4e261cdfd1fd9d081217b810698020ea9ba383","target":"record","created_at":"2026-07-05T02:58:07Z","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":"2fbaf733e646ace364dd1c7dab384a660aebbf74dfd9816305a98af1271e00f0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-01T23:49:23Z","title_canon_sha256":"c5a76ee88036853a0627e8bed42977001565cd95097ffbfd319a4c05d1c9f28b"},"schema_version":"1.0","source":{"id":"2107.00774","kind":"arxiv","version":2}},"canonical_sha256":"22729b2c5661afd7c283833733fa7060919732658c22974c8ce4a6dcb154d922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22729b2c5661afd7c283833733fa7060919732658c22974c8ce4a6dcb154d922","first_computed_at":"2026-07-05T02:58:07.434673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:58:07.434673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BhM0QRu/memS4Au0FFjhV0FKzzv7ixir9EMqD9lFWUvs7L7DBcfZNiVMhmZduSjjemFdjn7rLWLZb1F6EDUfDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:58:07.435021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.00774","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a85ee17038f08dbf03b00c8ffe4e261cdfd1fd9d081217b810698020ea9ba383","sha256:7b439dd1493dd989cee78b17005c599be1ac6c9ed22d430fc61a0760bb5b6260"],"state_sha256":"493cbef446158f8ff4f47420ff7262a0bf45d13fed9958cee0aa361f990754ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uC60tlouZzcd/+D/YLS+UgJTHT27BJI3oEiXaOk2lGtgLdDEE1lYS41f5Jr5jvwBx9VG6JiL3cVRkhEdxhJEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T21:44:24.577048Z","bundle_sha256":"de190cc228dd3e6455f3162e226f8d7631fd744574c563f7efc68f144a1cc8d5"}}