{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VB6BLIQL6CAVV244OAUY24AN2N","short_pith_number":"pith:VB6BLIQL","canonical_record":{"source":{"id":"2503.10972","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-14T00:36:26Z","cross_cats_sorted":[],"title_canon_sha256":"4a73537cdf616f7f455ce1d7cbdb130f7b3f135071b59cbaa9262a2509f60dc4","abstract_canon_sha256":"a58b65a9702a1d271d7cc73e51c5aadf614a782cd9e58a2ce08469623d4c0e73"},"schema_version":"1.0"},"canonical_sha256":"a87c15a20bf0815aeb9c70298d700dd376ee2bf8e3e6d140d35016598145a3d9","source":{"kind":"arxiv","id":"2503.10972","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10972","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10972v2","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10972","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"VB6BLIQL6CAV","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"pith_short_16","alias_value":"VB6BLIQL6CAVV244","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"pith_short_8","alias_value":"VB6BLIQL","created_at":"2026-05-21T01:04:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VB6BLIQL6CAVV244OAUY24AN2N","target":"record","payload":{"canonical_record":{"source":{"id":"2503.10972","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-14T00:36:26Z","cross_cats_sorted":[],"title_canon_sha256":"4a73537cdf616f7f455ce1d7cbdb130f7b3f135071b59cbaa9262a2509f60dc4","abstract_canon_sha256":"a58b65a9702a1d271d7cc73e51c5aadf614a782cd9e58a2ce08469623d4c0e73"},"schema_version":"1.0"},"canonical_sha256":"a87c15a20bf0815aeb9c70298d700dd376ee2bf8e3e6d140d35016598145a3d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:13.333001Z","signature_b64":"oa5wMzcssIiJg4leqxiO+RfapPmU0ENvYPM9IwttVoNiGOIGTSxiYdDd18KyKDDYqMsltPis5wdmsA2EG0hzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a87c15a20bf0815aeb9c70298d700dd376ee2bf8e3e6d140d35016598145a3d9","last_reissued_at":"2026-05-21T01:04:13.332233Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:13.332233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.10972","source_version":2,"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-21T01:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgaFjWANN73YK38SRiyPy83NJ1F3zdGa/8idIMVUzU595rReT90h7BLm2rSYo6654p7QB4CVBaI1tkB2Jc2xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:57:02.300366Z"},"content_sha256":"5e4e3f9927e1820a51bf8fc482db56e1c6be61e576d7632fc22df2e1499d6d4b","schema_version":"1.0","event_id":"sha256:5e4e3f9927e1820a51bf8fc482db56e1c6be61e576d7632fc22df2e1499d6d4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VB6BLIQL6CAVV244OAUY24AN2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A $(2+\\varepsilon)$-Approximation Algorithm for Metric $k$-Median","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chris Schwiegelshohn, Euiwoong Lee, Fabrizio Grandoni, Ola Svensson, Vincent Cohen-Addad","submitted_at":"2025-03-14T00:36:26Z","abstract_excerpt":"In the classical NP-hard metric $k$-median problem, we are given a set of $n$ clients and centers with metric distances between them, along with an integer parameter $k\\geq 1$. The objective is to select a subset of $k$ open centers that minimizes the total distance from each client to its closest open center.\n  In their seminal work, Jain, Mahdian, Markakis, Saberi, and Vazirani presented the Greedy algorithm for facility location, which implies a $2$-approximation algorithm for $k$-median that opens $k$ centers in expectation. Since then, substantial research has aimed at narrowing the gap b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10972","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.10972/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-21T01:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZqPvq2ryj5SIQ0cdv2AhaEQvlvNPLnuumK3AHa6x3Tylcr4OwfGuf3afQe8SAgKlZwsJ5Jhagkas7Arnj296Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:57:02.301056Z"},"content_sha256":"2dba15a322100b70af221e6cba93c2e885c7fe72f67b5fa8da0d27d935eb33c4","schema_version":"1.0","event_id":"sha256:2dba15a322100b70af221e6cba93c2e885c7fe72f67b5fa8da0d27d935eb33c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/bundle.json","state_url":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VB6BLIQL6CAVV244OAUY24AN2N/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-25T00:57:02Z","links":{"resolver":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N","bundle":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/bundle.json","state":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VB6BLIQL6CAVV244OAUY24AN2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VB6BLIQL6CAVV244OAUY24AN2N","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":"a58b65a9702a1d271d7cc73e51c5aadf614a782cd9e58a2ce08469623d4c0e73","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-14T00:36:26Z","title_canon_sha256":"4a73537cdf616f7f455ce1d7cbdb130f7b3f135071b59cbaa9262a2509f60dc4"},"schema_version":"1.0","source":{"id":"2503.10972","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10972","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10972v2","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10972","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"VB6BLIQL6CAV","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"pith_short_16","alias_value":"VB6BLIQL6CAVV244","created_at":"2026-05-21T01:04:13Z"},{"alias_kind":"pith_short_8","alias_value":"VB6BLIQL","created_at":"2026-05-21T01:04:13Z"}],"graph_snapshots":[{"event_id":"sha256:2dba15a322100b70af221e6cba93c2e885c7fe72f67b5fa8da0d27d935eb33c4","target":"graph","created_at":"2026-05-21T01:04:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.10972/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the classical NP-hard metric $k$-median problem, we are given a set of $n$ clients and centers with metric distances between them, along with an integer parameter $k\\geq 1$. The objective is to select a subset of $k$ open centers that minimizes the total distance from each client to its closest open center.\n  In their seminal work, Jain, Mahdian, Markakis, Saberi, and Vazirani presented the Greedy algorithm for facility location, which implies a $2$-approximation algorithm for $k$-median that opens $k$ centers in expectation. Since then, substantial research has aimed at narrowing the gap b","authors_text":"Chris Schwiegelshohn, Euiwoong Lee, Fabrizio Grandoni, Ola Svensson, Vincent Cohen-Addad","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-14T00:36:26Z","title":"A $(2+\\varepsilon)$-Approximation Algorithm for Metric $k$-Median"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10972","kind":"arxiv","version":2},"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:5e4e3f9927e1820a51bf8fc482db56e1c6be61e576d7632fc22df2e1499d6d4b","target":"record","created_at":"2026-05-21T01:04:13Z","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":"a58b65a9702a1d271d7cc73e51c5aadf614a782cd9e58a2ce08469623d4c0e73","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-14T00:36:26Z","title_canon_sha256":"4a73537cdf616f7f455ce1d7cbdb130f7b3f135071b59cbaa9262a2509f60dc4"},"schema_version":"1.0","source":{"id":"2503.10972","kind":"arxiv","version":2}},"canonical_sha256":"a87c15a20bf0815aeb9c70298d700dd376ee2bf8e3e6d140d35016598145a3d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a87c15a20bf0815aeb9c70298d700dd376ee2bf8e3e6d140d35016598145a3d9","first_computed_at":"2026-05-21T01:04:13.332233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:13.332233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oa5wMzcssIiJg4leqxiO+RfapPmU0ENvYPM9IwttVoNiGOIGTSxiYdDd18KyKDDYqMsltPis5wdmsA2EG0hzDQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:13.333001Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.10972","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e4e3f9927e1820a51bf8fc482db56e1c6be61e576d7632fc22df2e1499d6d4b","sha256:2dba15a322100b70af221e6cba93c2e885c7fe72f67b5fa8da0d27d935eb33c4"],"state_sha256":"2ef7f09f06bf9734d73fe22866e5c52461166ef3cc42d2d02095c843bfddfc03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PB39nRzIkAj6Sm8RzI5f7DaBUwEgYnbRKXo8xr6OAaMcnG9DLIstmBVfjF1h25eEFDDdDKtPI/XaXcobMakaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T00:57:02.303800Z","bundle_sha256":"0a3d57e16dfc94fef94b4a1220abe145bfe182e22b34b5bbd45971cce57a7020"}}