{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CYPECO2UHQJZZQUU2JYLYKI7D6","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":"c13b50ee2f756188b2235cd002b10caa8324d5e1c021bf55f81c789af43ebf3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-13T15:02:57Z","title_canon_sha256":"3dab6b3757c1e706a93e967c25c4431c27ad9f9fb607ed2d7de063188abe2e88"},"schema_version":"1.0","source":{"id":"1803.04865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04865","created_at":"2026-05-18T00:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04865v1","created_at":"2026-05-18T00:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04865","created_at":"2026-05-18T00:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"CYPECO2UHQJZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CYPECO2UHQJZZQUU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CYPECO2U","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:eeac73339f93e8a035121048d7859f74d5aca780f82cdb9687a029ac1ac39a33","target":"graph","created_at":"2026-05-18T00:21:15Z","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 capacitated p-center problem requires to select p facilities from a set of candidates to service a number of customers, subject to facility capacity constraints, with the aim of minimizing the maximum distance between a customer and its associated facility. The problem is well known in the field of facility location, because of the many applications that it can model. In this paper, we solve it by means of search algorithms that iteratively seek the optimal distance by solving tailored subproblems. We present different mathematical formulations for the subproblems and improve them by means","authors_text":"Manuel Iori, Raphael Kramer, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-13T15:02:57Z","title":"Mathematical models and search algorithms for the capacitated $p$-center problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04865","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:f7ef68cdefc9eb3d6cc44d967e0a4e10aeab9682ea0d4c08bd2b1dca3b3334cc","target":"record","created_at":"2026-05-18T00:21:15Z","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":"c13b50ee2f756188b2235cd002b10caa8324d5e1c021bf55f81c789af43ebf3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-13T15:02:57Z","title_canon_sha256":"3dab6b3757c1e706a93e967c25c4431c27ad9f9fb607ed2d7de063188abe2e88"},"schema_version":"1.0","source":{"id":"1803.04865","kind":"arxiv","version":1}},"canonical_sha256":"161e413b543c139cc294d270bc291f1faaf727ca928e6832f77c0901b89a8a9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"161e413b543c139cc294d270bc291f1faaf727ca928e6832f77c0901b89a8a9d","first_computed_at":"2026-05-18T00:21:15.580528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:15.580528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m9kd0enL/mYJ05uaZg/n8/PKVncXaZvGO+420kFcMY4dPxZETDR6kADnZcw/npm3H/m+nIT0iTpZfpQi5M36AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:15.580900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7ef68cdefc9eb3d6cc44d967e0a4e10aeab9682ea0d4c08bd2b1dca3b3334cc","sha256:eeac73339f93e8a035121048d7859f74d5aca780f82cdb9687a029ac1ac39a33"],"state_sha256":"b676cbafe46d181185a0a097638b026ce3df6ea5e0f8887c10f40f01b386b3bf"}