{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HOJX3A2VDIFJOPM7Q4V7AWFP5Q","short_pith_number":"pith:HOJX3A2V","schema_version":"1.0","canonical_sha256":"3b937d83551a0a973d9f872bf058afec3e7cade2671e78b7406db523fea7966b","source":{"kind":"arxiv","id":"1207.0271","version":3},"attestation_state":"computed","paper":{"title":"Approximating Soft-Capacitated Facility Location Problem With Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shuxin Cai, Wenguo Yang, Yaohua Tang","submitted_at":"2012-07-02T03:22:06Z","abstract_excerpt":"We first show that a better analysis of the algorithm for The Two-Sage Stochastic Facility Location Problem from Srinivasan \\cite{sri07} and the algorithm for The Robust Fault Tolerant Facility Location Problem from Byrka et al \\cite{bgs10} can render improved approximation factors of 2.206 and \\alpha+4 where \\alpha is the maximum number an adversary can close, respectively, and which are the best ratios so far.\n  We then present new models for the soft-capacitated facility location problem with uncertainty and design constant factor approximation algorithms to solve them. We devise the stocha"},"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":"1207.0271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-02T03:22:06Z","cross_cats_sorted":[],"title_canon_sha256":"60185c71a1b1d72130319795c11386c39236d37d8af2f4a20a77b43855095639","abstract_canon_sha256":"84020f4b0bbad7f73ecd0d80427f1d18c62bada2ceec68e781604110f578fd3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:08.818072Z","signature_b64":"ejAi1EAJSuFXawXuQpF8avcF5mW+06CQbWAvm8aXOcjRfzsNxhPEqRxM136HEtddqiMXW4tUrgJAXkOPkg8CAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b937d83551a0a973d9f872bf058afec3e7cade2671e78b7406db523fea7966b","last_reissued_at":"2026-05-18T03:26:08.817371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:08.817371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Soft-Capacitated Facility Location Problem With Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shuxin Cai, Wenguo Yang, Yaohua Tang","submitted_at":"2012-07-02T03:22:06Z","abstract_excerpt":"We first show that a better analysis of the algorithm for The Two-Sage Stochastic Facility Location Problem from Srinivasan \\cite{sri07} and the algorithm for The Robust Fault Tolerant Facility Location Problem from Byrka et al \\cite{bgs10} can render improved approximation factors of 2.206 and \\alpha+4 where \\alpha is the maximum number an adversary can close, respectively, and which are the best ratios so far.\n  We then present new models for the soft-capacitated facility location problem with uncertainty and design constant factor approximation algorithms to solve them. We devise the stocha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0271","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.0271","created_at":"2026-05-18T03:26:08.817481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0271v3","created_at":"2026-05-18T03:26:08.817481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0271","created_at":"2026-05-18T03:26:08.817481+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOJX3A2VDIFJ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOJX3A2VDIFJOPM7","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOJX3A2V","created_at":"2026-05-18T12:27:09.501522+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/HOJX3A2VDIFJOPM7Q4V7AWFP5Q","json":"https://pith.science/pith/HOJX3A2VDIFJOPM7Q4V7AWFP5Q.json","graph_json":"https://pith.science/api/pith-number/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/graph.json","events_json":"https://pith.science/api/pith-number/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/events.json","paper":"https://pith.science/paper/HOJX3A2V"},"agent_actions":{"view_html":"https://pith.science/pith/HOJX3A2VDIFJOPM7Q4V7AWFP5Q","download_json":"https://pith.science/pith/HOJX3A2VDIFJOPM7Q4V7AWFP5Q.json","view_paper":"https://pith.science/paper/HOJX3A2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0271&json=true","fetch_graph":"https://pith.science/api/pith-number/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/action/storage_attestation","attest_author":"https://pith.science/pith/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/action/author_attestation","sign_citation":"https://pith.science/pith/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/action/citation_signature","submit_replication":"https://pith.science/pith/HOJX3A2VDIFJOPM7Q4V7AWFP5Q/action/replication_record"}},"created_at":"2026-05-18T03:26:08.817481+00:00","updated_at":"2026-05-18T03:26:08.817481+00:00"}