{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DBVGXN4T6ZNTMXW5XB3ANPDUHP","short_pith_number":"pith:DBVGXN4T","canonical_record":{"source":{"id":"2302.07771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-15T16:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"b5f1f23bf1d1ac9cec8c6b3c4098718f6165bb5e8f4dd34ed6b5eebff3a66c1a","abstract_canon_sha256":"fc1540fee71bee6037020e64e233150f0b3530d87eae76c26a3d5beec4598bc9"},"schema_version":"1.0"},"canonical_sha256":"186a6bb793f65b365eddb87606bc743bed2174120c803d4799b8602887202805","source":{"kind":"arxiv","id":"2302.07771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.07771","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"arxiv_version","alias_value":"2302.07771v1","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07771","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"pith_short_12","alias_value":"DBVGXN4T6ZNT","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"pith_short_16","alias_value":"DBVGXN4T6ZNTMXW5","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"pith_short_8","alias_value":"DBVGXN4T","created_at":"2026-07-05T06:47:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DBVGXN4T6ZNTMXW5XB3ANPDUHP","target":"record","payload":{"canonical_record":{"source":{"id":"2302.07771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-15T16:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"b5f1f23bf1d1ac9cec8c6b3c4098718f6165bb5e8f4dd34ed6b5eebff3a66c1a","abstract_canon_sha256":"fc1540fee71bee6037020e64e233150f0b3530d87eae76c26a3d5beec4598bc9"},"schema_version":"1.0"},"canonical_sha256":"186a6bb793f65b365eddb87606bc743bed2174120c803d4799b8602887202805","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:17.934481Z","signature_b64":"z28YnY9blJY3ioQBP9to92shMEqWwLMNwXmJKbQvxkuQ4p1n5fl5RuvQnJM4E5Ug0v8fwWCvRnHhDltaE0/TAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"186a6bb793f65b365eddb87606bc743bed2174120c803d4799b8602887202805","last_reissued_at":"2026-07-05T06:47:17.933919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:17.933919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.07771","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-05T06:47:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTsG7uGWs2H5nIzMy0wsxcoPtF/XoGAr1Q0TFFAaumVzn1LvymJ3PO9T0jiQsjRtaAYCM5iFtlLnzmwmlKrAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T13:50:17.894529Z"},"content_sha256":"f184bd98a303763cfeb01783962db55bfc8d9fcaf60798a078241aad598c56b8","schema_version":"1.0","event_id":"sha256:f184bd98a303763cfeb01783962db55bfc8d9fcaf60798a078241aad598c56b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DBVGXN4T6ZNTMXW5XB3ANPDUHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully dynamic clustering and diversity maximization in doubling metrics","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Pietracaprina, Geppino Pucci, Paolo Pellizzoni","submitted_at":"2023-02-15T16:46:09Z","abstract_excerpt":"We present approximation algorithms for some variants of center-based clustering and related problems in the fully dynamic setting, where the pointset evolves through an arbitrary sequence of insertions and deletions. Specifically, we target the following problems: $k$-center (with and without outliers), matroid-center, and diversity maximization. All algorithms employ a coreset-based strategy and rely on the use of the cover tree data structure, which we crucially augment to maintain, at any time, some additional information enabling the efficient extraction of the solution for the specific p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07771","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/2302.07771/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-05T06:47:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMQjunQ+APXn3yb5BCWGx5dU+/HJlKclrLLK7YSroKLkxTfjNx+k6Qc6pGgYs3J1k1xYB+NOHvhsx1MgxPkhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T13:50:17.894909Z"},"content_sha256":"2004df6ea56a3650d85947a1a6f354553eb3c1cbe5414bdc61231e4b3f1f915a","schema_version":"1.0","event_id":"sha256:2004df6ea56a3650d85947a1a6f354553eb3c1cbe5414bdc61231e4b3f1f915a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBVGXN4T6ZNTMXW5XB3ANPDUHP/bundle.json","state_url":"https://pith.science/pith/DBVGXN4T6ZNTMXW5XB3ANPDUHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBVGXN4T6ZNTMXW5XB3ANPDUHP/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-07-22T13:50:17Z","links":{"resolver":"https://pith.science/pith/DBVGXN4T6ZNTMXW5XB3ANPDUHP","bundle":"https://pith.science/pith/DBVGXN4T6ZNTMXW5XB3ANPDUHP/bundle.json","state":"https://pith.science/pith/DBVGXN4T6ZNTMXW5XB3ANPDUHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBVGXN4T6ZNTMXW5XB3ANPDUHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DBVGXN4T6ZNTMXW5XB3ANPDUHP","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":"fc1540fee71bee6037020e64e233150f0b3530d87eae76c26a3d5beec4598bc9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-15T16:46:09Z","title_canon_sha256":"b5f1f23bf1d1ac9cec8c6b3c4098718f6165bb5e8f4dd34ed6b5eebff3a66c1a"},"schema_version":"1.0","source":{"id":"2302.07771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.07771","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"arxiv_version","alias_value":"2302.07771v1","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07771","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"pith_short_12","alias_value":"DBVGXN4T6ZNT","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"pith_short_16","alias_value":"DBVGXN4T6ZNTMXW5","created_at":"2026-07-05T06:47:17Z"},{"alias_kind":"pith_short_8","alias_value":"DBVGXN4T","created_at":"2026-07-05T06:47:17Z"}],"graph_snapshots":[{"event_id":"sha256:2004df6ea56a3650d85947a1a6f354553eb3c1cbe5414bdc61231e4b3f1f915a","target":"graph","created_at":"2026-07-05T06:47:17Z","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/2302.07771/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present approximation algorithms for some variants of center-based clustering and related problems in the fully dynamic setting, where the pointset evolves through an arbitrary sequence of insertions and deletions. Specifically, we target the following problems: $k$-center (with and without outliers), matroid-center, and diversity maximization. All algorithms employ a coreset-based strategy and rely on the use of the cover tree data structure, which we crucially augment to maintain, at any time, some additional information enabling the efficient extraction of the solution for the specific p","authors_text":"Andrea Pietracaprina, Geppino Pucci, Paolo Pellizzoni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-15T16:46:09Z","title":"Fully dynamic clustering and diversity maximization in doubling metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07771","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:f184bd98a303763cfeb01783962db55bfc8d9fcaf60798a078241aad598c56b8","target":"record","created_at":"2026-07-05T06:47:17Z","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":"fc1540fee71bee6037020e64e233150f0b3530d87eae76c26a3d5beec4598bc9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-15T16:46:09Z","title_canon_sha256":"b5f1f23bf1d1ac9cec8c6b3c4098718f6165bb5e8f4dd34ed6b5eebff3a66c1a"},"schema_version":"1.0","source":{"id":"2302.07771","kind":"arxiv","version":1}},"canonical_sha256":"186a6bb793f65b365eddb87606bc743bed2174120c803d4799b8602887202805","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"186a6bb793f65b365eddb87606bc743bed2174120c803d4799b8602887202805","first_computed_at":"2026-07-05T06:47:17.933919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:47:17.933919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z28YnY9blJY3ioQBP9to92shMEqWwLMNwXmJKbQvxkuQ4p1n5fl5RuvQnJM4E5Ug0v8fwWCvRnHhDltaE0/TAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:47:17.934481Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.07771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f184bd98a303763cfeb01783962db55bfc8d9fcaf60798a078241aad598c56b8","sha256:2004df6ea56a3650d85947a1a6f354553eb3c1cbe5414bdc61231e4b3f1f915a"],"state_sha256":"c9e22fd6613f824f1b1e84e0028e07e2eb93617f20a6bc14e3cdcafe2f925614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3Msunq61NaSpiHhaf3K94NT7thMO9RKPEg5ZheaOAXfQRVjqLYy3a3J9ML2EQeM3t2B4NwwfbYRE1zMI25hDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-22T13:50:17.897205Z","bundle_sha256":"85e15005dbaebd1ab4c71733969bf95ff8d0f3c262534e21407df36068aace90"}}