{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JBWDAGSXPYLCGWXPQG74DEVNWZ","short_pith_number":"pith:JBWDAGSX","schema_version":"1.0","canonical_sha256":"486c301a577e16235aef81bfc192adb6721ef9e4650e65357a9c867d8986d1d5","source":{"kind":"arxiv","id":"1106.2294","version":1},"attestation_state":"computed","paper":{"title":"Unconstrained and Constrained Fault-Tolerant Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hong Shen, Kewen Liao","submitted_at":"2011-06-12T08:59:06Z","abstract_excerpt":"First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in \\cite{shihongftfa}). In the problem, we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with set $\\mathcal{R}$ as corresponding connection requirements, where every facility belonging to the same site has an identical opening (operating) cost and every client-facility pair has a connection cost. The objective is to allocate facilities from sites to satisfy $\\mathcal{R}$ at a minimum total cost. Next, we introduce the Constr"},"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":"1106.2294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-12T08:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"b7f4cee5261711757c73df9cebfe88bdba3e8154d5ba928c5fbc0617ee1ebdfd","abstract_canon_sha256":"1cfe00d551246e00e8b4f24b26b93ff3254373f83cabff763312f7ccbddb425f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:06.082194Z","signature_b64":"c4gQ6/N/2An/SiL17RDUErkKa5XoHAvjkHEsJpP+j7eXibgY+QfDYXxIvZKq7Z/P3uZOy3nvwD6ThUaXlg0fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"486c301a577e16235aef81bfc192adb6721ef9e4650e65357a9c867d8986d1d5","last_reissued_at":"2026-05-18T04:20:06.081734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:06.081734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unconstrained and Constrained Fault-Tolerant Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hong Shen, Kewen Liao","submitted_at":"2011-06-12T08:59:06Z","abstract_excerpt":"First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in \\cite{shihongftfa}). In the problem, we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with set $\\mathcal{R}$ as corresponding connection requirements, where every facility belonging to the same site has an identical opening (operating) cost and every client-facility pair has a connection cost. The objective is to allocate facilities from sites to satisfy $\\mathcal{R}$ at a minimum total cost. Next, we introduce the Constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2294","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":"1106.2294","created_at":"2026-05-18T04:20:06.081809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2294v1","created_at":"2026-05-18T04:20:06.081809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2294","created_at":"2026-05-18T04:20:06.081809+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBWDAGSXPYLC","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBWDAGSXPYLCGWXP","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBWDAGSX","created_at":"2026-05-18T12:26:32.869790+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/JBWDAGSXPYLCGWXPQG74DEVNWZ","json":"https://pith.science/pith/JBWDAGSXPYLCGWXPQG74DEVNWZ.json","graph_json":"https://pith.science/api/pith-number/JBWDAGSXPYLCGWXPQG74DEVNWZ/graph.json","events_json":"https://pith.science/api/pith-number/JBWDAGSXPYLCGWXPQG74DEVNWZ/events.json","paper":"https://pith.science/paper/JBWDAGSX"},"agent_actions":{"view_html":"https://pith.science/pith/JBWDAGSXPYLCGWXPQG74DEVNWZ","download_json":"https://pith.science/pith/JBWDAGSXPYLCGWXPQG74DEVNWZ.json","view_paper":"https://pith.science/paper/JBWDAGSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2294&json=true","fetch_graph":"https://pith.science/api/pith-number/JBWDAGSXPYLCGWXPQG74DEVNWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JBWDAGSXPYLCGWXPQG74DEVNWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBWDAGSXPYLCGWXPQG74DEVNWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBWDAGSXPYLCGWXPQG74DEVNWZ/action/storage_attestation","attest_author":"https://pith.science/pith/JBWDAGSXPYLCGWXPQG74DEVNWZ/action/author_attestation","sign_citation":"https://pith.science/pith/JBWDAGSXPYLCGWXPQG74DEVNWZ/action/citation_signature","submit_replication":"https://pith.science/pith/JBWDAGSXPYLCGWXPQG74DEVNWZ/action/replication_record"}},"created_at":"2026-05-18T04:20:06.081809+00:00","updated_at":"2026-05-18T04:20:06.081809+00:00"}