{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:O6VTYPQNAEE6RF4X4ZRBJG4VYL","short_pith_number":"pith:O6VTYPQN","canonical_record":{"source":{"id":"1206.5392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T13:21:29Z","cross_cats_sorted":[],"title_canon_sha256":"34a2f73d0e39e6bce77589b0ad461ce7596fd2a8643a7c3d4c42e3d9686c362f","abstract_canon_sha256":"68f495db85172c1f4cf35857edaa749e9be5022d944ba7844c321ecd16f59eb5"},"schema_version":"1.0"},"canonical_sha256":"77ab3c3e0d0109e89797e662149b95c2f852f7ba42d7d5bf5f6e77b1e5baf1df","source":{"kind":"arxiv","id":"1206.5392","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5392","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5392v2","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5392","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"O6VTYPQNAEE6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O6VTYPQNAEE6RF4X","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O6VTYPQN","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:O6VTYPQNAEE6RF4X4ZRBJG4VYL","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T13:21:29Z","cross_cats_sorted":[],"title_canon_sha256":"34a2f73d0e39e6bce77589b0ad461ce7596fd2a8643a7c3d4c42e3d9686c362f","abstract_canon_sha256":"68f495db85172c1f4cf35857edaa749e9be5022d944ba7844c321ecd16f59eb5"},"schema_version":"1.0"},"canonical_sha256":"77ab3c3e0d0109e89797e662149b95c2f852f7ba42d7d5bf5f6e77b1e5baf1df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:25.592192Z","signature_b64":"VFEL5hy86URK+SPNeR0pj0dFi08xv+RfvlEVQsqSl7vt/qlMqD2NCozGsFEAa8dHB/r76I+5jsBOARiAmJB3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ab3c3e0d0109e89797e662149b95c2f852f7ba42d7d5bf5f6e77b1e5baf1df","last_reissued_at":"2026-05-18T02:51:25.591711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:25.591711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5392","source_version":2,"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-18T02:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yln1pAfyRn9enhUav8Dp8R4DNPk0/Jrj8uxU/0Z6y3QXY60MJmRLlSETA7gEi/dcfzREWsc+BYAscjWC7bYFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:00:52.582773Z"},"content_sha256":"5424ddcb1420cd53cdf22e097589b5453403301b3664bf7706c2d18fd21b766c","schema_version":"1.0","event_id":"sha256:5424ddcb1420cd53cdf22e097589b5453403301b3664bf7706c2d18fd21b766c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:O6VTYPQNAEE6RF4X4ZRBJG4VYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metrical Service Systems with Multiple Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashish Chiplunkar, Sundar Vishwanathan","submitted_at":"2012-06-23T13:21:29Z","abstract_excerpt":"We study the problem of metrical service systems with multiple servers (MSSMS), which generalizes two well-known problems -- the $k$-server problem, and metrical service systems. The MSSMS problem is to service requests, each of which is an $l$-point subset of a metric space, using $k$ servers, with the objective of minimizing the total distance traveled by the servers.\n  Feuerstein initiated a study of this problem by proving upper and lower bounds on the deterministic competitive ratio for uniform metric spaces. We improve Feuerstein's analysis of the upper bound and prove that his algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5392","kind":"arxiv","version":2},"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-18T02:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSzuUHQSyJnTI20zfutXxTCMqQzTkJg/7RXBFk4jCYQtJFodDo7+aHWZSHvmPwEi4OinqLotdosQnkzeuNxtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:00:52.583116Z"},"content_sha256":"d6a86057692eff3ab44a2f5cdb30ae2db3e4864ab3059de30f52fe7526e39ca6","schema_version":"1.0","event_id":"sha256:d6a86057692eff3ab44a2f5cdb30ae2db3e4864ab3059de30f52fe7526e39ca6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6VTYPQNAEE6RF4X4ZRBJG4VYL/bundle.json","state_url":"https://pith.science/pith/O6VTYPQNAEE6RF4X4ZRBJG4VYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6VTYPQNAEE6RF4X4ZRBJG4VYL/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-06-21T22:00:52Z","links":{"resolver":"https://pith.science/pith/O6VTYPQNAEE6RF4X4ZRBJG4VYL","bundle":"https://pith.science/pith/O6VTYPQNAEE6RF4X4ZRBJG4VYL/bundle.json","state":"https://pith.science/pith/O6VTYPQNAEE6RF4X4ZRBJG4VYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6VTYPQNAEE6RF4X4ZRBJG4VYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:O6VTYPQNAEE6RF4X4ZRBJG4VYL","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":"68f495db85172c1f4cf35857edaa749e9be5022d944ba7844c321ecd16f59eb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T13:21:29Z","title_canon_sha256":"34a2f73d0e39e6bce77589b0ad461ce7596fd2a8643a7c3d4c42e3d9686c362f"},"schema_version":"1.0","source":{"id":"1206.5392","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5392","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5392v2","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5392","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"O6VTYPQNAEE6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O6VTYPQNAEE6RF4X","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O6VTYPQN","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:d6a86057692eff3ab44a2f5cdb30ae2db3e4864ab3059de30f52fe7526e39ca6","target":"graph","created_at":"2026-05-18T02:51:25Z","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 study the problem of metrical service systems with multiple servers (MSSMS), which generalizes two well-known problems -- the $k$-server problem, and metrical service systems. The MSSMS problem is to service requests, each of which is an $l$-point subset of a metric space, using $k$ servers, with the objective of minimizing the total distance traveled by the servers.\n  Feuerstein initiated a study of this problem by proving upper and lower bounds on the deterministic competitive ratio for uniform metric spaces. We improve Feuerstein's analysis of the upper bound and prove that his algorithm","authors_text":"Ashish Chiplunkar, Sundar Vishwanathan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T13:21:29Z","title":"Metrical Service Systems with Multiple Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5392","kind":"arxiv","version":2},"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:5424ddcb1420cd53cdf22e097589b5453403301b3664bf7706c2d18fd21b766c","target":"record","created_at":"2026-05-18T02:51:25Z","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":"68f495db85172c1f4cf35857edaa749e9be5022d944ba7844c321ecd16f59eb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-23T13:21:29Z","title_canon_sha256":"34a2f73d0e39e6bce77589b0ad461ce7596fd2a8643a7c3d4c42e3d9686c362f"},"schema_version":"1.0","source":{"id":"1206.5392","kind":"arxiv","version":2}},"canonical_sha256":"77ab3c3e0d0109e89797e662149b95c2f852f7ba42d7d5bf5f6e77b1e5baf1df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77ab3c3e0d0109e89797e662149b95c2f852f7ba42d7d5bf5f6e77b1e5baf1df","first_computed_at":"2026-05-18T02:51:25.591711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:25.591711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VFEL5hy86URK+SPNeR0pj0dFi08xv+RfvlEVQsqSl7vt/qlMqD2NCozGsFEAa8dHB/r76I+5jsBOARiAmJB3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:25.592192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5392","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5424ddcb1420cd53cdf22e097589b5453403301b3664bf7706c2d18fd21b766c","sha256:d6a86057692eff3ab44a2f5cdb30ae2db3e4864ab3059de30f52fe7526e39ca6"],"state_sha256":"64c0329ee158155eb4e8da839948e6da04a10d97370d81bbb961a407f451bd29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63aX2Z9dsDiM1XlYE0kyfgUXb/eeMwAGlt9TjjlWGsbITgqlMtRYuWzkqlOXOwOZh8Tm2+l02ZsaVbDjpu/bAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:00:52.585069Z","bundle_sha256":"df82d20c55982070a5471a09e6aa082834c00a1c510316d3b702df16825eae05"}}