{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KKRWS76XVYPKCK4VBSGXHXKTU7","short_pith_number":"pith:KKRWS76X","canonical_record":{"source":{"id":"1608.01700","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T21:12:49Z","cross_cats_sorted":[],"title_canon_sha256":"5570c696cbb597f8674a6475e357a06b39145c7b3e6f61c0907cbfae684b1290","abstract_canon_sha256":"efed1a7e0fa9f32eed40f0f91fc79344d1f3af9df58b376fbdfb78cba954f9a8"},"schema_version":"1.0"},"canonical_sha256":"52a3697fd7ae1ea12b950c8d73dd53a7d43df95c35099c287d1e91b28d13ecb3","source":{"kind":"arxiv","id":"1608.01700","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01700","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01700v3","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01700","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"KKRWS76XVYPK","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKRWS76XVYPKCK4V","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKRWS76X","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KKRWS76XVYPKCK4VBSGXHXKTU7","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01700","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T21:12:49Z","cross_cats_sorted":[],"title_canon_sha256":"5570c696cbb597f8674a6475e357a06b39145c7b3e6f61c0907cbfae684b1290","abstract_canon_sha256":"efed1a7e0fa9f32eed40f0f91fc79344d1f3af9df58b376fbdfb78cba954f9a8"},"schema_version":"1.0"},"canonical_sha256":"52a3697fd7ae1ea12b950c8d73dd53a7d43df95c35099c287d1e91b28d13ecb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.100896Z","signature_b64":"y9u1y+wV1fs7LsooVqHaBkFUsV0cCXJ17QBAZK0QwYpzfPTIxYGV/1gz0YUsRZUUzmFzYbt+21NhfUafZNAABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52a3697fd7ae1ea12b950c8d73dd53a7d43df95c35099c287d1e91b28d13ecb3","last_reissued_at":"2026-05-18T01:00:19.100173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.100173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01700","source_version":3,"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:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YF10eL5j6pRFcVQ1ge6q2WoHt8R/9M7jCqEP47m3LWdS52QK8X2R6UqQpLcqD0t2ztbVYgJqJd+hAvcrtFcBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:25:07.443236Z"},"content_sha256":"e3758a9d2e73bff8f5f7ab149dc26f7c440391e5f23cb10346cff61b5e838594","schema_version":"1.0","event_id":"sha256:e3758a9d2e73bff8f5f7ab149dc26f7c440391e5f23cb10346cff61b5e838594"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KKRWS76XVYPKCK4VBSGXHXKTU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Sara Ahmadian","submitted_at":"2016-08-04T21:12:49Z","abstract_excerpt":"We consider clustering problems with {\\em non-uniform lower bounds and outliers}, and obtain the {\\em first approximation guarantees} for these problems. We have a set $\\F$ of facilities with lower bounds $\\{L_i\\}_{i\\in\\F}$ and a set $\\D$ of clients located in a common metric space $\\{c(i,j)\\}_{i,j\\in\\F\\cup\\D}$, and bounds $k$, $m$. A feasible solution is a pair $\\bigl(S\\sse\\F,\\sigma:\\D\\mapsto S\\cup\\{\\mathsf{out}\\}\\bigr)$, where $\\sigma$ specifies the client assignments, such that $|S|\\leq k$, $|\\sigma^{-1}(i)|\\geq L_i$ for all $i\\in S$, and $|\\sigma^{-1}(\\mathsf{out})|\\leq m$. In the {\\em low"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01700","kind":"arxiv","version":3},"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:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mxbkh3oi0IqA0vAVqsTBe0miYOgq/ErOzC9jPch043e9mc7CSXTn8s41IKpoD64njwk7uMNoM2oH9sX3BF3sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:25:07.443629Z"},"content_sha256":"cbe5bc0863dac7ad1e68f574509dbbcfd2b78b30b06e57c21a25f833431b99a1","schema_version":"1.0","event_id":"sha256:cbe5bc0863dac7ad1e68f574509dbbcfd2b78b30b06e57c21a25f833431b99a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKRWS76XVYPKCK4VBSGXHXKTU7/bundle.json","state_url":"https://pith.science/pith/KKRWS76XVYPKCK4VBSGXHXKTU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKRWS76XVYPKCK4VBSGXHXKTU7/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-31T19:25:07Z","links":{"resolver":"https://pith.science/pith/KKRWS76XVYPKCK4VBSGXHXKTU7","bundle":"https://pith.science/pith/KKRWS76XVYPKCK4VBSGXHXKTU7/bundle.json","state":"https://pith.science/pith/KKRWS76XVYPKCK4VBSGXHXKTU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKRWS76XVYPKCK4VBSGXHXKTU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KKRWS76XVYPKCK4VBSGXHXKTU7","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":"efed1a7e0fa9f32eed40f0f91fc79344d1f3af9df58b376fbdfb78cba954f9a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T21:12:49Z","title_canon_sha256":"5570c696cbb597f8674a6475e357a06b39145c7b3e6f61c0907cbfae684b1290"},"schema_version":"1.0","source":{"id":"1608.01700","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01700","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01700v3","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01700","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"KKRWS76XVYPK","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKRWS76XVYPKCK4V","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKRWS76X","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:cbe5bc0863dac7ad1e68f574509dbbcfd2b78b30b06e57c21a25f833431b99a1","target":"graph","created_at":"2026-05-18T01:00:19Z","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 clustering problems with {\\em non-uniform lower bounds and outliers}, and obtain the {\\em first approximation guarantees} for these problems. We have a set $\\F$ of facilities with lower bounds $\\{L_i\\}_{i\\in\\F}$ and a set $\\D$ of clients located in a common metric space $\\{c(i,j)\\}_{i,j\\in\\F\\cup\\D}$, and bounds $k$, $m$. A feasible solution is a pair $\\bigl(S\\sse\\F,\\sigma:\\D\\mapsto S\\cup\\{\\mathsf{out}\\}\\bigr)$, where $\\sigma$ specifies the client assignments, such that $|S|\\leq k$, $|\\sigma^{-1}(i)|\\geq L_i$ for all $i\\in S$, and $|\\sigma^{-1}(\\mathsf{out})|\\leq m$. In the {\\em low","authors_text":"Chaitanya Swamy, Sara Ahmadian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T21:12:49Z","title":"Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01700","kind":"arxiv","version":3},"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:e3758a9d2e73bff8f5f7ab149dc26f7c440391e5f23cb10346cff61b5e838594","target":"record","created_at":"2026-05-18T01:00:19Z","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":"efed1a7e0fa9f32eed40f0f91fc79344d1f3af9df58b376fbdfb78cba954f9a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T21:12:49Z","title_canon_sha256":"5570c696cbb597f8674a6475e357a06b39145c7b3e6f61c0907cbfae684b1290"},"schema_version":"1.0","source":{"id":"1608.01700","kind":"arxiv","version":3}},"canonical_sha256":"52a3697fd7ae1ea12b950c8d73dd53a7d43df95c35099c287d1e91b28d13ecb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52a3697fd7ae1ea12b950c8d73dd53a7d43df95c35099c287d1e91b28d13ecb3","first_computed_at":"2026-05-18T01:00:19.100173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:19.100173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y9u1y+wV1fs7LsooVqHaBkFUsV0cCXJ17QBAZK0QwYpzfPTIxYGV/1gz0YUsRZUUzmFzYbt+21NhfUafZNAABw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:19.100896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01700","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3758a9d2e73bff8f5f7ab149dc26f7c440391e5f23cb10346cff61b5e838594","sha256:cbe5bc0863dac7ad1e68f574509dbbcfd2b78b30b06e57c21a25f833431b99a1"],"state_sha256":"4e8c7076ddf4b0fbf67c3df8ee7be0fd7b095e469f7072dbf3df1b1f9f7bc596"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ey1hjrt0ex4RE6uHRNxe6kwp3FO3+RmZsewefDzi7bdGtB7JZJ6z0vIZe3oH+ljVOH/THCfUigsEZv7FJUg9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:25:07.445995Z","bundle_sha256":"6e6934a62231959996953c989b1d105857034e4ac76dd5a37cb1311c09ad63e3"}}