{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UV7XRPF4XOKFAMC6COGHDKVJ6N","short_pith_number":"pith:UV7XRPF4","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"},"canonical_sha256":"a57f78bcbcbb9450305e138c71aaa9f37913c94576498213f8d5e79bc8c8dfb5","source":{"kind":"arxiv","id":"1310.2386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2386","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2386v1","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2386","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"pith_short_12","alias_value":"UV7XRPF4XOKF","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UV7XRPF4XOKFAMC6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UV7XRPF4","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UV7XRPF4XOKFAMC6COGHDKVJ6N","target":"record","payload":{"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"},"canonical_sha256":"a57f78bcbcbb9450305e138c71aaa9f37913c94576498213f8d5e79bc8c8dfb5","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"},"source_kind":"arxiv","source_id":"1310.2386","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:56:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ib8VCqMimjoT1IH3QQqi/mBLd6QQs++rua1wJdp4vKTQIg+1fGgJ3R3MiQ9R0KZkZRoEVTH/57sj1roNuh8cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:32:23.306079Z"},"content_sha256":"7822c055226c7d39ca53dd1782c32f4f8a6810cd0b60907330e4b465251abd69","schema_version":"1.0","event_id":"sha256:7822c055226c7d39ca53dd1782c32f4f8a6810cd0b60907330e4b465251abd69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UV7XRPF4XOKFAMC6COGHDKVJ6N","target":"graph","payload":{"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"},"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:56:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pej42inboZd9HSl9fpxRrBq15dGl9tnD4AHqAGs2Trr6hZck1Kyw9s5tWO8IKIprXhyvR1b37Hli+3ndNBMaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:32:23.306726Z"},"content_sha256":"a6e22cc51552cac2d6abcceceb4d2c041feb724f04efa0576540dc89ad94d940","schema_version":"1.0","event_id":"sha256:a6e22cc51552cac2d6abcceceb4d2c041feb724f04efa0576540dc89ad94d940"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/bundle.json","state_url":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/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-02T07:32:23Z","links":{"resolver":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N","bundle":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/bundle.json","state":"https://pith.science/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UV7XRPF4XOKFAMC6COGHDKVJ6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UV7XRPF4XOKFAMC6COGHDKVJ6N","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":"ecc239d26aab982676a8690e40ad83577b9f749d1c622e3e5f3cd30c3a246c06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-09T08:09:20Z","title_canon_sha256":"edf637b05da0de737a584042be13856caecfee769f4380c342099afeb89ce240"},"schema_version":"1.0","source":{"id":"1310.2386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2386","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2386v1","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2386","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"pith_short_12","alias_value":"UV7XRPF4XOKF","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UV7XRPF4XOKFAMC6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UV7XRPF4","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:a6e22cc51552cac2d6abcceceb4d2c041feb724f04efa0576540dc89ad94d940","target":"graph","created_at":"2026-05-18T00:56:53Z","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 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","authors_text":"Bartosz Rybicki, Jaroslaw Byrka, Shanfei Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-09T08:09:20Z","title":"Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2386","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:7822c055226c7d39ca53dd1782c32f4f8a6810cd0b60907330e4b465251abd69","target":"record","created_at":"2026-05-18T00:56:53Z","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":"ecc239d26aab982676a8690e40ad83577b9f749d1c622e3e5f3cd30c3a246c06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-09T08:09:20Z","title_canon_sha256":"edf637b05da0de737a584042be13856caecfee769f4380c342099afeb89ce240"},"schema_version":"1.0","source":{"id":"1310.2386","kind":"arxiv","version":1}},"canonical_sha256":"a57f78bcbcbb9450305e138c71aaa9f37913c94576498213f8d5e79bc8c8dfb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a57f78bcbcbb9450305e138c71aaa9f37913c94576498213f8d5e79bc8c8dfb5","first_computed_at":"2026-05-18T00:56:53.602279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:53.602279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZJyB/A0fCz+4fZDGLtARDTQqIkn1XivI+UTmyeSrD9QLavRvWiYekRD6I621DX0KP0QK1d/fHTQJVZd82JndCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:53.602851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7822c055226c7d39ca53dd1782c32f4f8a6810cd0b60907330e4b465251abd69","sha256:a6e22cc51552cac2d6abcceceb4d2c041feb724f04efa0576540dc89ad94d940"],"state_sha256":"7aa1ccd44ae8bb6d7e1b0430c8cc6be6ca7e9a85496915e527d666086a935daa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dE1/C6v9E1xOVceGOBDIT/2ruaxF/EzUU9VYQzMhKEJTyRdo08byWi+7Li4YCs33XE+2LXJj0bJ/YJ8ByVfeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:32:23.309887Z","bundle_sha256":"8b006a56e426b6f4cd4d0b2a9e04dc5aee04b6331f96463b16fbbfaf55569692"}}