{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CEIXJXUEOAGXONE5GJ5YRJ3MCS","short_pith_number":"pith:CEIXJXUE","schema_version":"1.0","canonical_sha256":"111174de84700d77349d327b88a76c14b8b1f1e6a890acae466335a0cfa3d439","source":{"kind":"arxiv","id":"1603.00973","version":1},"attestation_state":"computed","paper":{"title":"Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yifeng Zhang, Zachary Friggstad","submitted_at":"2016-03-03T05:14:05Z","abstract_excerpt":"Budgeted Red-Blue Median is a generalization of classic $k$-Median in that there are two sets of facilities, say $\\mathcal{R}$ and $\\mathcal{B}$, that can be used to serve clients located in some metric space. The goal is to open $k_r$ facilities in $\\mathcal{R}$ and $k_b$ facilities in $\\mathcal{B}$ for some given bounds $k_r, k_b$ and connect each client to their nearest open facility in a way that minimizes the total connection cost.\n  We extend work by Hajiaghayi, Khandekar, and Kortsarz [2012] and show that a multiple-swap local search heuristic can be used to obtain a $(5+\\epsilon)$-appr"},"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":"1603.00973","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-03T05:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"cc4a6aeb3e85f66d9a1edc26401256e9629cc4492c64a31d54e3147bac21f043","abstract_canon_sha256":"578c032edba59b9d94a7caf853a85ed1fe7ac5dc3122072257053d6766102d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:39.976843Z","signature_b64":"M1u4fmb+9FRyToQteQooloWQ9lapAR8PsMa5tXgxioRcJox2zi+bMoDcbwaV+JyPIM+M1UFcGeBNBtB5f5P0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111174de84700d77349d327b88a76c14b8b1f1e6a890acae466335a0cfa3d439","last_reissued_at":"2026-05-18T01:19:39.976188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:39.976188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yifeng Zhang, Zachary Friggstad","submitted_at":"2016-03-03T05:14:05Z","abstract_excerpt":"Budgeted Red-Blue Median is a generalization of classic $k$-Median in that there are two sets of facilities, say $\\mathcal{R}$ and $\\mathcal{B}$, that can be used to serve clients located in some metric space. The goal is to open $k_r$ facilities in $\\mathcal{R}$ and $k_b$ facilities in $\\mathcal{B}$ for some given bounds $k_r, k_b$ and connect each client to their nearest open facility in a way that minimizes the total connection cost.\n  We extend work by Hajiaghayi, Khandekar, and Kortsarz [2012] and show that a multiple-swap local search heuristic can be used to obtain a $(5+\\epsilon)$-appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00973","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":"1603.00973","created_at":"2026-05-18T01:19:39.976283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00973v1","created_at":"2026-05-18T01:19:39.976283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00973","created_at":"2026-05-18T01:19:39.976283+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEIXJXUEOAGX","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEIXJXUEOAGXONE5","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEIXJXUE","created_at":"2026-05-18T12:30:09.641336+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/CEIXJXUEOAGXONE5GJ5YRJ3MCS","json":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS.json","graph_json":"https://pith.science/api/pith-number/CEIXJXUEOAGXONE5GJ5YRJ3MCS/graph.json","events_json":"https://pith.science/api/pith-number/CEIXJXUEOAGXONE5GJ5YRJ3MCS/events.json","paper":"https://pith.science/paper/CEIXJXUE"},"agent_actions":{"view_html":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS","download_json":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS.json","view_paper":"https://pith.science/paper/CEIXJXUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00973&json=true","fetch_graph":"https://pith.science/api/pith-number/CEIXJXUEOAGXONE5GJ5YRJ3MCS/graph.json","fetch_events":"https://pith.science/api/pith-number/CEIXJXUEOAGXONE5GJ5YRJ3MCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/action/storage_attestation","attest_author":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/action/author_attestation","sign_citation":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/action/citation_signature","submit_replication":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/action/replication_record"}},"created_at":"2026-05-18T01:19:39.976283+00:00","updated_at":"2026-05-18T01:19:39.976283+00:00"}