{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VKOTMGIDO4BL2EOMMIGDH57H6Z","short_pith_number":"pith:VKOTMGID","canonical_record":{"source":{"id":"1312.6550","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T14:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"373a730d438fbaa388d54f0b1ad3e303b19ee6c6c5078a4af388bb6020941554","abstract_canon_sha256":"b3eaf1669545118439c3b79612e1c5e0715f878177374dd7e80fb9059fe65574"},"schema_version":"1.0"},"canonical_sha256":"aa9d3619037702bd11cc620c33f7e7f648ac0c82f8a88956f5b42c307b1f0bd2","source":{"kind":"arxiv","id":"1312.6550","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6550","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6550v3","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6550","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"VKOTMGIDO4BL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VKOTMGIDO4BL2EOM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VKOTMGID","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VKOTMGIDO4BL2EOMMIGDH57H6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6550","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T14:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"373a730d438fbaa388d54f0b1ad3e303b19ee6c6c5078a4af388bb6020941554","abstract_canon_sha256":"b3eaf1669545118439c3b79612e1c5e0715f878177374dd7e80fb9059fe65574"},"schema_version":"1.0"},"canonical_sha256":"aa9d3619037702bd11cc620c33f7e7f648ac0c82f8a88956f5b42c307b1f0bd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:59.126124Z","signature_b64":"livxJNZX9XPLT8xMJISwzXhF5GYpVaghIFuLwQVfR/y3L74FqK63IPVHaMjEWmNlnzKjoALz0w6O3E7l87DABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa9d3619037702bd11cc620c33f7e7f648ac0c82f8a88956f5b42c307b1f0bd2","last_reissued_at":"2026-05-18T00:45:59.125643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:59.125643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6550","source_version":3,"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:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKIXJREyzv2qQnXOrmJ9SNW0RpJ5sQkBEFs89qEOBj/crpZRas75RtkYd9ByrvxFSh8GZpWh1Pa83K+esWbuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T14:59:20.817998Z"},"content_sha256":"32b597b25a8464c15db0829f4351937ce9f952caac5638d478429f169d9fbaaf","schema_version":"1.0","event_id":"sha256:32b597b25a8464c15db0829f4351937ce9f952caac5638d478429f169d9fbaaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VKOTMGIDO4BL2EOMMIGDH57H6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bi-Factor Approximation Algorithms for Hard Capacitated $k$-Median Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jaros{\\l}aw Byrka, Joachim Spoerhase, Krzysztof Fleszar","submitted_at":"2013-12-23T14:03:29Z","abstract_excerpt":"The $k$-Facility Location problem is a generalization of the classical problems $k$-Median and Facility Location. The goal is to select a subset of at most $k$ facilities that minimizes the total cost of opened facilities and established connections between clients and opened facilities. We consider the hard-capacitated version of the problem, where a single facility may only serve a limited number of clients and creating multiple copies of a facility is not allowed. We construct approximation algorithms slightly violating the capacities based on rounding a fractional solution to the standard "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6550","kind":"arxiv","version":3},"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:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFvcWRMDx6RwiPEDKZvL6U5NonYF5jwEo0jCQ0TX7UuttUe+qtisKEHqKEUaaHEs1kHX1TxP/0uPJ7oszXwMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T14:59:20.818346Z"},"content_sha256":"5b83ae9eb673d9c4e6924815c42530f16ab239b923bbf49ac330920976e8ddab","schema_version":"1.0","event_id":"sha256:5b83ae9eb673d9c4e6924815c42530f16ab239b923bbf49ac330920976e8ddab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKOTMGIDO4BL2EOMMIGDH57H6Z/bundle.json","state_url":"https://pith.science/pith/VKOTMGIDO4BL2EOMMIGDH57H6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKOTMGIDO4BL2EOMMIGDH57H6Z/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-25T14:59:20Z","links":{"resolver":"https://pith.science/pith/VKOTMGIDO4BL2EOMMIGDH57H6Z","bundle":"https://pith.science/pith/VKOTMGIDO4BL2EOMMIGDH57H6Z/bundle.json","state":"https://pith.science/pith/VKOTMGIDO4BL2EOMMIGDH57H6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKOTMGIDO4BL2EOMMIGDH57H6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VKOTMGIDO4BL2EOMMIGDH57H6Z","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":"b3eaf1669545118439c3b79612e1c5e0715f878177374dd7e80fb9059fe65574","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T14:03:29Z","title_canon_sha256":"373a730d438fbaa388d54f0b1ad3e303b19ee6c6c5078a4af388bb6020941554"},"schema_version":"1.0","source":{"id":"1312.6550","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6550","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6550v3","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6550","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"VKOTMGIDO4BL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VKOTMGIDO4BL2EOM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VKOTMGID","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:5b83ae9eb673d9c4e6924815c42530f16ab239b923bbf49ac330920976e8ddab","target":"graph","created_at":"2026-05-18T00:45:59Z","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$-Facility Location problem is a generalization of the classical problems $k$-Median and Facility Location. The goal is to select a subset of at most $k$ facilities that minimizes the total cost of opened facilities and established connections between clients and opened facilities. We consider the hard-capacitated version of the problem, where a single facility may only serve a limited number of clients and creating multiple copies of a facility is not allowed. We construct approximation algorithms slightly violating the capacities based on rounding a fractional solution to the standard ","authors_text":"Bartosz Rybicki, Jaros{\\l}aw Byrka, Joachim Spoerhase, Krzysztof Fleszar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T14:03:29Z","title":"Bi-Factor Approximation Algorithms for Hard Capacitated $k$-Median Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6550","kind":"arxiv","version":3},"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:32b597b25a8464c15db0829f4351937ce9f952caac5638d478429f169d9fbaaf","target":"record","created_at":"2026-05-18T00:45:59Z","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":"b3eaf1669545118439c3b79612e1c5e0715f878177374dd7e80fb9059fe65574","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T14:03:29Z","title_canon_sha256":"373a730d438fbaa388d54f0b1ad3e303b19ee6c6c5078a4af388bb6020941554"},"schema_version":"1.0","source":{"id":"1312.6550","kind":"arxiv","version":3}},"canonical_sha256":"aa9d3619037702bd11cc620c33f7e7f648ac0c82f8a88956f5b42c307b1f0bd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa9d3619037702bd11cc620c33f7e7f648ac0c82f8a88956f5b42c307b1f0bd2","first_computed_at":"2026-05-18T00:45:59.125643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:59.125643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"livxJNZX9XPLT8xMJISwzXhF5GYpVaghIFuLwQVfR/y3L74FqK63IPVHaMjEWmNlnzKjoALz0w6O3E7l87DABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:59.126124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6550","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32b597b25a8464c15db0829f4351937ce9f952caac5638d478429f169d9fbaaf","sha256:5b83ae9eb673d9c4e6924815c42530f16ab239b923bbf49ac330920976e8ddab"],"state_sha256":"ff75a4bc64b0645d6c6a6fb706939eaa38ae4b3347c0bc9e0470574372a8ebab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDRcXCo3Q75ixFdgNp3CqWKIJpPphCXzL8oboJXYvzIwiM7Sfxtm8RRpbhVTHOh+OwSzYjrQjhQyN8CklZDiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T14:59:20.820235Z","bundle_sha256":"bb87bb6a7af69a17a236d89f33e1c262042eac7d42e73b8c731bfb1231867120"}}