{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3ZBYXTKKMJ5X76MKZRMBQGADOF","short_pith_number":"pith:3ZBYXTKK","schema_version":"1.0","canonical_sha256":"de438bcd4a627b7ff98acc581818037159ccdc22433fad1c32c25bf33a3f8785","source":{"kind":"arxiv","id":"1108.5471","version":1},"attestation_state":"computed","paper":{"title":"New Results on the Fault-Tolerant Facility Placement Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Li Yan, Marek Chrobak","submitted_at":"2011-08-27T19:31:25Z","abstract_excerpt":"We studied the Fault-Tolerant Facility Placement problem (FTFP) which generalizes the uncapacitated facility location problem (UFL). In FTFP, we are given a set F of sites at which facilities can be built, and a set C of clients with some demands that need to be satisfied by different facilities. A client $j$ has demand $r_j$. Building one facility at a site $i$ incurs a cost $f_i$, and connecting one unit of demand from client $j$ to a facility at site $i\\in\\fac$ costs $d_{ij}$. $d_{ij}$'s are assumed to form a metric. A feasible solution specifies the number of facilities to be built at each"},"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":"1108.5471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-27T19:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"20c4e812a2132ba02fbc12fcc7abab606b338bff1b9cad178264a67b7699d11a","abstract_canon_sha256":"9f70a456cdb720f4bffa7007e0782c6eb2627e3c39a738e89bf8f33cb77de796"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:37.445348Z","signature_b64":"kRvTCvJCW2vMWAXHWGRhqHfT0u5JEGKIaRa12iqQkZy5xU9m/aHEa2OF0mUjiMUa8NHUT0bdycA79lk9EAS/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de438bcd4a627b7ff98acc581818037159ccdc22433fad1c32c25bf33a3f8785","last_reissued_at":"2026-05-18T04:14:37.444962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:37.444962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Results on the Fault-Tolerant Facility Placement Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Li Yan, Marek Chrobak","submitted_at":"2011-08-27T19:31:25Z","abstract_excerpt":"We studied the Fault-Tolerant Facility Placement problem (FTFP) which generalizes the uncapacitated facility location problem (UFL). In FTFP, we are given a set F of sites at which facilities can be built, and a set C of clients with some demands that need to be satisfied by different facilities. A client $j$ has demand $r_j$. Building one facility at a site $i$ incurs a cost $f_i$, and connecting one unit of demand from client $j$ to a facility at site $i\\in\\fac$ costs $d_{ij}$. $d_{ij}$'s are assumed to form a metric. A feasible solution specifies the number of facilities to be built at each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5471","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":"1108.5471","created_at":"2026-05-18T04:14:37.445012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5471v1","created_at":"2026-05-18T04:14:37.445012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5471","created_at":"2026-05-18T04:14:37.445012+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZBYXTKKMJ5X","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZBYXTKKMJ5X76MK","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZBYXTKK","created_at":"2026-05-18T12:26:20.644004+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/3ZBYXTKKMJ5X76MKZRMBQGADOF","json":"https://pith.science/pith/3ZBYXTKKMJ5X76MKZRMBQGADOF.json","graph_json":"https://pith.science/api/pith-number/3ZBYXTKKMJ5X76MKZRMBQGADOF/graph.json","events_json":"https://pith.science/api/pith-number/3ZBYXTKKMJ5X76MKZRMBQGADOF/events.json","paper":"https://pith.science/paper/3ZBYXTKK"},"agent_actions":{"view_html":"https://pith.science/pith/3ZBYXTKKMJ5X76MKZRMBQGADOF","download_json":"https://pith.science/pith/3ZBYXTKKMJ5X76MKZRMBQGADOF.json","view_paper":"https://pith.science/paper/3ZBYXTKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5471&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZBYXTKKMJ5X76MKZRMBQGADOF/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZBYXTKKMJ5X76MKZRMBQGADOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZBYXTKKMJ5X76MKZRMBQGADOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZBYXTKKMJ5X76MKZRMBQGADOF/action/storage_attestation","attest_author":"https://pith.science/pith/3ZBYXTKKMJ5X76MKZRMBQGADOF/action/author_attestation","sign_citation":"https://pith.science/pith/3ZBYXTKKMJ5X76MKZRMBQGADOF/action/citation_signature","submit_replication":"https://pith.science/pith/3ZBYXTKKMJ5X76MKZRMBQGADOF/action/replication_record"}},"created_at":"2026-05-18T04:14:37.445012+00:00","updated_at":"2026-05-18T04:14:37.445012+00:00"}