{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ANXZYGVLALUQAZNIPME4TYZCWV","short_pith_number":"pith:ANXZYGVL","schema_version":"1.0","canonical_sha256":"036f9c1aab02e90065a87b09c9e322b57b8894ca96df1cefe36d57d5f4432e83","source":{"kind":"arxiv","id":"2409.04984","version":2},"attestation_state":"computed","paper":{"title":"FPT approximations for Capacitated Sum of Radii and Diameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ameet Gadekar, Arnold Filtser","submitted_at":"2024-09-08T05:46:21Z","abstract_excerpt":"The Capacitated Sum of Radii problem involves partitioning a set of points $P$, where each point $p\\in P$ has capacity $U_p$, into $k$ clusters that minimize the sum of cluster radii, such that the number of points in the cluster centered at point $p$ is at most $U_p$. We begin by showing that the problem is APX-hard, and that under gap-ETH there is no parameterized approximation scheme (FPT-AS). We then construct a $\\approx5.83$-approximation algorithm in FPT time (improving a previous $\\approx7.61$ approximation in FPT time). Our results also hold when the objective is a general monotone sym"},"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":"2409.04984","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-08T05:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"65f3ef6b9e20eda8eae11e9a310fbb4ec96eba023ab2594d28efbc408828f55f","abstract_canon_sha256":"315652f40b9d6dd6a7271fb91cbbae5b876cc0801d592a11096c75f8d7bb21d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:01.462205Z","signature_b64":"3044spp92rxE79KiblFn2EqcQT9P/AfO90S+GWZSdpde2A23cEDVEZfxit2c+JoDcY9MvNTlm+L7ZPLJbvO6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"036f9c1aab02e90065a87b09c9e322b57b8894ca96df1cefe36d57d5f4432e83","last_reissued_at":"2026-07-05T12:06:01.461572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:01.461572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPT approximations for Capacitated Sum of Radii and Diameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ameet Gadekar, Arnold Filtser","submitted_at":"2024-09-08T05:46:21Z","abstract_excerpt":"The Capacitated Sum of Radii problem involves partitioning a set of points $P$, where each point $p\\in P$ has capacity $U_p$, into $k$ clusters that minimize the sum of cluster radii, such that the number of points in the cluster centered at point $p$ is at most $U_p$. We begin by showing that the problem is APX-hard, and that under gap-ETH there is no parameterized approximation scheme (FPT-AS). We then construct a $\\approx5.83$-approximation algorithm in FPT time (improving a previous $\\approx7.61$ approximation in FPT time). Our results also hold when the objective is a general monotone sym"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04984","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/2409.04984/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.04984","created_at":"2026-07-05T12:06:01.461655+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04984v2","created_at":"2026-07-05T12:06:01.461655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04984","created_at":"2026-07-05T12:06:01.461655+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANXZYGVLALUQ","created_at":"2026-07-05T12:06:01.461655+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANXZYGVLALUQAZNI","created_at":"2026-07-05T12:06:01.461655+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANXZYGVL","created_at":"2026-07-05T12:06:01.461655+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.05476","citing_title":"FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06398","citing_title":"On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV","json":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV.json","graph_json":"https://pith.science/api/pith-number/ANXZYGVLALUQAZNIPME4TYZCWV/graph.json","events_json":"https://pith.science/api/pith-number/ANXZYGVLALUQAZNIPME4TYZCWV/events.json","paper":"https://pith.science/paper/ANXZYGVL"},"agent_actions":{"view_html":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV","download_json":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV.json","view_paper":"https://pith.science/paper/ANXZYGVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04984&json=true","fetch_graph":"https://pith.science/api/pith-number/ANXZYGVLALUQAZNIPME4TYZCWV/graph.json","fetch_events":"https://pith.science/api/pith-number/ANXZYGVLALUQAZNIPME4TYZCWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/action/storage_attestation","attest_author":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/action/author_attestation","sign_citation":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/action/citation_signature","submit_replication":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/action/replication_record"}},"created_at":"2026-07-05T12:06:01.461655+00:00","updated_at":"2026-07-05T12:06:01.461655+00:00"}