{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ROZQHD4PG65NSA3ZOLL72O6S4G","short_pith_number":"pith:ROZQHD4P","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"},"canonical_sha256":"8bb3038f8f37bad9037972d7fd3bd2e18e1f6ae9a6a12d92eea42e4f8e691d47","source":{"kind":"arxiv","id":"1401.2874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2874","created_at":"2026-05-18T03:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2874v1","created_at":"2026-05-18T03:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2874","created_at":"2026-05-18T03:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"ROZQHD4PG65N","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"ROZQHD4PG65NSA3Z","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"ROZQHD4P","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ROZQHD4PG65NSA3ZOLL72O6S4G","target":"record","payload":{"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"},"canonical_sha256":"8bb3038f8f37bad9037972d7fd3bd2e18e1f6ae9a6a12d92eea42e4f8e691d47","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"},"source_kind":"arxiv","source_id":"1401.2874","source_version":1,"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-05-18T03:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hi/V49THejYrlMEMMGsNV7QLCWUe72uj9diZ9+nKuMBoH/yhhtZRz0gZHGg66cO2yfM7oGA+uUb0ENGJLTBmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:29:11.443642Z"},"content_sha256":"cd6b9b6bfa387f697e0b3d62bc7a4141499aa75819d74941066768121b610bd9","schema_version":"1.0","event_id":"sha256:cd6b9b6bfa387f697e0b3d62bc7a4141499aa75819d74941066768121b610bd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ROZQHD4PG65NSA3ZOLL72O6S4G","target":"graph","payload":{"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"},"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-05-18T03:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usCuH2VNyQWEAkY9dAwwnmezEY61KhcgLhhfnqz94xqmJaSWc1iGYqmcwMY5u+DcByPLqyCDrOvh7UdNM+EcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:29:11.444153Z"},"content_sha256":"0a7adcfc164f80b0473f5acafeb938ec95b97ea489f46111c30050d0e3adb3b3","schema_version":"1.0","event_id":"sha256:0a7adcfc164f80b0473f5acafeb938ec95b97ea489f46111c30050d0e3adb3b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/bundle.json","state_url":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/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-05-19T13:29:11Z","links":{"resolver":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G","bundle":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/bundle.json","state":"https://pith.science/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROZQHD4PG65NSA3ZOLL72O6S4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ROZQHD4PG65NSA3ZOLL72O6S4G","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":"f5c37b3027643081f34eadfbd6236c405040e94a449dcc65252cfd8d98e22f57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T15:37:02Z","title_canon_sha256":"6b43b43d56594f10c3eca229cb2922cf9c571a08d8493fa4e73aabf92ccaeb10"},"schema_version":"1.0","source":{"id":"1401.2874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2874","created_at":"2026-05-18T03:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2874v1","created_at":"2026-05-18T03:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2874","created_at":"2026-05-18T03:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"ROZQHD4PG65N","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"ROZQHD4PG65NSA3Z","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"ROZQHD4P","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:0a7adcfc164f80b0473f5acafeb938ec95b97ea489f46111c30050d0e3adb3b3","target":"graph","created_at":"2026-05-18T03:02:31Z","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"},"paper":{"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","authors_text":"Marek Cygan, Tomasz Kociumaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T15:37:02Z","title":"Constant Factor Approximation for Capacitated k-Center with Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2874","kind":"arxiv","version":1},"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:cd6b9b6bfa387f697e0b3d62bc7a4141499aa75819d74941066768121b610bd9","target":"record","created_at":"2026-05-18T03:02:31Z","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":"f5c37b3027643081f34eadfbd6236c405040e94a449dcc65252cfd8d98e22f57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-13T15:37:02Z","title_canon_sha256":"6b43b43d56594f10c3eca229cb2922cf9c571a08d8493fa4e73aabf92ccaeb10"},"schema_version":"1.0","source":{"id":"1401.2874","kind":"arxiv","version":1}},"canonical_sha256":"8bb3038f8f37bad9037972d7fd3bd2e18e1f6ae9a6a12d92eea42e4f8e691d47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bb3038f8f37bad9037972d7fd3bd2e18e1f6ae9a6a12d92eea42e4f8e691d47","first_computed_at":"2026-05-18T03:02:31.639973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:31.639973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbRmvZ/9HwRSxg7cJ/n+LTcznsbaB3u1t4JJFJMTlqaHHS8Bp/S9Po/DhyB4op+atvjugMRyvz+Sey2cHw+jBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:31.640819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd6b9b6bfa387f697e0b3d62bc7a4141499aa75819d74941066768121b610bd9","sha256:0a7adcfc164f80b0473f5acafeb938ec95b97ea489f46111c30050d0e3adb3b3"],"state_sha256":"1bacf75090ac731367f8195ae01c211685c2b90c47cb9255470b2664bd5b36f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/QbAQm8CQo+qMHA6GWFOMVcCLT76cYD/KtdrIO6xDerJEF8IErK8nAlFIh5U0sL2KgCRMmGMmGGLxkOeTG9sBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T13:29:11.446386Z","bundle_sha256":"96248280789b77319e6ff36c582810cad0df6dea8e0be37065b0648465e3ed1d"}}