{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CMPAQQEXLGKRZI5FD3GMCEIFZD","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":"f4a702744710baedb8abbed84a94cdb64efe2f471cb573b72baf585acf62359c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-20T17:19:03Z","title_canon_sha256":"fcdba4733cfd36e4a00abd9006cfd216e4fe0f6dc84acec4043be6c99ebb020f"},"schema_version":"1.0","source":{"id":"2504.14683","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.14683","created_at":"2026-07-05T11:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"2504.14683v2","created_at":"2026-07-05T11:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.14683","created_at":"2026-07-05T11:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"CMPAQQEXLGKR","created_at":"2026-07-05T11:46:42Z"},{"alias_kind":"pith_short_16","alias_value":"CMPAQQEXLGKRZI5F","created_at":"2026-07-05T11:46:42Z"},{"alias_kind":"pith_short_8","alias_value":"CMPAQQEX","created_at":"2026-07-05T11:46:42Z"}],"graph_snapshots":[{"event_id":"sha256:fa960ebe4b0ce4b11533289e588acf26c12d590f9aae02efafaf3770d4032f04","target":"graph","created_at":"2026-07-05T11:46:42Z","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/2504.14683/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a seminal work, Chierichetti et al. introduced the $(t,k)$-fair clustering problem: Given a set of red points and a set of blue points in a metric space, a clustering is called fair if the number of red points in each cluster is at most $t$ times and at least $1/t$ times the number of blue points in that cluster. The goal is to compute a fair clustering with at most $k$ clusters that optimizes certain objective function. Considering this problem, they designed a polynomial-time $O(1)$- and $O(t)$-approximation for the $k$-center and the $k$-median objective, respectively. Recently, Carta et","authors_text":"Sayan Bandyapadhyay, Sina Bagheri Nezhad, Tianzhi Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-20T17:19:03Z","title":"Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.14683","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:17b86ae62d56c08a58579ded5c4a8ba50f72a109daf360ec25edc88c41afd8d5","target":"record","created_at":"2026-07-05T11:46:42Z","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":"f4a702744710baedb8abbed84a94cdb64efe2f471cb573b72baf585acf62359c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-20T17:19:03Z","title_canon_sha256":"fcdba4733cfd36e4a00abd9006cfd216e4fe0f6dc84acec4043be6c99ebb020f"},"schema_version":"1.0","source":{"id":"2504.14683","kind":"arxiv","version":2}},"canonical_sha256":"131e08409759951ca3a51eccc11105c8eb7c6169d40729006ab9cf3a00bbb6c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"131e08409759951ca3a51eccc11105c8eb7c6169d40729006ab9cf3a00bbb6c5","first_computed_at":"2026-07-05T11:46:42.385323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:46:42.385323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RcFnl9nqxk17rLHOMuLJ/Gc2vYt4+lCo1+pX7oS4xTCakw0b/DTGOOIvBzdBcZozbusf5TgI/GBPMdpz2+W1CA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:46:42.385794Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.14683","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17b86ae62d56c08a58579ded5c4a8ba50f72a109daf360ec25edc88c41afd8d5","sha256:fa960ebe4b0ce4b11533289e588acf26c12d590f9aae02efafaf3770d4032f04"],"state_sha256":"7d5967b8d40ab26fba9ecb90d9692503948e270278978d0bb3ec5c00b0a63404"}