{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TIRTU7BJB4KZBB4I2SNJKNGBNQ","short_pith_number":"pith:TIRTU7BJ","canonical_record":{"source":{"id":"1711.08715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-23T14:42:24Z","cross_cats_sorted":[],"title_canon_sha256":"a2dcfc503c2d212747ce560c037ec36685f95eed5556bcc0cb38cd27b39cde8a","abstract_canon_sha256":"36ceac96477d0cd11cc3ca10478bef39b0c613f2696c44b6934cd85b973246e7"},"schema_version":"1.0"},"canonical_sha256":"9a233a7c290f15908788d49a9534c16c2f1530d83c2feeb55abb584eea97d7ac","source":{"kind":"arxiv","id":"1711.08715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08715","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08715v1","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08715","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"TIRTU7BJB4KZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TIRTU7BJB4KZBB4I","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TIRTU7BJ","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TIRTU7BJB4KZBB4I2SNJKNGBNQ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-23T14:42:24Z","cross_cats_sorted":[],"title_canon_sha256":"a2dcfc503c2d212747ce560c037ec36685f95eed5556bcc0cb38cd27b39cde8a","abstract_canon_sha256":"36ceac96477d0cd11cc3ca10478bef39b0c613f2696c44b6934cd85b973246e7"},"schema_version":"1.0"},"canonical_sha256":"9a233a7c290f15908788d49a9534c16c2f1530d83c2feeb55abb584eea97d7ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:44.318395Z","signature_b64":"qN1pz3o0eUnlM/WUDGamp5vwKKWufsubj0YZl35yAt2pobKXOTVwhbBs+GiwBbzmok96Sx/hPRfE/TuRLmM6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a233a7c290f15908788d49a9534c16c2f1530d83c2feeb55abb584eea97d7ac","last_reissued_at":"2026-05-18T00:29:44.317804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:44.317804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08715","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-18T00:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjI8/Qcz0kGqJpsDqIp1DB1fFXS8IrfUeK1G6AhVpdoir2MuX5ktc4Ubn3aXcBEszn1tcnw9YPbxJchuViqEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:04:18.263450Z"},"content_sha256":"7585a93a8443b5d1835a033adc0e4d35a5a39657da7fb5cf803e80299437a57d","schema_version":"1.0","event_id":"sha256:7585a93a8443b5d1835a033adc0e4d35a5a39657da7fb5cf803e80299437a57d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TIRTU7BJB4KZBB4I2SNJKNGBNQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interpolating between $k$-Median and $k$-Center: Approximation Algorithms for Ordered $k$-Median","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","submitted_at":"2017-11-23T14:42:24Z","abstract_excerpt":"We consider a generalization of $k$-median and $k$-center, called the {\\em ordered $k$-median} problem. In this problem, we are given a metric space $(\\mathcal{D},\\{c_{ij}\\})$ with $n=|\\mathcal{D}|$ points, and a non-increasing weight vector $w\\in\\mathbb{R}_+^n$, and the goal is to open $k$ centers and assign each point each point $j\\in\\mathcal{D}$ to a center so as to minimize $w_1\\cdot\\text{(largest assignment cost)}+w_2\\cdot\\text{(second-largest assignment cost)}+\\ldots+w_n\\cdot\\text{($n$-th largest assignment cost)}$. We give an $(18+\\epsilon)$-approximation algorithm for this problem. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08715","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-18T00:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJceoScoqEuIAVk23nfgMJj8s0V8dD9nfFXeJBBgLJI95gocqjDNIL/wxCOa6mCasgLppoi8/h3Pyzr2sjIqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:04:18.263794Z"},"content_sha256":"3796fd07e8c957feb398514ed2901054360b1f0ec89366b235371eb7e40677f1","schema_version":"1.0","event_id":"sha256:3796fd07e8c957feb398514ed2901054360b1f0ec89366b235371eb7e40677f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIRTU7BJB4KZBB4I2SNJKNGBNQ/bundle.json","state_url":"https://pith.science/pith/TIRTU7BJB4KZBB4I2SNJKNGBNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIRTU7BJB4KZBB4I2SNJKNGBNQ/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-01T18:04:18Z","links":{"resolver":"https://pith.science/pith/TIRTU7BJB4KZBB4I2SNJKNGBNQ","bundle":"https://pith.science/pith/TIRTU7BJB4KZBB4I2SNJKNGBNQ/bundle.json","state":"https://pith.science/pith/TIRTU7BJB4KZBB4I2SNJKNGBNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIRTU7BJB4KZBB4I2SNJKNGBNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TIRTU7BJB4KZBB4I2SNJKNGBNQ","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":"36ceac96477d0cd11cc3ca10478bef39b0c613f2696c44b6934cd85b973246e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-23T14:42:24Z","title_canon_sha256":"a2dcfc503c2d212747ce560c037ec36685f95eed5556bcc0cb38cd27b39cde8a"},"schema_version":"1.0","source":{"id":"1711.08715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08715","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08715v1","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08715","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"TIRTU7BJB4KZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TIRTU7BJB4KZBB4I","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TIRTU7BJ","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:3796fd07e8c957feb398514ed2901054360b1f0ec89366b235371eb7e40677f1","target":"graph","created_at":"2026-05-18T00:29:44Z","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 consider a generalization of $k$-median and $k$-center, called the {\\em ordered $k$-median} problem. In this problem, we are given a metric space $(\\mathcal{D},\\{c_{ij}\\})$ with $n=|\\mathcal{D}|$ points, and a non-increasing weight vector $w\\in\\mathbb{R}_+^n$, and the goal is to open $k$ centers and assign each point each point $j\\in\\mathcal{D}$ to a center so as to minimize $w_1\\cdot\\text{(largest assignment cost)}+w_2\\cdot\\text{(second-largest assignment cost)}+\\ldots+w_n\\cdot\\text{($n$-th largest assignment cost)}$. We give an $(18+\\epsilon)$-approximation algorithm for this problem. Our","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-23T14:42:24Z","title":"Interpolating between $k$-Median and $k$-Center: Approximation Algorithms for Ordered $k$-Median"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08715","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:7585a93a8443b5d1835a033adc0e4d35a5a39657da7fb5cf803e80299437a57d","target":"record","created_at":"2026-05-18T00:29:44Z","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":"36ceac96477d0cd11cc3ca10478bef39b0c613f2696c44b6934cd85b973246e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-23T14:42:24Z","title_canon_sha256":"a2dcfc503c2d212747ce560c037ec36685f95eed5556bcc0cb38cd27b39cde8a"},"schema_version":"1.0","source":{"id":"1711.08715","kind":"arxiv","version":1}},"canonical_sha256":"9a233a7c290f15908788d49a9534c16c2f1530d83c2feeb55abb584eea97d7ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a233a7c290f15908788d49a9534c16c2f1530d83c2feeb55abb584eea97d7ac","first_computed_at":"2026-05-18T00:29:44.317804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:44.317804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qN1pz3o0eUnlM/WUDGamp5vwKKWufsubj0YZl35yAt2pobKXOTVwhbBs+GiwBbzmok96Sx/hPRfE/TuRLmM6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:44.318395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7585a93a8443b5d1835a033adc0e4d35a5a39657da7fb5cf803e80299437a57d","sha256:3796fd07e8c957feb398514ed2901054360b1f0ec89366b235371eb7e40677f1"],"state_sha256":"2df7ba0e95cfd5738320d69c8411c67dcff443a829e177c149471c15b604f0af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V11n7YJ8gZxKpnm+to22BhMeyNj7WEte8tFIPAs18lALoWq81S1OiI+VKiAGa5h0lWi2HUwDkQX3AIisjPr3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:04:18.265756Z","bundle_sha256":"cc42a007ca2057e3dccc5eb89164415ab98afe8722e9a818b721e8e531b5fa3e"}}