{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GPRCFKP4KA5KNX3O2PJUK2NKRA","short_pith_number":"pith:GPRCFKP4","canonical_record":{"source":{"id":"1908.02645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-07T14:04:23Z","cross_cats_sorted":[],"title_canon_sha256":"e6a5612b1ca7da03d004a6fe333871bf57f47172a6fd46e9fd8a2bfdb27d1f43","abstract_canon_sha256":"2301fb764336bbdd162fafd269ed1533263c25cbeefaf530e6307d0c8705f485"},"schema_version":"1.0"},"canonical_sha256":"33e222a9fc503aa6df6ed3d34569aa883ac202f91dd6200d7bab5f6d008d2004","source":{"kind":"arxiv","id":"1908.02645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02645","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02645v1","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02645","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_12","alias_value":"GPRCFKP4KA5K","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_16","alias_value":"GPRCFKP4KA5KNX3O","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_8","alias_value":"GPRCFKP4","created_at":"2026-07-04T23:52:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GPRCFKP4KA5KNX3O2PJUK2NKRA","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-07T14:04:23Z","cross_cats_sorted":[],"title_canon_sha256":"e6a5612b1ca7da03d004a6fe333871bf57f47172a6fd46e9fd8a2bfdb27d1f43","abstract_canon_sha256":"2301fb764336bbdd162fafd269ed1533263c25cbeefaf530e6307d0c8705f485"},"schema_version":"1.0"},"canonical_sha256":"33e222a9fc503aa6df6ed3d34569aa883ac202f91dd6200d7bab5f6d008d2004","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:11.119523Z","signature_b64":"xW7HVohW+YhNtiuJnpoFEVwEQ5sNDGrNlgv+jRnsnzQwWxklK3sFkZARDY7+LusY7vC5+bwJsUfWdGyGH5mDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33e222a9fc503aa6df6ed3d34569aa883ac202f91dd6200d7bab5f6d008d2004","last_reissued_at":"2026-07-04T23:52:11.119062Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:11.119062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02645","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-04T23:52:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mjWwAWF+Qdl22hWC9RkXnxAfI9eISm2VsEMzT3uTvLG7sWxpXeiTxmePcmjAnqevptdhjLgNkZW5JU6izWtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:53:16.348410Z"},"content_sha256":"00c3db9d5f9b1320e91fb1753663da593f19c8927e8d74e2af71b74a61145563","schema_version":"1.0","event_id":"sha256:00c3db9d5f9b1320e91fb1753663da593f19c8927e8d74e2af71b74a61145563"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GPRCFKP4KA5KNX3O2PJUK2NKRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully dynamic hierarchical diameter k-clustering and k-center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Melanie Schmidt","submitted_at":"2019-08-07T14:04:23Z","abstract_excerpt":"We develop dynamic data structures for maintaining a hierarchical k-center clustering when the points come from a discrete space $\\{1,\\ldots,\\Delta\\}^d$. Our first data structure is for the low dimensional setting, i.e., d is a constant, and processes insertions, deletions and cluster representative queries in $\\log^{O(1)} (\\Delta n)$ time, where $n$ is the current size of the point set. For the high dimensional case and an integer parameter $\\ell > 1$, we provide a randomized data structure that maintains an $O(d \\ell)$-approximation. The amortized expected insertion time is $O(d^2 \\ell \\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02645","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/1908.02645/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-04T23:52:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4OZbvA0Gb/iIErJwSYc51q/eN2ikuzNkdH790iQ7nJrMZ9kaDqgiGC6rmMZpcEB3ucUC3P9k9bPgSCswP4AeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:53:16.348905Z"},"content_sha256":"9a0096b6b8942ca509eeb271aadda6d5f63b8ca860d2666abea895f6fa1add9f","schema_version":"1.0","event_id":"sha256:9a0096b6b8942ca509eeb271aadda6d5f63b8ca860d2666abea895f6fa1add9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/bundle.json","state_url":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/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-16T08:53:16Z","links":{"resolver":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA","bundle":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/bundle.json","state":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GPRCFKP4KA5KNX3O2PJUK2NKRA","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":"2301fb764336bbdd162fafd269ed1533263c25cbeefaf530e6307d0c8705f485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-07T14:04:23Z","title_canon_sha256":"e6a5612b1ca7da03d004a6fe333871bf57f47172a6fd46e9fd8a2bfdb27d1f43"},"schema_version":"1.0","source":{"id":"1908.02645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02645","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02645v1","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02645","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_12","alias_value":"GPRCFKP4KA5K","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_16","alias_value":"GPRCFKP4KA5KNX3O","created_at":"2026-07-04T23:52:11Z"},{"alias_kind":"pith_short_8","alias_value":"GPRCFKP4","created_at":"2026-07-04T23:52:11Z"}],"graph_snapshots":[{"event_id":"sha256:9a0096b6b8942ca509eeb271aadda6d5f63b8ca860d2666abea895f6fa1add9f","target":"graph","created_at":"2026-07-04T23:52:11Z","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.02645/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop dynamic data structures for maintaining a hierarchical k-center clustering when the points come from a discrete space $\\{1,\\ldots,\\Delta\\}^d$. Our first data structure is for the low dimensional setting, i.e., d is a constant, and processes insertions, deletions and cluster representative queries in $\\log^{O(1)} (\\Delta n)$ time, where $n$ is the current size of the point set. For the high dimensional case and an integer parameter $\\ell > 1$, we provide a randomized data structure that maintains an $O(d \\ell)$-approximation. The amortized expected insertion time is $O(d^2 \\ell \\log ","authors_text":"Christian Sohler, Melanie Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02645","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:00c3db9d5f9b1320e91fb1753663da593f19c8927e8d74e2af71b74a61145563","target":"record","created_at":"2026-07-04T23:52:11Z","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":"2301fb764336bbdd162fafd269ed1533263c25cbeefaf530e6307d0c8705f485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-07T14:04:23Z","title_canon_sha256":"e6a5612b1ca7da03d004a6fe333871bf57f47172a6fd46e9fd8a2bfdb27d1f43"},"schema_version":"1.0","source":{"id":"1908.02645","kind":"arxiv","version":1}},"canonical_sha256":"33e222a9fc503aa6df6ed3d34569aa883ac202f91dd6200d7bab5f6d008d2004","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33e222a9fc503aa6df6ed3d34569aa883ac202f91dd6200d7bab5f6d008d2004","first_computed_at":"2026-07-04T23:52:11.119062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:11.119062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xW7HVohW+YhNtiuJnpoFEVwEQ5sNDGrNlgv+jRnsnzQwWxklK3sFkZARDY7+LusY7vC5+bwJsUfWdGyGH5mDBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:11.119523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00c3db9d5f9b1320e91fb1753663da593f19c8927e8d74e2af71b74a61145563","sha256:9a0096b6b8942ca509eeb271aadda6d5f63b8ca860d2666abea895f6fa1add9f"],"state_sha256":"b99edce384369b3b7d91ba03fd0e68a0d44172a8696820c1dca33a3f16011bf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3bUHObBeuDTLtkEgTq/WtrtHFEFRrGa5Sjt8NkADfONsdl9hnZruFKU8fcH84JLHxWpM4wryJP9JIxb3D27vCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:53:16.352261Z","bundle_sha256":"9ec0ab79ff74831307d9de373e3acd25051ca1efe33d4bebde8a0c052cdd7091"}}