{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W2ZTMWKYR4MNZVY6K7HZFLP6A7","short_pith_number":"pith:W2ZTMWKY","schema_version":"1.0","canonical_sha256":"b6b33659588f18dcd71e57cf92adfe07c7827e69ea847d02d61545298a2fbb48","source":{"kind":"arxiv","id":"2607.07098","version":1},"attestation_state":"computed","paper":{"title":"Improved Algorithms and Lower Bounds for Parametrized Metrical Service Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junhao Gan, Seeun William Umboh, Xiao Sun","submitted_at":"2026-07-08T07:32:26Z","abstract_excerpt":"We consider the parametrized setting of the classical metrical service system (MSS) problem first studied by Bubeck and Rabani (APPROX/RANDOM 2020). In this setting, the adversary is restricted to a set of $m$ distinct request types, known to the algorithm in advance. The goal is to obtain competitive ratio bounds in terms of $m$. In this work, we make significant progress in understanding the landscape of parametrized MSS and resolve several open problems from Bubeck and Rabani.\n  Our first main result is a tight bound for parametrized MSS on weighted stars. Previously, Bubeck and Rabani gave"},"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":"2607.07098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T07:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"928788d1a019bad5f65c5083af6a8d3132c9e385d98d8be6d9dc4fa09d7b7fb5","abstract_canon_sha256":"3566d0b3670b9cb195fb4fa0e3e745fa559d0ed4ec3c6d90d54e9364d17b4dd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:14.415041Z","signature_b64":"Mait27uIqzOE1mc9a3iwPU6T2RLVnYGXygcanE2DU6VmoxWpbrxj+unU4b9iWato2sK13Ykaff30lBifv/LQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6b33659588f18dcd71e57cf92adfe07c7827e69ea847d02d61545298a2fbb48","last_reissued_at":"2026-07-09T01:20:14.414650Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:14.414650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms and Lower Bounds for Parametrized Metrical Service Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junhao Gan, Seeun William Umboh, Xiao Sun","submitted_at":"2026-07-08T07:32:26Z","abstract_excerpt":"We consider the parametrized setting of the classical metrical service system (MSS) problem first studied by Bubeck and Rabani (APPROX/RANDOM 2020). In this setting, the adversary is restricted to a set of $m$ distinct request types, known to the algorithm in advance. The goal is to obtain competitive ratio bounds in terms of $m$. In this work, we make significant progress in understanding the landscape of parametrized MSS and resolve several open problems from Bubeck and Rabani.\n  Our first main result is a tight bound for parametrized MSS on weighted stars. Previously, Bubeck and Rabani gave"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07098","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07098/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.07098","created_at":"2026-07-09T01:20:14.414709+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07098v1","created_at":"2026-07-09T01:20:14.414709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07098","created_at":"2026-07-09T01:20:14.414709+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2ZTMWKYR4MN","created_at":"2026-07-09T01:20:14.414709+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2ZTMWKYR4MNZVY6","created_at":"2026-07-09T01:20:14.414709+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2ZTMWKY","created_at":"2026-07-09T01:20:14.414709+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/W2ZTMWKYR4MNZVY6K7HZFLP6A7","json":"https://pith.science/pith/W2ZTMWKYR4MNZVY6K7HZFLP6A7.json","graph_json":"https://pith.science/api/pith-number/W2ZTMWKYR4MNZVY6K7HZFLP6A7/graph.json","events_json":"https://pith.science/api/pith-number/W2ZTMWKYR4MNZVY6K7HZFLP6A7/events.json","paper":"https://pith.science/paper/W2ZTMWKY"},"agent_actions":{"view_html":"https://pith.science/pith/W2ZTMWKYR4MNZVY6K7HZFLP6A7","download_json":"https://pith.science/pith/W2ZTMWKYR4MNZVY6K7HZFLP6A7.json","view_paper":"https://pith.science/paper/W2ZTMWKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07098&json=true","fetch_graph":"https://pith.science/api/pith-number/W2ZTMWKYR4MNZVY6K7HZFLP6A7/graph.json","fetch_events":"https://pith.science/api/pith-number/W2ZTMWKYR4MNZVY6K7HZFLP6A7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2ZTMWKYR4MNZVY6K7HZFLP6A7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2ZTMWKYR4MNZVY6K7HZFLP6A7/action/storage_attestation","attest_author":"https://pith.science/pith/W2ZTMWKYR4MNZVY6K7HZFLP6A7/action/author_attestation","sign_citation":"https://pith.science/pith/W2ZTMWKYR4MNZVY6K7HZFLP6A7/action/citation_signature","submit_replication":"https://pith.science/pith/W2ZTMWKYR4MNZVY6K7HZFLP6A7/action/replication_record"}},"created_at":"2026-07-09T01:20:14.414709+00:00","updated_at":"2026-07-09T01:20:14.414709+00:00"}