{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CEIXJXUEOAGXONE5GJ5YRJ3MCS","short_pith_number":"pith:CEIXJXUE","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"},"canonical_sha256":"111174de84700d77349d327b88a76c14b8b1f1e6a890acae466335a0cfa3d439","source":{"kind":"arxiv","id":"1603.00973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00973","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00973v1","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00973","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"pith_short_12","alias_value":"CEIXJXUEOAGX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CEIXJXUEOAGXONE5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CEIXJXUE","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CEIXJXUEOAGXONE5GJ5YRJ3MCS","target":"record","payload":{"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"},"canonical_sha256":"111174de84700d77349d327b88a76c14b8b1f1e6a890acae466335a0cfa3d439","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"},"source_kind":"arxiv","source_id":"1603.00973","source_version":1,"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-18T01:19:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2rdAvIVM5u8K1Cfdqpqo934kt/ZXefKRVTXWEBYgsBgJo5GqrrAoaXb9j0l7IaVZjXNKc3u/rWQIZR9dxFnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:31.883386Z"},"content_sha256":"4c6258a13160d01149bba3ade35706846c43e1f9594bf7ba83ac5876a8eef0e7","schema_version":"1.0","event_id":"sha256:4c6258a13160d01149bba3ade35706846c43e1f9594bf7ba83ac5876a8eef0e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CEIXJXUEOAGXONE5GJ5YRJ3MCS","target":"graph","payload":{"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"},"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-18T01:19:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMR65RodVvTS3BMSKoBH6+rBzlB1R/7qog++ptiaxDyiWSAUL33b1p9tYmA63/27vGciVegMd15/4QZy0WChCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:31.884061Z"},"content_sha256":"b485c55aa518482538c8038d2654a4e67bdab3963212397d8c3ee9e64b7c9b5c","schema_version":"1.0","event_id":"sha256:b485c55aa518482538c8038d2654a4e67bdab3963212397d8c3ee9e64b7c9b5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/bundle.json","state_url":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/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-27T15:47:31Z","links":{"resolver":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS","bundle":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/bundle.json","state":"https://pith.science/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEIXJXUEOAGXONE5GJ5YRJ3MCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CEIXJXUEOAGXONE5GJ5YRJ3MCS","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":"578c032edba59b9d94a7caf853a85ed1fe7ac5dc3122072257053d6766102d38","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-03T05:14:05Z","title_canon_sha256":"cc4a6aeb3e85f66d9a1edc26401256e9629cc4492c64a31d54e3147bac21f043"},"schema_version":"1.0","source":{"id":"1603.00973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00973","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00973v1","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00973","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"pith_short_12","alias_value":"CEIXJXUEOAGX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CEIXJXUEOAGXONE5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CEIXJXUE","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:b485c55aa518482538c8038d2654a4e67bdab3963212397d8c3ee9e64b7c9b5c","target":"graph","created_at":"2026-05-18T01:19:39Z","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":"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","authors_text":"Yifeng Zhang, Zachary Friggstad","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-03T05:14:05Z","title":"Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00973","kind":"arxiv","version":1},"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:4c6258a13160d01149bba3ade35706846c43e1f9594bf7ba83ac5876a8eef0e7","target":"record","created_at":"2026-05-18T01:19:39Z","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":"578c032edba59b9d94a7caf853a85ed1fe7ac5dc3122072257053d6766102d38","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-03T05:14:05Z","title_canon_sha256":"cc4a6aeb3e85f66d9a1edc26401256e9629cc4492c64a31d54e3147bac21f043"},"schema_version":"1.0","source":{"id":"1603.00973","kind":"arxiv","version":1}},"canonical_sha256":"111174de84700d77349d327b88a76c14b8b1f1e6a890acae466335a0cfa3d439","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"111174de84700d77349d327b88a76c14b8b1f1e6a890acae466335a0cfa3d439","first_computed_at":"2026-05-18T01:19:39.976188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:39.976188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M1u4fmb+9FRyToQteQooloWQ9lapAR8PsMa5tXgxioRcJox2zi+bMoDcbwaV+JyPIM+M1UFcGeBNBtB5f5P0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:39.976843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c6258a13160d01149bba3ade35706846c43e1f9594bf7ba83ac5876a8eef0e7","sha256:b485c55aa518482538c8038d2654a4e67bdab3963212397d8c3ee9e64b7c9b5c"],"state_sha256":"abae849446cc18cb5d33e82b672280f187cafb1a5f34547a5c2dd9b4904feda1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WU/XcmIAFo11Mei8xE8C2lHIiWKmVnWCW4+cvhH8RM1qcJScGXUYmc8ogr3bemQnDL9RGGDkNficu4dAIRhCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:47:31.887824Z","bundle_sha256":"321d47e83439afd3d933b0fac00ad1b0b51e717d8cc31b10c1ddf16371b4402a"}}