{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ODM3PABCV3GDV7HZ3G5PGAWG7C","short_pith_number":"pith:ODM3PABC","canonical_record":{"source":{"id":"2502.05888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T13:01:50Z","cross_cats_sorted":[],"title_canon_sha256":"0fc94b59b43e05e80825cd99fd1e716f3fd0dcbfa8a9a3d3fc553748ee6c8bbe","abstract_canon_sha256":"ec1d92cdaf29e366835f2c89d0da8e3ea8d62f1d0d90bb534cbe5b0e48847fd1"},"schema_version":"1.0"},"canonical_sha256":"70d9b78022aecc3afcf9d9baf302c6f896eca1a34ff2ba802cdd058e381d683a","source":{"kind":"arxiv","id":"2502.05888","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05888","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05888v1","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05888","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_12","alias_value":"ODM3PABCV3GD","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_16","alias_value":"ODM3PABCV3GDV7HZ","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_8","alias_value":"ODM3PABC","created_at":"2026-07-05T10:11:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ODM3PABCV3GDV7HZ3G5PGAWG7C","target":"record","payload":{"canonical_record":{"source":{"id":"2502.05888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T13:01:50Z","cross_cats_sorted":[],"title_canon_sha256":"0fc94b59b43e05e80825cd99fd1e716f3fd0dcbfa8a9a3d3fc553748ee6c8bbe","abstract_canon_sha256":"ec1d92cdaf29e366835f2c89d0da8e3ea8d62f1d0d90bb534cbe5b0e48847fd1"},"schema_version":"1.0"},"canonical_sha256":"70d9b78022aecc3afcf9d9baf302c6f896eca1a34ff2ba802cdd058e381d683a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:44.763463Z","signature_b64":"0nnndmwxZkFOR4vr/IivhpMYLysmTlyti/1kY9miQD3n/1i+1zjkdfl9e+lPt8+oKLUqGDpHa2hO8j78cHrmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d9b78022aecc3afcf9d9baf302c6f896eca1a34ff2ba802cdd058e381d683a","last_reissued_at":"2026-07-05T10:11:44.762983Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:44.762983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.05888","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-07-05T10:11:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKlVjMzUYj88p9IGk2MuKLi6qSlwtIQmKu1TTBZ0PzU3Dz5EqKWA5TeYL+vaPGXY8y95VmFc/zAjGGzwOKD2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:29:35.076551Z"},"content_sha256":"91584c6612c72b277fcfb8cdad2365bd9edf7358515bfef2ec1b7006343ba572","schema_version":"1.0","event_id":"sha256:91584c6612c72b277fcfb8cdad2365bd9edf7358515bfef2ec1b7006343ba572"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ODM3PABCV3GDV7HZ3G5PGAWG7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Approximation Algorithms for k-Center via Data Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anurag Murty Naredla, Arnold Filtser, Ioannis Psarros, Qiaoyuan Yang, Qin Zhang, Shaofeng H.-C. Jiang, Yi Li","submitted_at":"2025-02-09T13:01:50Z","abstract_excerpt":"We study efficient algorithms for the Euclidean $k$-Center problem, focusing on the regime of large $k$. We take the approach of data reduction by considering $\\alpha$-coreset, which is a small subset $S$ of the dataset $P$ such that any $\\beta$-approximation on $S$ is an $(\\alpha + \\beta)$-approximation on $P$. We give efficient algorithms to construct coresets whose size is $k \\cdot o(n)$, which immediately speeds up existing approximation algorithms. Notably, we obtain a near-linear time $O(1)$-approximation when $k = n^c$ for any $0 < c < 1$. We validate the performance of our coresets on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05888","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.05888/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-07-05T10:11:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6nG8JnxkMEePcVjZHKRrRxKoQZk9VqGRJtB9UXPYTnztbzdpUpZSf87eKkqJ9kOMr+q5id0rPeiuCFPIPakAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:29:35.077506Z"},"content_sha256":"b97afa1ed535836941b318ef5a13d48d15eb574e7e74a143150f87a92b793a9b","schema_version":"1.0","event_id":"sha256:b97afa1ed535836941b318ef5a13d48d15eb574e7e74a143150f87a92b793a9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODM3PABCV3GDV7HZ3G5PGAWG7C/bundle.json","state_url":"https://pith.science/pith/ODM3PABCV3GDV7HZ3G5PGAWG7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODM3PABCV3GDV7HZ3G5PGAWG7C/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-17T12:29:35Z","links":{"resolver":"https://pith.science/pith/ODM3PABCV3GDV7HZ3G5PGAWG7C","bundle":"https://pith.science/pith/ODM3PABCV3GDV7HZ3G5PGAWG7C/bundle.json","state":"https://pith.science/pith/ODM3PABCV3GDV7HZ3G5PGAWG7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODM3PABCV3GDV7HZ3G5PGAWG7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ODM3PABCV3GDV7HZ3G5PGAWG7C","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":"ec1d92cdaf29e366835f2c89d0da8e3ea8d62f1d0d90bb534cbe5b0e48847fd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T13:01:50Z","title_canon_sha256":"0fc94b59b43e05e80825cd99fd1e716f3fd0dcbfa8a9a3d3fc553748ee6c8bbe"},"schema_version":"1.0","source":{"id":"2502.05888","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05888","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05888v1","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05888","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_12","alias_value":"ODM3PABCV3GD","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_16","alias_value":"ODM3PABCV3GDV7HZ","created_at":"2026-07-05T10:11:44Z"},{"alias_kind":"pith_short_8","alias_value":"ODM3PABC","created_at":"2026-07-05T10:11:44Z"}],"graph_snapshots":[{"event_id":"sha256:b97afa1ed535836941b318ef5a13d48d15eb574e7e74a143150f87a92b793a9b","target":"graph","created_at":"2026-07-05T10:11: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.05888/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study efficient algorithms for the Euclidean $k$-Center problem, focusing on the regime of large $k$. We take the approach of data reduction by considering $\\alpha$-coreset, which is a small subset $S$ of the dataset $P$ such that any $\\beta$-approximation on $S$ is an $(\\alpha + \\beta)$-approximation on $P$. We give efficient algorithms to construct coresets whose size is $k \\cdot o(n)$, which immediately speeds up existing approximation algorithms. Notably, we obtain a near-linear time $O(1)$-approximation when $k = n^c$ for any $0 < c < 1$. We validate the performance of our coresets on ","authors_text":"Anurag Murty Naredla, Arnold Filtser, Ioannis Psarros, Qiaoyuan Yang, Qin Zhang, Shaofeng H.-C. Jiang, Yi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T13:01:50Z","title":"Faster Approximation Algorithms for k-Center via Data Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05888","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:91584c6612c72b277fcfb8cdad2365bd9edf7358515bfef2ec1b7006343ba572","target":"record","created_at":"2026-07-05T10:11: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":"ec1d92cdaf29e366835f2c89d0da8e3ea8d62f1d0d90bb534cbe5b0e48847fd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-09T13:01:50Z","title_canon_sha256":"0fc94b59b43e05e80825cd99fd1e716f3fd0dcbfa8a9a3d3fc553748ee6c8bbe"},"schema_version":"1.0","source":{"id":"2502.05888","kind":"arxiv","version":1}},"canonical_sha256":"70d9b78022aecc3afcf9d9baf302c6f896eca1a34ff2ba802cdd058e381d683a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70d9b78022aecc3afcf9d9baf302c6f896eca1a34ff2ba802cdd058e381d683a","first_computed_at":"2026-07-05T10:11:44.762983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:44.762983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0nnndmwxZkFOR4vr/IivhpMYLysmTlyti/1kY9miQD3n/1i+1zjkdfl9e+lPt8+oKLUqGDpHa2hO8j78cHrmAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:44.763463Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05888","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91584c6612c72b277fcfb8cdad2365bd9edf7358515bfef2ec1b7006343ba572","sha256:b97afa1ed535836941b318ef5a13d48d15eb574e7e74a143150f87a92b793a9b"],"state_sha256":"7f9e11b48c3fb69d44d9011a76953fb654139b6b1315864cc89007bc41d9ca1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/TgNjeJTTHFcwC0ozfWeWlSium7Uw8Pddcdg9HUA17MjsXG84MoAZmG2ZyIGrbWrDa8Pu3ue/7DVFqTINp1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:29:35.136179Z","bundle_sha256":"7d72789595e8d514995d3b23b6991322c6146cfcf897e213bd896ab443cd02a7"}}