{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ANXZYGVLALUQAZNIPME4TYZCWV","short_pith_number":"pith:ANXZYGVL","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"},"canonical_sha256":"036f9c1aab02e90065a87b09c9e322b57b8894ca96df1cefe36d57d5f4432e83","source":{"kind":"arxiv","id":"2409.04984","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.04984","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2409.04984v2","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04984","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"ANXZYGVLALUQ","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"ANXZYGVLALUQAZNI","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"ANXZYGVL","created_at":"2026-07-05T12:06:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ANXZYGVLALUQAZNIPME4TYZCWV","target":"record","payload":{"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"},"canonical_sha256":"036f9c1aab02e90065a87b09c9e322b57b8894ca96df1cefe36d57d5f4432e83","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"},"source_kind":"arxiv","source_id":"2409.04984","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-05T12:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FwVSUcDyRUyah/LgbwTkWOc42xt1Q1y3riv4FjazUIxyS8yDp3+vAkuK6Nxi6qz0KDqjIcRuantNRAErx4IdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T11:07:12.561784Z"},"content_sha256":"c6513c2e000171707df5236c69bafbff4881ea62704751f7b61fa0181c1e4ee7","schema_version":"1.0","event_id":"sha256:c6513c2e000171707df5236c69bafbff4881ea62704751f7b61fa0181c1e4ee7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ANXZYGVLALUQAZNIPME4TYZCWV","target":"graph","payload":{"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"},"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-05T12:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jk7pdEC7FZTlym+HNKdtx1gfGdqlrPDOecrCTt/tGbZwR9rE87SPb1uVJjZiMXO5qpmkjxlb9C8zIJM7DloBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T11:07:12.562289Z"},"content_sha256":"320d9fc22092eb00318ad0f1fa8186d493edb3b4055e0565db142a08cf8a99fe","schema_version":"1.0","event_id":"sha256:320d9fc22092eb00318ad0f1fa8186d493edb3b4055e0565db142a08cf8a99fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/bundle.json","state_url":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANXZYGVLALUQAZNIPME4TYZCWV/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-18T11:07:12Z","links":{"resolver":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV","bundle":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/bundle.json","state":"https://pith.science/pith/ANXZYGVLALUQAZNIPME4TYZCWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANXZYGVLALUQAZNIPME4TYZCWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ANXZYGVLALUQAZNIPME4TYZCWV","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":"315652f40b9d6dd6a7271fb91cbbae5b876cc0801d592a11096c75f8d7bb21d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-08T05:46:21Z","title_canon_sha256":"65f3ef6b9e20eda8eae11e9a310fbb4ec96eba023ab2594d28efbc408828f55f"},"schema_version":"1.0","source":{"id":"2409.04984","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.04984","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2409.04984v2","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04984","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"ANXZYGVLALUQ","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"ANXZYGVLALUQAZNI","created_at":"2026-07-05T12:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"ANXZYGVL","created_at":"2026-07-05T12:06:01Z"}],"graph_snapshots":[{"event_id":"sha256:320d9fc22092eb00318ad0f1fa8186d493edb3b4055e0565db142a08cf8a99fe","target":"graph","created_at":"2026-07-05T12:06:01Z","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/2409.04984/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ameet Gadekar, Arnold Filtser","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-08T05:46:21Z","title":"FPT approximations for Capacitated Sum of Radii and Diameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04984","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:c6513c2e000171707df5236c69bafbff4881ea62704751f7b61fa0181c1e4ee7","target":"record","created_at":"2026-07-05T12:06:01Z","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":"315652f40b9d6dd6a7271fb91cbbae5b876cc0801d592a11096c75f8d7bb21d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-08T05:46:21Z","title_canon_sha256":"65f3ef6b9e20eda8eae11e9a310fbb4ec96eba023ab2594d28efbc408828f55f"},"schema_version":"1.0","source":{"id":"2409.04984","kind":"arxiv","version":2}},"canonical_sha256":"036f9c1aab02e90065a87b09c9e322b57b8894ca96df1cefe36d57d5f4432e83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"036f9c1aab02e90065a87b09c9e322b57b8894ca96df1cefe36d57d5f4432e83","first_computed_at":"2026-07-05T12:06:01.461572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:06:01.461572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3044spp92rxE79KiblFn2EqcQT9P/AfO90S+GWZSdpde2A23cEDVEZfxit2c+JoDcY9MvNTlm+L7ZPLJbvO6CA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:06:01.462205Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.04984","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6513c2e000171707df5236c69bafbff4881ea62704751f7b61fa0181c1e4ee7","sha256:320d9fc22092eb00318ad0f1fa8186d493edb3b4055e0565db142a08cf8a99fe"],"state_sha256":"2903f5986139f2b51dc0783e621495308811a8fee9ac5f9ae89eb1df883a8117"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wyrugOuG50qrO0LK92jtFL6bKi/dUbtQthsB9YxhLaSvTb5jkKlAkjV4sehZQzWZeRioeSAynY+U0TL1j5HCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T11:07:12.568876Z","bundle_sha256":"6f452c183ac98724ef6f4d652f8d06581968fd09f5960d960c21d894a882dc8f"}}