{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O4ZMQRMFKSNUORSZLCBOBDJ5GY","short_pith_number":"pith:O4ZMQRMF","canonical_record":{"source":{"id":"1705.00145","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-29T07:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"d0555064702c6aa6822c5deda99915cb1ef541c8e82b3735d1642f1464b4ab74","abstract_canon_sha256":"2b57bc27c2332b0ac2a0f66adbd68ab77960902d3b8321fa215fb94e9afbdbba"},"schema_version":"1.0"},"canonical_sha256":"7732c84585549b4746595882e08d3d362d285a9c7931a0fffb007a066810021d","source":{"kind":"arxiv","id":"1705.00145","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O4ZMQRMFKSNUORSZLCBOBDJ5GY","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00145","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-29T07:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"d0555064702c6aa6822c5deda99915cb1ef541c8e82b3735d1642f1464b4ab74","abstract_canon_sha256":"2b57bc27c2332b0ac2a0f66adbd68ab77960902d3b8321fa215fb94e9afbdbba"},"schema_version":"1.0"},"canonical_sha256":"7732c84585549b4746595882e08d3d362d285a9c7931a0fffb007a066810021d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:41.390461Z","signature_b64":"o2PH/kXzt0gzuvdbxxuzOLS5abSK/j63dsXrj1LOhPnOOBgshri79msgT8YtWOJFnkcSrQVefyIrkw8s7NbNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7732c84585549b4746595882e08d3d362d285a9c7931a0fffb007a066810021d","last_reissued_at":"2026-05-18T00:35:41.389824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:41.389824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00145","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hD19Y0i20KU+cn+VPsmFDDnZxPsYHVVMuqhz6CGKFy92vlZMjaTCi8pth8nbjwbLvwPGJARQj07yQRFYptFsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:33:35.373700Z"},"content_sha256":"a052a5271aecacd58afee8294a10875ea82013580527f6f62001bf7b3a3ca440","schema_version":"1.0","event_id":"sha256:a052a5271aecacd58afee8294a10875ea82013580527f6f62001bf7b3a3ca440"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O4ZMQRMFKSNUORSZLCBOBDJ5GY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Replica Placement on Bounded Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anshul Aggarwal, Neelima Gupta, Sachin Sharma, Sonika Thakral, Venkatesan T. Chakaravarthy, Yogish Sabharwal","submitted_at":"2017-04-29T07:35:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00145","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZ0QqHBAwfEppxFxv1PSd+5HMl00BCMgFnShM1O93qOr3pdu0JqolOIU08trUndUjtS4vYXTeAyQSxiXulYyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:33:35.374049Z"},"content_sha256":"bf2e67aabc115bbff040323221486c9a28f53130f17020d8a0f8ae214d369193","schema_version":"1.0","event_id":"sha256:bf2e67aabc115bbff040323221486c9a28f53130f17020d8a0f8ae214d369193"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4ZMQRMFKSNUORSZLCBOBDJ5GY/bundle.json","state_url":"https://pith.science/pith/O4ZMQRMFKSNUORSZLCBOBDJ5GY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4ZMQRMFKSNUORSZLCBOBDJ5GY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T07:33:35Z","links":{"resolver":"https://pith.science/pith/O4ZMQRMFKSNUORSZLCBOBDJ5GY","bundle":"https://pith.science/pith/O4ZMQRMFKSNUORSZLCBOBDJ5GY/bundle.json","state":"https://pith.science/pith/O4ZMQRMFKSNUORSZLCBOBDJ5GY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4ZMQRMFKSNUORSZLCBOBDJ5GY/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m69xNv7tYGV6rKoId+BAte1EYN5MkNzVdJqsNfbGY7sw5PzAIZEWhw9P7AfTT3WgRojV3gT0EBpKQEBITvkeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:33:35.376019Z","bundle_sha256":"932815ef739615155d19b1cd63d2ec641219ceec2a1c8da41a0425ca9c130851"}}