{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BZHVBEFNDVGF4XWPL3NPUXJ4EJ","short_pith_number":"pith:BZHVBEFN","canonical_record":{"source":{"id":"1211.0243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T18:02:58Z","cross_cats_sorted":[],"title_canon_sha256":"6c197d198dba283bd0e8500cee0caea02469981f2ebfd68bf8a6f8c4fb7ca750","abstract_canon_sha256":"7799b420cc07d5620974024ae70e18f0c9f552042c234405ce034088fa0d8ccd"},"schema_version":"1.0"},"canonical_sha256":"0e4f5090ad1d4c5e5ecf5edafa5d3c22643e80b236745c3f80764c6865e815e2","source":{"kind":"arxiv","id":"1211.0243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0243","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0243v1","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0243","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"BZHVBEFNDVGF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BZHVBEFNDVGF4XWP","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BZHVBEFN","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BZHVBEFNDVGF4XWPL3NPUXJ4EJ","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T18:02:58Z","cross_cats_sorted":[],"title_canon_sha256":"6c197d198dba283bd0e8500cee0caea02469981f2ebfd68bf8a6f8c4fb7ca750","abstract_canon_sha256":"7799b420cc07d5620974024ae70e18f0c9f552042c234405ce034088fa0d8ccd"},"schema_version":"1.0"},"canonical_sha256":"0e4f5090ad1d4c5e5ecf5edafa5d3c22643e80b236745c3f80764c6865e815e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:42.614129Z","signature_b64":"8hQvWLUzefyt7mByJ1AN1l2C+EXVNCFO66wgCANKKWCmY4AQkcxEy4f47gLMarJDLWbdIPbJrRACSV18J40TDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e4f5090ad1d4c5e5ecf5edafa5d3c22643e80b236745c3f80764c6865e815e2","last_reissued_at":"2026-05-18T03:41:42.613327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:42.613327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0243","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-18T03:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LG5b9u6DmGnXCMeuS4k9RFpAfruNAPeCl4iyt4JYbsEFO5ftIzaZ1IyXBv2zW9vXP3uQ4lQl1w9XyiF2r6eJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:02:39.732994Z"},"content_sha256":"6edebd56c108628bb29abaa288daacad9bc56c4312da3eecb570fb51e9530b0e","schema_version":"1.0","event_id":"sha256:6edebd56c108628bb29abaa288daacad9bc56c4312da3eecb570fb51e9530b0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BZHVBEFNDVGF4XWPL3NPUXJ4EJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating $k$-Median via Pseudo-Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ola Svensson, Shi Li","submitted_at":"2012-11-01T18:02:58Z","abstract_excerpt":"We present a novel approximation algorithm for $k$-median that achieves an approximation guarantee of\n  $1+\\sqrt{3}+\\epsilon$, improving upon the decade-old ratio of $3+\\epsilon$. Our approach is based on two components, each of which, we believe, is of independent interest.\n  First, we show that in order to give an $\\alpha$-approximation algorithm for $k$-median, it is sufficient to give a \\emph{pseudo-approximation algorithm} that finds an $\\alpha$-approximate solution by opening $k+O(1)$ facilities. This is a rather surprising result as there exist instances for which opening $k+1$ faciliti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0243","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-18T03:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3ihLkQQwnDcQVAzrvm6bBqhiay6Y+KU5oyTuWdv8DsbYx3Pm0YTC99WD+PADvuF3j7+DQuVwswIapOlB/j6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:02:39.733348Z"},"content_sha256":"e49b6fbb3e75e14fd4e590b9ca90ee5a0b78bccbc3c56cada0bd64ac9b0a9ad2","schema_version":"1.0","event_id":"sha256:e49b6fbb3e75e14fd4e590b9ca90ee5a0b78bccbc3c56cada0bd64ac9b0a9ad2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZHVBEFNDVGF4XWPL3NPUXJ4EJ/bundle.json","state_url":"https://pith.science/pith/BZHVBEFNDVGF4XWPL3NPUXJ4EJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZHVBEFNDVGF4XWPL3NPUXJ4EJ/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-08-20T04:02:39Z","links":{"resolver":"https://pith.science/pith/BZHVBEFNDVGF4XWPL3NPUXJ4EJ","bundle":"https://pith.science/pith/BZHVBEFNDVGF4XWPL3NPUXJ4EJ/bundle.json","state":"https://pith.science/pith/BZHVBEFNDVGF4XWPL3NPUXJ4EJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZHVBEFNDVGF4XWPL3NPUXJ4EJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BZHVBEFNDVGF4XWPL3NPUXJ4EJ","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":"7799b420cc07d5620974024ae70e18f0c9f552042c234405ce034088fa0d8ccd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T18:02:58Z","title_canon_sha256":"6c197d198dba283bd0e8500cee0caea02469981f2ebfd68bf8a6f8c4fb7ca750"},"schema_version":"1.0","source":{"id":"1211.0243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0243","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0243v1","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0243","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"BZHVBEFNDVGF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BZHVBEFNDVGF4XWP","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BZHVBEFN","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:e49b6fbb3e75e14fd4e590b9ca90ee5a0b78bccbc3c56cada0bd64ac9b0a9ad2","target":"graph","created_at":"2026-05-18T03:41:42Z","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 present a novel approximation algorithm for $k$-median that achieves an approximation guarantee of\n  $1+\\sqrt{3}+\\epsilon$, improving upon the decade-old ratio of $3+\\epsilon$. Our approach is based on two components, each of which, we believe, is of independent interest.\n  First, we show that in order to give an $\\alpha$-approximation algorithm for $k$-median, it is sufficient to give a \\emph{pseudo-approximation algorithm} that finds an $\\alpha$-approximate solution by opening $k+O(1)$ facilities. This is a rather surprising result as there exist instances for which opening $k+1$ faciliti","authors_text":"Ola Svensson, Shi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T18:02:58Z","title":"Approximating $k$-Median via Pseudo-Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0243","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:6edebd56c108628bb29abaa288daacad9bc56c4312da3eecb570fb51e9530b0e","target":"record","created_at":"2026-05-18T03:41:42Z","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":"7799b420cc07d5620974024ae70e18f0c9f552042c234405ce034088fa0d8ccd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-01T18:02:58Z","title_canon_sha256":"6c197d198dba283bd0e8500cee0caea02469981f2ebfd68bf8a6f8c4fb7ca750"},"schema_version":"1.0","source":{"id":"1211.0243","kind":"arxiv","version":1}},"canonical_sha256":"0e4f5090ad1d4c5e5ecf5edafa5d3c22643e80b236745c3f80764c6865e815e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e4f5090ad1d4c5e5ecf5edafa5d3c22643e80b236745c3f80764c6865e815e2","first_computed_at":"2026-05-18T03:41:42.613327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:42.613327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8hQvWLUzefyt7mByJ1AN1l2C+EXVNCFO66wgCANKKWCmY4AQkcxEy4f47gLMarJDLWbdIPbJrRACSV18J40TDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:42.614129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6edebd56c108628bb29abaa288daacad9bc56c4312da3eecb570fb51e9530b0e","sha256:e49b6fbb3e75e14fd4e590b9ca90ee5a0b78bccbc3c56cada0bd64ac9b0a9ad2"],"state_sha256":"a2cbad4cff4842df5eb6db33db992c1c69e0e6ddbb7a7498575989ada688b09a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+I2F0A+anD6Y3wgNy0MEyJQSuKefMzxM72eBNRqvW2fa35Tjyqq7aOO49VjGK2uVmZfT9AuIAtYh/LVq10OiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:02:39.735514Z","bundle_sha256":"7edfca9c8d883cb1b35ae7ff247b6cf5e7ecae6d66a96c0b3f9e38d7b52e741d"}}