{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O4ZMQRMFKSNUORSZLCBOBDJ5GY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2b57bc27c2332b0ac2a0f66adbd68ab77960902d3b8321fa215fb94e9afbdbba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-29T07:35:04Z","title_canon_sha256":"d0555064702c6aa6822c5deda99915cb1ef541c8e82b3735d1642f1464b4ab74"},"schema_version":"1.0","source":{"id":"1705.00145","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00145","created_at":"2026-05-18T00:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00145v3","created_at":"2026-05-18T00:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00145","created_at":"2026-05-18T00:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"O4ZMQRMFKSNU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4ZMQRMFKSNUORSZ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4ZMQRMF","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:bf2e67aabc115bbff040323221486c9a28f53130f17020d8a0f8ae214d369193","target":"graph","created_at":"2026-05-18T00:35:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the replica placement problem: given a graph with clients and nodes, place replicas on a minimum set of nodes to serve all the clients; each client is associated with a request and maximum distance that it can travel to get served and there is a maximum limit (capacity) on the amount of request a replica can serve. The problem falls under the general framework of capacitated set covering. It admits an O(\\log n)-approximation and it is NP-hard to approximate within a factor of $o(\\log n)$. We study the problem in terms of the treewidth $t$ of the graph and present an O(t)-approximat","authors_text":"Anshul Aggarwal, Neelima Gupta, Sachin Sharma, Sonika Thakral, Venkatesan T. Chakaravarthy, Yogish Sabharwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-29T07:35:04Z","title":"Replica Placement on Bounded Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00145","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a052a5271aecacd58afee8294a10875ea82013580527f6f62001bf7b3a3ca440","target":"record","created_at":"2026-05-18T00:35:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2b57bc27c2332b0ac2a0f66adbd68ab77960902d3b8321fa215fb94e9afbdbba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-29T07:35:04Z","title_canon_sha256":"d0555064702c6aa6822c5deda99915cb1ef541c8e82b3735d1642f1464b4ab74"},"schema_version":"1.0","source":{"id":"1705.00145","kind":"arxiv","version":3}},"canonical_sha256":"7732c84585549b4746595882e08d3d362d285a9c7931a0fffb007a066810021d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7732c84585549b4746595882e08d3d362d285a9c7931a0fffb007a066810021d","first_computed_at":"2026-05-18T00:35:41.389824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:41.389824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o2PH/kXzt0gzuvdbxxuzOLS5abSK/j63dsXrj1LOhPnOOBgshri79msgT8YtWOJFnkcSrQVefyIrkw8s7NbNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:41.390461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00145","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a052a5271aecacd58afee8294a10875ea82013580527f6f62001bf7b3a3ca440","sha256:bf2e67aabc115bbff040323221486c9a28f53130f17020d8a0f8ae214d369193"],"state_sha256":"335f4a9738565b32dad6caaa21a06af54c6154c47580579b18d2861c37edba5f"}