{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GPRCFKP4KA5KNX3O2PJUK2NKRA","short_pith_number":"pith:GPRCFKP4","schema_version":"1.0","canonical_sha256":"33e222a9fc503aa6df6ed3d34569aa883ac202f91dd6200d7bab5f6d008d2004","source":{"kind":"arxiv","id":"1908.02645","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.02645","created_at":"2026-07-04T23:52:11.119118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02645v1","created_at":"2026-07-04T23:52:11.119118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02645","created_at":"2026-07-04T23:52:11.119118+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPRCFKP4KA5K","created_at":"2026-07-04T23:52:11.119118+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPRCFKP4KA5KNX3O","created_at":"2026-07-04T23:52:11.119118+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPRCFKP4","created_at":"2026-07-04T23:52:11.119118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03948","citing_title":"Fully Dynamic k-Center Clustering in Doubling Metrics","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA","json":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA.json","graph_json":"https://pith.science/api/pith-number/GPRCFKP4KA5KNX3O2PJUK2NKRA/graph.json","events_json":"https://pith.science/api/pith-number/GPRCFKP4KA5KNX3O2PJUK2NKRA/events.json","paper":"https://pith.science/paper/GPRCFKP4"},"agent_actions":{"view_html":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA","download_json":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA.json","view_paper":"https://pith.science/paper/GPRCFKP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02645&json=true","fetch_graph":"https://pith.science/api/pith-number/GPRCFKP4KA5KNX3O2PJUK2NKRA/graph.json","fetch_events":"https://pith.science/api/pith-number/GPRCFKP4KA5KNX3O2PJUK2NKRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/action/storage_attestation","attest_author":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/action/author_attestation","sign_citation":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/action/citation_signature","submit_replication":"https://pith.science/pith/GPRCFKP4KA5KNX3O2PJUK2NKRA/action/replication_record"}},"created_at":"2026-07-04T23:52:11.119118+00:00","updated_at":"2026-07-04T23:52:11.119118+00:00"}