{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:E6AD4QXM3SAHSEF3JFZDECLC6I","short_pith_number":"pith:E6AD4QXM","schema_version":"1.0","canonical_sha256":"27803e42ecdc807910bb4972320962f206e8e909f8d516f3ddbb5cabcad77d56","source":{"kind":"arxiv","id":"1311.6615","version":2},"attestation_state":"computed","paper":{"title":"Improved approximation algorithm for Fault-Tolerant Facility Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jaroslaw Byrka","submitted_at":"2013-11-26T10:49:36Z","abstract_excerpt":"We consider the Fault-Tolerant Facility Placement problem ($FTFP$), which is a generalization of the classical Uncapacitated Facility Location problem ($UFL$). In the $FTFP$ problem we have a set of clients $C$ and a set of facilities $F$. Each facility $i \\in F$ can be opened many times. For each opening of facility $i$ we pay $f_i \\geq 0$. Our goal is to connect each client $j \\in C$ with $r_j \\geq 1$ open facilities in a way that minimizes the total cost of open facilities and established connections.\n  In a series of recent papers $FTFP$ was essentially reduced to $FTFL$ and then to $UFL$ "},"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":"1311.6615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-26T10:49:36Z","cross_cats_sorted":[],"title_canon_sha256":"d8fbf158228e8c3122797f72b82b20b2dbb2f3ea27ac6224fbf48f18a94b9573","abstract_canon_sha256":"269d0603cad7251136c8b4bda5d9a34c47ca8902a80f3921357aed3bf54fe0dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:20.461020Z","signature_b64":"98h/QATQLe1JrpC0OFl9guhCzQ8ctzUfwwmGLYPkU+E3jk4JAxa1f9jxh+AmPREUduDLjDQIPLdlhg6g35fuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27803e42ecdc807910bb4972320962f206e8e909f8d516f3ddbb5cabcad77d56","last_reissued_at":"2026-05-18T02:59:20.460124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:20.460124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved approximation algorithm for Fault-Tolerant Facility Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jaroslaw Byrka","submitted_at":"2013-11-26T10:49:36Z","abstract_excerpt":"We consider the Fault-Tolerant Facility Placement problem ($FTFP$), which is a generalization of the classical Uncapacitated Facility Location problem ($UFL$). In the $FTFP$ problem we have a set of clients $C$ and a set of facilities $F$. Each facility $i \\in F$ can be opened many times. For each opening of facility $i$ we pay $f_i \\geq 0$. Our goal is to connect each client $j \\in C$ with $r_j \\geq 1$ open facilities in a way that minimizes the total cost of open facilities and established connections.\n  In a series of recent papers $FTFP$ was essentially reduced to $FTFL$ and then to $UFL$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6615","kind":"arxiv","version":2},"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":"1311.6615","created_at":"2026-05-18T02:59:20.460253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6615v2","created_at":"2026-05-18T02:59:20.460253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6615","created_at":"2026-05-18T02:59:20.460253+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6AD4QXM3SAH","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6AD4QXM3SAHSEF3","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6AD4QXM","created_at":"2026-05-18T12:27:43.054852+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/E6AD4QXM3SAHSEF3JFZDECLC6I","json":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I.json","graph_json":"https://pith.science/api/pith-number/E6AD4QXM3SAHSEF3JFZDECLC6I/graph.json","events_json":"https://pith.science/api/pith-number/E6AD4QXM3SAHSEF3JFZDECLC6I/events.json","paper":"https://pith.science/paper/E6AD4QXM"},"agent_actions":{"view_html":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I","download_json":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I.json","view_paper":"https://pith.science/paper/E6AD4QXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6615&json=true","fetch_graph":"https://pith.science/api/pith-number/E6AD4QXM3SAHSEF3JFZDECLC6I/graph.json","fetch_events":"https://pith.science/api/pith-number/E6AD4QXM3SAHSEF3JFZDECLC6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/action/storage_attestation","attest_author":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/action/author_attestation","sign_citation":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/action/citation_signature","submit_replication":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/action/replication_record"}},"created_at":"2026-05-18T02:59:20.460253+00:00","updated_at":"2026-05-18T02:59:20.460253+00:00"}