{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VNERGQ4XYUZWLOTB545AEH6CU2","short_pith_number":"pith:VNERGQ4X","schema_version":"1.0","canonical_sha256":"ab49134397c53365ba61ef3a021fc2a6878ca63f3dec3b7c037f92aa4fd0dede","source":{"kind":"arxiv","id":"1907.09834","version":1},"attestation_state":"computed","paper":{"title":"Managing Multiple Mobile Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bj\\\"orn Feldkord, Friedhelm Meyer auf der Heide, Manuel Malatyali, Till Knollmann","submitted_at":"2019-07-23T12:07:33Z","abstract_excerpt":"We extend the Mobile Server Problem, introduced in SPAA'17, to a model where k identical mobile resources, here named servers, answer requests appearing at points in the Euclidean space. In order to reduce communication costs, the positions of the servers can be adapted by a limited distance m_s per round for each server. The costs are measured similar to the classical Page Migration Problem, i.e., answering a request induces costs proportional to the distance to the nearest server, and moving a server induces costs proportional to the distance multiplied with a weight D.\n  We show that, in ou"},"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":"1907.09834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-23T12:07:33Z","cross_cats_sorted":[],"title_canon_sha256":"d8c16818e49649862e0e1542e023b2d58d2ef113f2917ef07c422f7ee64709aa","abstract_canon_sha256":"ff04dcf759bf8e71d68c7a9f6cb964fa698fb6f097cd4e69338781ea7b557e58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:49.925044Z","signature_b64":"/hcf3zALCnGMmGrigSklpeIaGPey7MpsYFX/oHl3xyDw/YP+lJwFgfsXs8qQI5wCQm6LB2vSFSHha4t76E4NAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab49134397c53365ba61ef3a021fc2a6878ca63f3dec3b7c037f92aa4fd0dede","last_reissued_at":"2026-05-17T23:39:49.924456Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:49.924456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Managing Multiple Mobile Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bj\\\"orn Feldkord, Friedhelm Meyer auf der Heide, Manuel Malatyali, Till Knollmann","submitted_at":"2019-07-23T12:07:33Z","abstract_excerpt":"We extend the Mobile Server Problem, introduced in SPAA'17, to a model where k identical mobile resources, here named servers, answer requests appearing at points in the Euclidean space. In order to reduce communication costs, the positions of the servers can be adapted by a limited distance m_s per round for each server. The costs are measured similar to the classical Page Migration Problem, i.e., answering a request induces costs proportional to the distance to the nearest server, and moving a server induces costs proportional to the distance multiplied with a weight D.\n  We show that, in ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09834","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":"1907.09834","created_at":"2026-05-17T23:39:49.924544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09834v1","created_at":"2026-05-17T23:39:49.924544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09834","created_at":"2026-05-17T23:39:49.924544+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNERGQ4XYUZW","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNERGQ4XYUZWLOTB","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNERGQ4X","created_at":"2026-05-18T12:33:30.264802+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/VNERGQ4XYUZWLOTB545AEH6CU2","json":"https://pith.science/pith/VNERGQ4XYUZWLOTB545AEH6CU2.json","graph_json":"https://pith.science/api/pith-number/VNERGQ4XYUZWLOTB545AEH6CU2/graph.json","events_json":"https://pith.science/api/pith-number/VNERGQ4XYUZWLOTB545AEH6CU2/events.json","paper":"https://pith.science/paper/VNERGQ4X"},"agent_actions":{"view_html":"https://pith.science/pith/VNERGQ4XYUZWLOTB545AEH6CU2","download_json":"https://pith.science/pith/VNERGQ4XYUZWLOTB545AEH6CU2.json","view_paper":"https://pith.science/paper/VNERGQ4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09834&json=true","fetch_graph":"https://pith.science/api/pith-number/VNERGQ4XYUZWLOTB545AEH6CU2/graph.json","fetch_events":"https://pith.science/api/pith-number/VNERGQ4XYUZWLOTB545AEH6CU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNERGQ4XYUZWLOTB545AEH6CU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNERGQ4XYUZWLOTB545AEH6CU2/action/storage_attestation","attest_author":"https://pith.science/pith/VNERGQ4XYUZWLOTB545AEH6CU2/action/author_attestation","sign_citation":"https://pith.science/pith/VNERGQ4XYUZWLOTB545AEH6CU2/action/citation_signature","submit_replication":"https://pith.science/pith/VNERGQ4XYUZWLOTB545AEH6CU2/action/replication_record"}},"created_at":"2026-05-17T23:39:49.924544+00:00","updated_at":"2026-05-17T23:39:49.924544+00:00"}