{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GFLHIRI3R23ZZHWFZEQHDFTIPH","short_pith_number":"pith:GFLHIRI3","schema_version":"1.0","canonical_sha256":"315674451b8eb79c9ec5c92071966879e4fb2783fda23f2697eca9a1da730c3e","source":{"kind":"arxiv","id":"1901.08628","version":2},"attestation_state":"computed","paper":{"title":"Fair k-Center Clustering for Data Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Jamie Morgenstern, Matth\\\"aus Kleindessner, Pranjal Awasthi","submitted_at":"2019-01-24T20:05:57Z","abstract_excerpt":"In data summarization we want to choose $k$ prototypes in order to summarize a data set. We study a setting where the data set comprises several demographic groups and we are restricted to choose $k_i$ prototypes belonging to group $i$. A common approach to the problem without the fairness constraint is to optimize a centroid-based clustering objective such as $k$-center. A natural extension then is to incorporate the fairness constraint into the clustering problem. Existing algorithms for doing so run in time super-quadratic in the size of the data set, which is in contrast to the standard $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":"1901.08628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-24T20:05:57Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"a651a04ee626bb473136b0c5cd1b7568fd2bf59b91f9a48832bbd57f1671ab8d","abstract_canon_sha256":"80ea557f818e6f85b7aeafcf7dbdcc5e0ba6ddf2e44659ad0bb68379dc816bd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:29.101740Z","signature_b64":"W53CL1ICe3bYtyWJTQtwzJ6AvDuXctgYehVAUyYQWNLezpM7Qp3ucHRwDG1119mrJVVKWEtFcGoQqk2MRyheCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"315674451b8eb79c9ec5c92071966879e4fb2783fda23f2697eca9a1da730c3e","last_reissued_at":"2026-05-17T23:46:29.100879Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:29.100879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair k-Center Clustering for Data Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Jamie Morgenstern, Matth\\\"aus Kleindessner, Pranjal Awasthi","submitted_at":"2019-01-24T20:05:57Z","abstract_excerpt":"In data summarization we want to choose $k$ prototypes in order to summarize a data set. We study a setting where the data set comprises several demographic groups and we are restricted to choose $k_i$ prototypes belonging to group $i$. A common approach to the problem without the fairness constraint is to optimize a centroid-based clustering objective such as $k$-center. A natural extension then is to incorporate the fairness constraint into the clustering problem. Existing algorithms for doing so run in time super-quadratic in the size of the data set, which is in contrast to the standard $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08628","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":""},"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":"1901.08628","created_at":"2026-05-17T23:46:29.101029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08628v2","created_at":"2026-05-17T23:46:29.101029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08628","created_at":"2026-05-17T23:46:29.101029+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFLHIRI3R23Z","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFLHIRI3R23ZZHWF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFLHIRI3","created_at":"2026-05-18T12:33:18.533446+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/GFLHIRI3R23ZZHWFZEQHDFTIPH","json":"https://pith.science/pith/GFLHIRI3R23ZZHWFZEQHDFTIPH.json","graph_json":"https://pith.science/api/pith-number/GFLHIRI3R23ZZHWFZEQHDFTIPH/graph.json","events_json":"https://pith.science/api/pith-number/GFLHIRI3R23ZZHWFZEQHDFTIPH/events.json","paper":"https://pith.science/paper/GFLHIRI3"},"agent_actions":{"view_html":"https://pith.science/pith/GFLHIRI3R23ZZHWFZEQHDFTIPH","download_json":"https://pith.science/pith/GFLHIRI3R23ZZHWFZEQHDFTIPH.json","view_paper":"https://pith.science/paper/GFLHIRI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08628&json=true","fetch_graph":"https://pith.science/api/pith-number/GFLHIRI3R23ZZHWFZEQHDFTIPH/graph.json","fetch_events":"https://pith.science/api/pith-number/GFLHIRI3R23ZZHWFZEQHDFTIPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFLHIRI3R23ZZHWFZEQHDFTIPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFLHIRI3R23ZZHWFZEQHDFTIPH/action/storage_attestation","attest_author":"https://pith.science/pith/GFLHIRI3R23ZZHWFZEQHDFTIPH/action/author_attestation","sign_citation":"https://pith.science/pith/GFLHIRI3R23ZZHWFZEQHDFTIPH/action/citation_signature","submit_replication":"https://pith.science/pith/GFLHIRI3R23ZZHWFZEQHDFTIPH/action/replication_record"}},"created_at":"2026-05-17T23:46:29.101029+00:00","updated_at":"2026-05-17T23:46:29.101029+00:00"}