{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:2E4B2YBFFPPQ6RRMQJRZVMRLAZ","short_pith_number":"pith:2E4B2YBF","canonical_record":{"source":{"id":"2504.16382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-23T03:24:15Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"28ee638fcde2bd00cae06eeed26b2f53b0a9da55c704cbd35958210e778d58c9","abstract_canon_sha256":"0393c3ea13ee726b23047addb8af3df542ad48d6221f96b96394098c1f915e2b"},"schema_version":"1.0"},"canonical_sha256":"d1381d60252bdf0f462c82639ab22b0672edcb4670800d36da47a8324619d513","source":{"kind":"arxiv","id":"2504.16382","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.16382","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"2504.16382v2","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16382","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"2E4B2YBFFPPQ","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"pith_short_16","alias_value":"2E4B2YBFFPPQ6RRM","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"pith_short_8","alias_value":"2E4B2YBF","created_at":"2026-07-05T10:53:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:2E4B2YBFFPPQ6RRMQJRZVMRLAZ","target":"record","payload":{"canonical_record":{"source":{"id":"2504.16382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-23T03:24:15Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"28ee638fcde2bd00cae06eeed26b2f53b0a9da55c704cbd35958210e778d58c9","abstract_canon_sha256":"0393c3ea13ee726b23047addb8af3df542ad48d6221f96b96394098c1f915e2b"},"schema_version":"1.0"},"canonical_sha256":"d1381d60252bdf0f462c82639ab22b0672edcb4670800d36da47a8324619d513","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:55.087334Z","signature_b64":"CiYb2tTE7I6q+fmZ5o5IdfMQa2xdqXLpRe6m83MUz9gVTRtPj1IGmEWzFKD2XaDeskxY/phUZfSt5S+u1gzaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1381d60252bdf0f462c82639ab22b0672edcb4670800d36da47a8324619d513","last_reissued_at":"2026-07-05T10:53:55.086810Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:55.086810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.16382","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-07-05T10:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skrYZ4ArvRYIKBjkm1Gu39uLUOOVqdWX3zRNBCqISkwxt3cM+P9STzlqjyf8KO0a++bNF5en5DP08F3vB7z1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:23:17.566559Z"},"content_sha256":"0509af625105d75b274f9a4bef59ad4f094111af1192581cc1b96cea128c6b2f","schema_version":"1.0","event_id":"sha256:0509af625105d75b274f9a4bef59ad4f094111af1192581cc1b96cea128c6b2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:2E4B2YBFFPPQ6RRMQJRZVMRLAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Scalable MPC Algorithms for Euclidean k-Center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Artur Czumaj, Guichen Gao, Mohsen Ghaffari, Shaofeng H.-C. Jiang","submitted_at":"2025-04-23T03:24:15Z","abstract_excerpt":"The $k$-center problem is a fundamental optimization problem with numerous applications in machine learning, data analysis, data mining, and communication networks. The $k$-center problem has been extensively studied in the classical sequential setting for several decades, and more recently there have been some efforts in understanding the problem in parallel computing, on the Massively Parallel Computation (MPC) model. For now, we have a good understanding of $k$-center in the case where each local MPC machine has sufficient local memory to store some representatives from each cluster, that i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16382","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/2504.16382/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:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fQPR6orJEdob2SzELmgt+x78fP1oLxlNmvT+sXYW9P+VwGsapbYwttMt5KVTd26pISwqJ4akPqEIcpcolnyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:23:17.567051Z"},"content_sha256":"bda153281f489aff7c45d73b3182db75b7bc6faf3cb6d54ae852f6cd2c650e21","schema_version":"1.0","event_id":"sha256:bda153281f489aff7c45d73b3182db75b7bc6faf3cb6d54ae852f6cd2c650e21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2E4B2YBFFPPQ6RRMQJRZVMRLAZ/bundle.json","state_url":"https://pith.science/pith/2E4B2YBFFPPQ6RRMQJRZVMRLAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2E4B2YBFFPPQ6RRMQJRZVMRLAZ/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-18T08:23:17Z","links":{"resolver":"https://pith.science/pith/2E4B2YBFFPPQ6RRMQJRZVMRLAZ","bundle":"https://pith.science/pith/2E4B2YBFFPPQ6RRMQJRZVMRLAZ/bundle.json","state":"https://pith.science/pith/2E4B2YBFFPPQ6RRMQJRZVMRLAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2E4B2YBFFPPQ6RRMQJRZVMRLAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2E4B2YBFFPPQ6RRMQJRZVMRLAZ","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":"0393c3ea13ee726b23047addb8af3df542ad48d6221f96b96394098c1f915e2b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-23T03:24:15Z","title_canon_sha256":"28ee638fcde2bd00cae06eeed26b2f53b0a9da55c704cbd35958210e778d58c9"},"schema_version":"1.0","source":{"id":"2504.16382","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.16382","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"2504.16382v2","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16382","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"2E4B2YBFFPPQ","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"pith_short_16","alias_value":"2E4B2YBFFPPQ6RRM","created_at":"2026-07-05T10:53:55Z"},{"alias_kind":"pith_short_8","alias_value":"2E4B2YBF","created_at":"2026-07-05T10:53:55Z"}],"graph_snapshots":[{"event_id":"sha256:bda153281f489aff7c45d73b3182db75b7bc6faf3cb6d54ae852f6cd2c650e21","target":"graph","created_at":"2026-07-05T10:53:55Z","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/2504.16382/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $k$-center problem is a fundamental optimization problem with numerous applications in machine learning, data analysis, data mining, and communication networks. The $k$-center problem has been extensively studied in the classical sequential setting for several decades, and more recently there have been some efforts in understanding the problem in parallel computing, on the Massively Parallel Computation (MPC) model. For now, we have a good understanding of $k$-center in the case where each local MPC machine has sufficient local memory to store some representatives from each cluster, that i","authors_text":"Artur Czumaj, Guichen Gao, Mohsen Ghaffari, Shaofeng H.-C. Jiang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16382","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:0509af625105d75b274f9a4bef59ad4f094111af1192581cc1b96cea128c6b2f","target":"record","created_at":"2026-07-05T10:53:55Z","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":"0393c3ea13ee726b23047addb8af3df542ad48d6221f96b96394098c1f915e2b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-23T03:24:15Z","title_canon_sha256":"28ee638fcde2bd00cae06eeed26b2f53b0a9da55c704cbd35958210e778d58c9"},"schema_version":"1.0","source":{"id":"2504.16382","kind":"arxiv","version":2}},"canonical_sha256":"d1381d60252bdf0f462c82639ab22b0672edcb4670800d36da47a8324619d513","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1381d60252bdf0f462c82639ab22b0672edcb4670800d36da47a8324619d513","first_computed_at":"2026-07-05T10:53:55.086810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:55.086810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CiYb2tTE7I6q+fmZ5o5IdfMQa2xdqXLpRe6m83MUz9gVTRtPj1IGmEWzFKD2XaDeskxY/phUZfSt5S+u1gzaAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:55.087334Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.16382","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0509af625105d75b274f9a4bef59ad4f094111af1192581cc1b96cea128c6b2f","sha256:bda153281f489aff7c45d73b3182db75b7bc6faf3cb6d54ae852f6cd2c650e21"],"state_sha256":"0a50fe732be91ec5a0fcf4485152d74d62abb0ad07d084ac31871c1dfb96048c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWV/ifUm14C1zBu0P0o58Wl8qj3R70+eneERw8tdx2xz/iLDi+EUGxZ+VIexmhY61vkA6g7xGUtf+m1thGVSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:23:17.570642Z","bundle_sha256":"0304e3f52ed4c9f100cfb6661c2162a32c11a55779dab06490ed958a19c58e7c"}}