{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UV7XRPF4XOKFAMC6COGHDKVJ6N","short_pith_number":"pith:UV7XRPF4","schema_version":"1.0","canonical_sha256":"a57f78bcbcbb9450305e138c71aaa9f37913c94576498213f8d5e79bc8c8dfb5","source":{"kind":"arxiv","id":"1310.2386","version":1},"attestation_state":"computed","paper":{"title":"Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jaroslaw Byrka, Shanfei Li","submitted_at":"2013-10-09T08:09:20Z","abstract_excerpt":"The state of the art in approximation algorithms for facility location problems are complicated combinations of various techniques. In particular, the currently best 1.488-approximation algorithm for the uncapacitated facility location (UFL) problem by Shi Li is presented as a result of a non-trivial randomization of a certain scaling parameter in the LP-rounding algorithm by Chudak and Shmoys combined with a primal-dual algorithm of Jain et al. In this paper we first give a simple interpretation of this randomization process in terms of solving an aux- iliary (factor revealing) LP. Then, arme"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1310.2386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-09T08:09:20Z","cross_cats_sorted":[],"title_canon_sha256":"edf637b05da0de737a584042be13856caecfee769f4380c342099afeb89ce240","abstract_canon_sha256":"ecc239d26aab982676a8690e40ad83577b9f749d1c622e3e5f3cd30c3a246c06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:53.602851Z","signature_b64":"ZJyB/A0fCz+4fZDGLtARDTQqIkn1XivI+UTmyeSrD9QLavRvWiYekRD6I621DX0KP0QK1d/fHTQJVZd82JndCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a57f78bcbcbb9450305e138c71aaa9f37913c94576498213f8d5e79bc8c8dfb5","last_reissued_at":"2026-05-18T00:56:53.602279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:53.602279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jaroslaw Byrka, Shanfei Li","submitted_at":"2013-10-09T08:09:20Z","abstract_excerpt":"The state of the art in approximation algorithms for facility location problems are complicated combinations of various techniques. In particular, the currently best 1.488-approximation algorithm for the uncapacitated facility location (UFL) problem by Shi Li is presented as a result of a non-trivial randomization of a certain scaling parameter in the LP-rounding algorithm by Chudak and Shmoys combined with a primal-dual algorithm of Jain et al. In this paper we first give a simple interpretation of this randomization process in terms of solving an aux- iliary (factor revealing) LP. Then, arme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2386","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.2386","created_at":"2026-05-18T00:56:53.602409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2386v1","created_at":"2026-05-18T00:56:53.602409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2386","created_at":"2026-05-18T00:56:53.602409+00:00"},{"alias_kind":"pith_short_12","alias_value":"UV7XRPF4XOKF","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UV7XRPF4XOKFAMC6","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UV7XRPF4","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N","json":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N.json","graph_json":"https://pith.science/api/pith-number/UV7XRPF4XOKFAMC6COGHDKVJ6N/graph.json","events_json":"https://pith.science/api/pith-number/UV7XRPF4XOKFAMC6COGHDKVJ6N/events.json","paper":"https://pith.science/paper/UV7XRPF4"},"agent_actions":{"view_html":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N","download_json":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N.json","view_paper":"https://pith.science/paper/UV7XRPF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2386&json=true","fetch_graph":"https://pith.science/api/pith-number/UV7XRPF4XOKFAMC6COGHDKVJ6N/graph.json","fetch_events":"https://pith.science/api/pith-number/UV7XRPF4XOKFAMC6COGHDKVJ6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/action/storage_attestation","attest_author":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/action/author_attestation","sign_citation":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/action/citation_signature","submit_replication":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/action/replication_record"}},"created_at":"2026-05-18T00:56:53.602409+00:00","updated_at":"2026-05-18T00:56:53.602409+00:00"}