{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KOUPBEW5XITGYXY7D6GJMVLB3J","short_pith_number":"pith:KOUPBEW5","canonical_record":{"source":{"id":"1908.03948","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-11T18:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"6e52db8d4b1b7a1428ba315ef2b4f9fffe71744d746d501d24e42ed1655605d8","abstract_canon_sha256":"d41be85f21c6ad99f20c6e8ea2cd3d9db5a9887def96d4269ca862954422b045"},"schema_version":"1.0"},"canonical_sha256":"53a8f092ddba266c5f1f1f8c965561da7d0af9f558b44169f3bff1fb2290b556","source":{"kind":"arxiv","id":"1908.03948","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03948","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03948v3","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03948","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"KOUPBEW5XITG","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"pith_short_16","alias_value":"KOUPBEW5XITGYXY7","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"pith_short_8","alias_value":"KOUPBEW5","created_at":"2026-07-05T00:39:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KOUPBEW5XITGYXY7D6GJMVLB3J","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03948","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-11T18:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"6e52db8d4b1b7a1428ba315ef2b4f9fffe71744d746d501d24e42ed1655605d8","abstract_canon_sha256":"d41be85f21c6ad99f20c6e8ea2cd3d9db5a9887def96d4269ca862954422b045"},"schema_version":"1.0"},"canonical_sha256":"53a8f092ddba266c5f1f1f8c965561da7d0af9f558b44169f3bff1fb2290b556","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:13.289469Z","signature_b64":"bUgTyfkVdrnI8D8JiYuUITk1yGBUAB5qQE9LzFrCo8G7pmzwN3L8rCWyAzg1gWuHch4hSuSvCpoRFsAlJcYYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53a8f092ddba266c5f1f1f8c965561da7d0af9f558b44169f3bff1fb2290b556","last_reissued_at":"2026-07-05T00:39:13.289004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:13.289004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03948","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-07-05T00:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHXLQsyTTNdpKy4Rg4PBpGPQUuBd/4U5/ll0eGClpPjZgbSmjcGK0bG2jDNzQOSJIIAOpXlHH1aNLhBfG1cUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T03:26:39.748858Z"},"content_sha256":"753cff58385e6fdd6bbc9714d0cc99c43a93a706ca8777244c725d1247427c1d","schema_version":"1.0","event_id":"sha256:753cff58385e6fdd6bbc9714d0cc99c43a93a706ca8777244c725d1247427c1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KOUPBEW5XITGYXY7D6GJMVLB3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic k-Center Clustering in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Svozil, Christian Schulz, Dariusz Leniowski, Gramoz Goranci, Monika Henzinger","submitted_at":"2019-08-11T18:46:25Z","abstract_excerpt":"Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is static, thus failing to capture many real-world applications where data is constantly changing and evolving. Driven by this, we study the metric $k$-center clustering problem in the fully dynamic setting, where the goal is to efficiently maintain a clustering while supporting an intermixed sequence of insertions and deletions of points. This model also supports queries of the form (1) report whether a given point is a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03948","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03948/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-05T00:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yp9li/AwmVTTbRv1KHoMpzjg6PF/hsXUm7FUbXyQEtO4hH40Y923RMKfy5U+J/FcCJA+LszZmXTPemnfQL7nBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T03:26:39.749341Z"},"content_sha256":"c57a3789eccecb937181d80b054b87f18cb15125b717cc35a7645ba0145b45e2","schema_version":"1.0","event_id":"sha256:c57a3789eccecb937181d80b054b87f18cb15125b717cc35a7645ba0145b45e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOUPBEW5XITGYXY7D6GJMVLB3J/bundle.json","state_url":"https://pith.science/pith/KOUPBEW5XITGYXY7D6GJMVLB3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOUPBEW5XITGYXY7D6GJMVLB3J/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-16T03:26:39Z","links":{"resolver":"https://pith.science/pith/KOUPBEW5XITGYXY7D6GJMVLB3J","bundle":"https://pith.science/pith/KOUPBEW5XITGYXY7D6GJMVLB3J/bundle.json","state":"https://pith.science/pith/KOUPBEW5XITGYXY7D6GJMVLB3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOUPBEW5XITGYXY7D6GJMVLB3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KOUPBEW5XITGYXY7D6GJMVLB3J","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":"d41be85f21c6ad99f20c6e8ea2cd3d9db5a9887def96d4269ca862954422b045","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-11T18:46:25Z","title_canon_sha256":"6e52db8d4b1b7a1428ba315ef2b4f9fffe71744d746d501d24e42ed1655605d8"},"schema_version":"1.0","source":{"id":"1908.03948","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03948","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03948v3","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03948","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"KOUPBEW5XITG","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"pith_short_16","alias_value":"KOUPBEW5XITGYXY7","created_at":"2026-07-05T00:39:13Z"},{"alias_kind":"pith_short_8","alias_value":"KOUPBEW5","created_at":"2026-07-05T00:39:13Z"}],"graph_snapshots":[{"event_id":"sha256:c57a3789eccecb937181d80b054b87f18cb15125b717cc35a7645ba0145b45e2","target":"graph","created_at":"2026-07-05T00:39: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/1908.03948/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is static, thus failing to capture many real-world applications where data is constantly changing and evolving. Driven by this, we study the metric $k$-center clustering problem in the fully dynamic setting, where the goal is to efficiently maintain a clustering while supporting an intermixed sequence of insertions and deletions of points. This model also supports queries of the form (1) report whether a given point is a ","authors_text":"Alexander Svozil, Christian Schulz, Dariusz Leniowski, Gramoz Goranci, Monika Henzinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-11T18:46:25Z","title":"Fully Dynamic k-Center Clustering in Doubling Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03948","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:753cff58385e6fdd6bbc9714d0cc99c43a93a706ca8777244c725d1247427c1d","target":"record","created_at":"2026-07-05T00:39: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":"d41be85f21c6ad99f20c6e8ea2cd3d9db5a9887def96d4269ca862954422b045","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-11T18:46:25Z","title_canon_sha256":"6e52db8d4b1b7a1428ba315ef2b4f9fffe71744d746d501d24e42ed1655605d8"},"schema_version":"1.0","source":{"id":"1908.03948","kind":"arxiv","version":3}},"canonical_sha256":"53a8f092ddba266c5f1f1f8c965561da7d0af9f558b44169f3bff1fb2290b556","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53a8f092ddba266c5f1f1f8c965561da7d0af9f558b44169f3bff1fb2290b556","first_computed_at":"2026-07-05T00:39:13.289004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:39:13.289004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bUgTyfkVdrnI8D8JiYuUITk1yGBUAB5qQE9LzFrCo8G7pmzwN3L8rCWyAzg1gWuHch4hSuSvCpoRFsAlJcYYBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:39:13.289469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03948","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:753cff58385e6fdd6bbc9714d0cc99c43a93a706ca8777244c725d1247427c1d","sha256:c57a3789eccecb937181d80b054b87f18cb15125b717cc35a7645ba0145b45e2"],"state_sha256":"1620eb8ae7b9d2f05a36aece56e86cc0a91f710e9a6c3433031fffdd6b46fcac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqlJZOMjidV2k8stz5uWgEW9SxDWLFwwLUzcaJLZgdbEbRBcUhft3X8df8nvrY+THcStWwe93BJ7kgI9l169Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T03:26:39.752373Z","bundle_sha256":"deec83878727b626fb648f9084bd53697865fc7de6e8718a3674d14060bdd212"}}