{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SKYYDGJHUC2HM3SBFQMSIYRUYV","short_pith_number":"pith:SKYYDGJH","canonical_record":{"source":{"id":"1608.01721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:59:31Z","cross_cats_sorted":[],"title_canon_sha256":"7ce1683e86d5e740dcb04e1a3bb60358638bb281bef60886b6fe3ab0f74a4dbe","abstract_canon_sha256":"725ae8d0902b9072d3877bd684e4a463c84b1e41c2bae056dcf2e9683b1ea1f0"},"schema_version":"1.0"},"canonical_sha256":"92b1819927a0b4766e412c19246234c542612ce8f16267b201da9a187a1e0c5c","source":{"kind":"arxiv","id":"1608.01721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01721","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01721v1","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01721","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"SKYYDGJHUC2H","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SKYYDGJHUC2HM3SB","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SKYYDGJH","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SKYYDGJHUC2HM3SBFQMSIYRUYV","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:59:31Z","cross_cats_sorted":[],"title_canon_sha256":"7ce1683e86d5e740dcb04e1a3bb60358638bb281bef60886b6fe3ab0f74a4dbe","abstract_canon_sha256":"725ae8d0902b9072d3877bd684e4a463c84b1e41c2bae056dcf2e9683b1ea1f0"},"schema_version":"1.0"},"canonical_sha256":"92b1819927a0b4766e412c19246234c542612ce8f16267b201da9a187a1e0c5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:44.782787Z","signature_b64":"ZQCiJiLJFfY4wndLE4K3q3WJAJAsCtXNjk82bgVpcVU5/7F3dsr71rhRxwq2jXMIiCi/gHiIy1fH1skLQS8bBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b1819927a0b4766e412c19246234c542612ce8f16267b201da9a187a1e0c5c","last_reissued_at":"2026-05-18T01:09:44.782252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:44.782252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01721","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-18T01:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8hgtBW8EMCgrGSVMwV001MKXnKWXTw8/ZFsNAWyweAKoaR7IlvkWlNP1rRKnc9k+34T/54GHIgrf5wHgC2aDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:07:43.814151Z"},"content_sha256":"01b7ec57b512da99cc7155414a4d7caf30f081e21d95e480de8fa438be6fe047","schema_version":"1.0","event_id":"sha256:01b7ec57b512da99cc7155414a4d7caf30f081e21d95e480de8fa438be6fe047"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SKYYDGJHUC2HM3SBFQMSIYRUYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cristina G. Fernandes, Lehilton L. C. Pedrosa, Samuel P. de Paula","submitted_at":"2016-08-04T23:59:31Z","abstract_excerpt":"In the k-center problem, given a metric space V and a positive integer k, one wants to select k elements (centers) of V and an assignment from V to centers, minimizing the maximum distance between an element of V and its assigned center. One of the most general variants is the capacitated {\\alpha}-fault-tolerant k-center, where centers have a limit on the number of assigned elements, and, if {\\alpha} centers fail, there is a reassignment from V to non-faulty centers. In this paper, we present a new approach to tackle fault tolerance, by selecting and pre-opening a set of backup centers, then s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01721","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-18T01:09:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYd8oY3CaEBg/unJPNjdJ43YMsdJILH4zxIrobmHz/vUcU1wa5847ABPAuUohq6l+hnufub06cn5KMq8obGuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:07:43.814790Z"},"content_sha256":"db859c2a503d33da66838337eb779bbc60fb60cdf73bf1705d69c6cfb65b7915","schema_version":"1.0","event_id":"sha256:db859c2a503d33da66838337eb779bbc60fb60cdf73bf1705d69c6cfb65b7915"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKYYDGJHUC2HM3SBFQMSIYRUYV/bundle.json","state_url":"https://pith.science/pith/SKYYDGJHUC2HM3SBFQMSIYRUYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKYYDGJHUC2HM3SBFQMSIYRUYV/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-06-05T20:07:43Z","links":{"resolver":"https://pith.science/pith/SKYYDGJHUC2HM3SBFQMSIYRUYV","bundle":"https://pith.science/pith/SKYYDGJHUC2HM3SBFQMSIYRUYV/bundle.json","state":"https://pith.science/pith/SKYYDGJHUC2HM3SBFQMSIYRUYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKYYDGJHUC2HM3SBFQMSIYRUYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SKYYDGJHUC2HM3SBFQMSIYRUYV","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":"725ae8d0902b9072d3877bd684e4a463c84b1e41c2bae056dcf2e9683b1ea1f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:59:31Z","title_canon_sha256":"7ce1683e86d5e740dcb04e1a3bb60358638bb281bef60886b6fe3ab0f74a4dbe"},"schema_version":"1.0","source":{"id":"1608.01721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01721","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01721v1","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01721","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"SKYYDGJHUC2H","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SKYYDGJHUC2HM3SB","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SKYYDGJH","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:db859c2a503d33da66838337eb779bbc60fb60cdf73bf1705d69c6cfb65b7915","target":"graph","created_at":"2026-05-18T01:09:44Z","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":"In the k-center problem, given a metric space V and a positive integer k, one wants to select k elements (centers) of V and an assignment from V to centers, minimizing the maximum distance between an element of V and its assigned center. One of the most general variants is the capacitated {\\alpha}-fault-tolerant k-center, where centers have a limit on the number of assigned elements, and, if {\\alpha} centers fail, there is a reassignment from V to non-faulty centers. In this paper, we present a new approach to tackle fault tolerance, by selecting and pre-opening a set of backup centers, then s","authors_text":"Cristina G. Fernandes, Lehilton L. C. Pedrosa, Samuel P. de Paula","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:59:31Z","title":"Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01721","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:01b7ec57b512da99cc7155414a4d7caf30f081e21d95e480de8fa438be6fe047","target":"record","created_at":"2026-05-18T01:09:44Z","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":"725ae8d0902b9072d3877bd684e4a463c84b1e41c2bae056dcf2e9683b1ea1f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:59:31Z","title_canon_sha256":"7ce1683e86d5e740dcb04e1a3bb60358638bb281bef60886b6fe3ab0f74a4dbe"},"schema_version":"1.0","source":{"id":"1608.01721","kind":"arxiv","version":1}},"canonical_sha256":"92b1819927a0b4766e412c19246234c542612ce8f16267b201da9a187a1e0c5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b1819927a0b4766e412c19246234c542612ce8f16267b201da9a187a1e0c5c","first_computed_at":"2026-05-18T01:09:44.782252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:44.782252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQCiJiLJFfY4wndLE4K3q3WJAJAsCtXNjk82bgVpcVU5/7F3dsr71rhRxwq2jXMIiCi/gHiIy1fH1skLQS8bBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:44.782787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01b7ec57b512da99cc7155414a4d7caf30f081e21d95e480de8fa438be6fe047","sha256:db859c2a503d33da66838337eb779bbc60fb60cdf73bf1705d69c6cfb65b7915"],"state_sha256":"0c28dbe7bf5068f2e07864d21aec954a757ea2089fe7ed8f50ed4be7498a382a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpzxvPtLop1VlRGiwgvGddEmx5dgV31MFVlF4mUbZEQe4V0KZEi9cFRYkzfm17lvnbJDF1lqO8qZNtp2u8veCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:07:43.818385Z","bundle_sha256":"bc3ae3035b51a970a8aa399431c258c62b4a366726b2de1e34667378110dbb32"}}