{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ROZQHD4PG65NSA3ZOLL72O6S4G","short_pith_number":"pith:ROZQHD4P","schema_version":"1.0","canonical_sha256":"8bb3038f8f37bad9037972d7fd3bd2e18e1f6ae9a6a12d92eea42e4f8e691d47","source":{"kind":"arxiv","id":"1401.2874","version":1},"attestation_state":"computed","paper":{"title":"Constant Factor Approximation for Capacitated k-Center with Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marek Cygan, Tomasz Kociumaka","submitted_at":"2014-01-13T15:37:02Z","abstract_excerpt":"The $k$-center problem is a classic facility location problem, where given an edge-weighted graph $G = (V,E)$ one is to find a subset of $k$ vertices $S$, such that each vertex in $V$ is \"close\" to some vertex in $S$. The approximation status of this basic problem is well understood, as a simple 2-approximation algorithm is known to be tight. Consequently different extensions were studied.\n  In the capacitated version of the problem each vertex is assigned a capacity, which is a strict upper bound on the number of clients a facility can serve, when located at this vertex. A constant factor app"},"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":"1401.2874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T15:37:02Z","cross_cats_sorted":[],"title_canon_sha256":"6b43b43d56594f10c3eca229cb2922cf9c571a08d8493fa4e73aabf92ccaeb10","abstract_canon_sha256":"f5c37b3027643081f34eadfbd6236c405040e94a449dcc65252cfd8d98e22f57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:31.640819Z","signature_b64":"UbRmvZ/9HwRSxg7cJ/n+LTcznsbaB3u1t4JJFJMTlqaHHS8Bp/S9Po/DhyB4op+atvjugMRyvz+Sey2cHw+jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb3038f8f37bad9037972d7fd3bd2e18e1f6ae9a6a12d92eea42e4f8e691d47","last_reissued_at":"2026-05-18T03:02:31.639973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:31.639973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Factor Approximation for Capacitated k-Center with Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marek Cygan, Tomasz Kociumaka","submitted_at":"2014-01-13T15:37:02Z","abstract_excerpt":"The $k$-center problem is a classic facility location problem, where given an edge-weighted graph $G = (V,E)$ one is to find a subset of $k$ vertices $S$, such that each vertex in $V$ is \"close\" to some vertex in $S$. The approximation status of this basic problem is well understood, as a simple 2-approximation algorithm is known to be tight. Consequently different extensions were studied.\n  In the capacitated version of the problem each vertex is assigned a capacity, which is a strict upper bound on the number of clients a facility can serve, when located at this vertex. A constant factor app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2874","kind":"arxiv","version":1},"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":"1401.2874","created_at":"2026-05-18T03:02:31.640114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2874v1","created_at":"2026-05-18T03:02:31.640114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2874","created_at":"2026-05-18T03:02:31.640114+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROZQHD4PG65N","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROZQHD4PG65NSA3Z","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROZQHD4P","created_at":"2026-05-18T12:28:46.137349+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/ROZQHD4PG65NSA3ZOLL72O6S4G","json":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G.json","graph_json":"https://pith.science/api/pith-number/ROZQHD4PG65NSA3ZOLL72O6S4G/graph.json","events_json":"https://pith.science/api/pith-number/ROZQHD4PG65NSA3ZOLL72O6S4G/events.json","paper":"https://pith.science/paper/ROZQHD4P"},"agent_actions":{"view_html":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G","download_json":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G.json","view_paper":"https://pith.science/paper/ROZQHD4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2874&json=true","fetch_graph":"https://pith.science/api/pith-number/ROZQHD4PG65NSA3ZOLL72O6S4G/graph.json","fetch_events":"https://pith.science/api/pith-number/ROZQHD4PG65NSA3ZOLL72O6S4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/action/storage_attestation","attest_author":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/action/author_attestation","sign_citation":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/action/citation_signature","submit_replication":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/action/replication_record"}},"created_at":"2026-05-18T03:02:31.640114+00:00","updated_at":"2026-05-18T03:02:31.640114+00:00"}