{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N4NIE4AUQACGTG5LPSZT2MMHFH","short_pith_number":"pith:N4NIE4AU","canonical_record":{"source":{"id":"1702.07435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T01:28:11Z","cross_cats_sorted":[],"title_canon_sha256":"ef73a081b7a44c30d7feabb0a7dc5dc9685858b498d8b6e9596e0919178b5f25","abstract_canon_sha256":"7247da9c9baca284ce081c8ab66d81df03c4f453fb8b210c33db1fc2af8e0bc1"},"schema_version":"1.0"},"canonical_sha256":"6f1a8270148004699bab7cb33d318729dd076ceb98ffbce6661c3e24faf13f81","source":{"kind":"arxiv","id":"1702.07435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07435","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07435v1","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07435","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"N4NIE4AUQACG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N4NIE4AUQACGTG5L","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N4NIE4AU","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N4NIE4AUQACGTG5LPSZT2MMHFH","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T01:28:11Z","cross_cats_sorted":[],"title_canon_sha256":"ef73a081b7a44c30d7feabb0a7dc5dc9685858b498d8b6e9596e0919178b5f25","abstract_canon_sha256":"7247da9c9baca284ce081c8ab66d81df03c4f453fb8b210c33db1fc2af8e0bc1"},"schema_version":"1.0"},"canonical_sha256":"6f1a8270148004699bab7cb33d318729dd076ceb98ffbce6661c3e24faf13f81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.370616Z","signature_b64":"/iBYVjWtVtJk/QD6npCf+zNc9XKDQrboV2n/DctEyf17yOEn+17KnWzu8rJFabG1rjvTOq6+Sd798ZTYnBZsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1a8270148004699bab7cb33d318729dd076ceb98ffbce6661c3e24faf13f81","last_reissued_at":"2026-05-18T00:50:03.369886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.369886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07435","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-18T00:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JllFiyTzoWmdioPqtrZv/5ZEK3n2Wwg6FgTx6IKnk15Qx/THPySnhC8f55xVE4QxZUYAMdV+ioGlK13yI8q9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:22:45.663962Z"},"content_sha256":"620407616a7c3bb494c8d29653201763ac8ba1338f72cfd4ab7a22c99b643df2","schema_version":"1.0","event_id":"sha256:620407616a7c3bb494c8d29653201763ac8ba1338f72cfd4ab7a22c99b643df2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N4NIE4AUQACGTG5LPSZT2MMHFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacitated Center Problems with Two-Sided Bounds and Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hu Ding, Jian Li, Lingxiao Huang, Lunjia Hu","submitted_at":"2017-02-24T01:28:11Z","abstract_excerpt":"In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover, each center in $S$ should satisfy some capacity constraint, which could be an upper or lower bound on the number of vertices it can serve. Capacitated $k$-center problems with one-sided bounds (upper or lower) have been well studied in previous work, and a constant factor approximation was obtained.\n  We are the first to study the capacitated center problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07435","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-18T00:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36yxn/OS8Pl5M9JS6mnnjGIOEMmpTd3UbLTUiZORusYa3fqXFD6LzabgCEwTthpOi0PDuwLRp/FzClh1B3WTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:22:45.664312Z"},"content_sha256":"549aa347da641130e7190a0af026b7a77ca4e78d1343badbf50ff21093180901","schema_version":"1.0","event_id":"sha256:549aa347da641130e7190a0af026b7a77ca4e78d1343badbf50ff21093180901"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/bundle.json","state_url":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/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-07-04T13:22:45Z","links":{"resolver":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH","bundle":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/bundle.json","state":"https://pith.science/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4NIE4AUQACGTG5LPSZT2MMHFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N4NIE4AUQACGTG5LPSZT2MMHFH","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":"7247da9c9baca284ce081c8ab66d81df03c4f453fb8b210c33db1fc2af8e0bc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T01:28:11Z","title_canon_sha256":"ef73a081b7a44c30d7feabb0a7dc5dc9685858b498d8b6e9596e0919178b5f25"},"schema_version":"1.0","source":{"id":"1702.07435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07435","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07435v1","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07435","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"N4NIE4AUQACG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N4NIE4AUQACGTG5L","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N4NIE4AU","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:549aa347da641130e7190a0af026b7a77ca4e78d1343badbf50ff21093180901","target":"graph","created_at":"2026-05-18T00:50:03Z","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 recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover, each center in $S$ should satisfy some capacity constraint, which could be an upper or lower bound on the number of vertices it can serve. Capacitated $k$-center problems with one-sided bounds (upper or lower) have been well studied in previous work, and a constant factor approximation was obtained.\n  We are the first to study the capacitated center problem ","authors_text":"Hu Ding, Jian Li, Lingxiao Huang, Lunjia Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T01:28:11Z","title":"Capacitated Center Problems with Two-Sided Bounds and Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07435","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:620407616a7c3bb494c8d29653201763ac8ba1338f72cfd4ab7a22c99b643df2","target":"record","created_at":"2026-05-18T00:50:03Z","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":"7247da9c9baca284ce081c8ab66d81df03c4f453fb8b210c33db1fc2af8e0bc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T01:28:11Z","title_canon_sha256":"ef73a081b7a44c30d7feabb0a7dc5dc9685858b498d8b6e9596e0919178b5f25"},"schema_version":"1.0","source":{"id":"1702.07435","kind":"arxiv","version":1}},"canonical_sha256":"6f1a8270148004699bab7cb33d318729dd076ceb98ffbce6661c3e24faf13f81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f1a8270148004699bab7cb33d318729dd076ceb98ffbce6661c3e24faf13f81","first_computed_at":"2026-05-18T00:50:03.369886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:03.369886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/iBYVjWtVtJk/QD6npCf+zNc9XKDQrboV2n/DctEyf17yOEn+17KnWzu8rJFabG1rjvTOq6+Sd798ZTYnBZsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:03.370616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:620407616a7c3bb494c8d29653201763ac8ba1338f72cfd4ab7a22c99b643df2","sha256:549aa347da641130e7190a0af026b7a77ca4e78d1343badbf50ff21093180901"],"state_sha256":"3fe7dc0d925507e57e9dae8299e9721a3db3af879cd0acd99070817389aa4ae1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVAjaXg2EV0LGthI2Th1cdOhAf93Yj+Y0JQyQii0DYj1KE3HDoII3YsO8+yvFJPVfoKxyW+RVSODwIk6qL3sAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T13:22:45.667044Z","bundle_sha256":"d9df965e823c9a3b8db97960c5ec2a77c012fe7b3ad2d740b89b293cf6ccbae8"}}