{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:T4OYNQN5GSLQIXIW23QTFBMZHU","short_pith_number":"pith:T4OYNQN5","schema_version":"1.0","canonical_sha256":"9f1d86c1bd3497045d16d6e13285993d1302259ec5bf4759f5959adbd0561cd8","source":{"kind":"arxiv","id":"1208.3835","version":4},"attestation_state":"computed","paper":{"title":"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, Longkun Guo","submitted_at":"2012-08-19T13:46:18Z","abstract_excerpt":"In the Constrained Fault-Tolerant Resource Allocation (FTRA) problem, we are given a set of sites containing facilities as resources, and a set of clients accessing these resources. Specifically, each site i is allowed to open at most R_i facilities with cost f_i for each opened facility. Each client j requires an allocation of r_j open facilities and connecting j to any facility at site i incurs a connection cost c_ij. The goal is to minimize the total cost of this resource allocation scenario.\n  FTRA generalizes the Unconstrained Fault-Tolerant Resource Allocation (FTRA_{\\infty}) [18] and th"},"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":"1208.3835","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-19T13:46:18Z","cross_cats_sorted":[],"title_canon_sha256":"ac7214ea08df6b5c0581bb598f32006bb62a49e30c99e3218ca1294db3544159","abstract_canon_sha256":"05952f25ac97da1fa63ef846a2c810103403c81750770adb2e2a9cb20df88d16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.989590Z","signature_b64":"dj6SHZlVtfvyzuOVzJpG2Sc2NareLe/BhGOged6MGt86LveO2gcRaoe1ntmLfYkVOERQlc5us8654OS0lDdNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f1d86c1bd3497045d16d6e13285993d1302259ec5bf4759f5959adbd0561cd8","last_reissued_at":"2026-05-18T02:21:00.988888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.988888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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, Longkun Guo","submitted_at":"2012-08-19T13:46:18Z","abstract_excerpt":"In the Constrained Fault-Tolerant Resource Allocation (FTRA) problem, we are given a set of sites containing facilities as resources, and a set of clients accessing these resources. Specifically, each site i is allowed to open at most R_i facilities with cost f_i for each opened facility. Each client j requires an allocation of r_j open facilities and connecting j to any facility at site i incurs a connection cost c_ij. The goal is to minimize the total cost of this resource allocation scenario.\n  FTRA generalizes the Unconstrained Fault-Tolerant Resource Allocation (FTRA_{\\infty}) [18] and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3835","kind":"arxiv","version":4},"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":"1208.3835","created_at":"2026-05-18T02:21:00.988972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3835v4","created_at":"2026-05-18T02:21:00.988972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3835","created_at":"2026-05-18T02:21:00.988972+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4OYNQN5GSLQ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4OYNQN5GSLQIXIW","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4OYNQN5","created_at":"2026-05-18T12:27:23.164592+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/T4OYNQN5GSLQIXIW23QTFBMZHU","json":"https://pith.science/pith/T4OYNQN5GSLQIXIW23QTFBMZHU.json","graph_json":"https://pith.science/api/pith-number/T4OYNQN5GSLQIXIW23QTFBMZHU/graph.json","events_json":"https://pith.science/api/pith-number/T4OYNQN5GSLQIXIW23QTFBMZHU/events.json","paper":"https://pith.science/paper/T4OYNQN5"},"agent_actions":{"view_html":"https://pith.science/pith/T4OYNQN5GSLQIXIW23QTFBMZHU","download_json":"https://pith.science/pith/T4OYNQN5GSLQIXIW23QTFBMZHU.json","view_paper":"https://pith.science/paper/T4OYNQN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3835&json=true","fetch_graph":"https://pith.science/api/pith-number/T4OYNQN5GSLQIXIW23QTFBMZHU/graph.json","fetch_events":"https://pith.science/api/pith-number/T4OYNQN5GSLQIXIW23QTFBMZHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4OYNQN5GSLQIXIW23QTFBMZHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4OYNQN5GSLQIXIW23QTFBMZHU/action/storage_attestation","attest_author":"https://pith.science/pith/T4OYNQN5GSLQIXIW23QTFBMZHU/action/author_attestation","sign_citation":"https://pith.science/pith/T4OYNQN5GSLQIXIW23QTFBMZHU/action/citation_signature","submit_replication":"https://pith.science/pith/T4OYNQN5GSLQIXIW23QTFBMZHU/action/replication_record"}},"created_at":"2026-05-18T02:21:00.988972+00:00","updated_at":"2026-05-18T02:21:00.988972+00:00"}