{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:54R5DNBMR2HLPKDNNCJI77OCCB","short_pith_number":"pith:54R5DNBM","canonical_record":{"source":{"id":"2307.13747","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-25T18:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"4f378a43e741e4ca649e6fafcc94a0d8fda9698a74bacc273dd08aef4c3def2d","abstract_canon_sha256":"3615c734723782fd4862fee3c89b5d10b93a854ebe00686cbdad846d833a1cf2"},"schema_version":"1.0"},"canonical_sha256":"ef23d1b42c8e8eb7a86d68928ffdc210488e552e1ddca326b89edcd1fb5e0736","source":{"kind":"arxiv","id":"2307.13747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.13747","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"2307.13747v1","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13747","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"54R5DNBMR2HL","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"pith_short_16","alias_value":"54R5DNBMR2HLPKDN","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"pith_short_8","alias_value":"54R5DNBM","created_at":"2026-07-05T06:34:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:54R5DNBMR2HLPKDNNCJI77OCCB","target":"record","payload":{"canonical_record":{"source":{"id":"2307.13747","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-25T18:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"4f378a43e741e4ca649e6fafcc94a0d8fda9698a74bacc273dd08aef4c3def2d","abstract_canon_sha256":"3615c734723782fd4862fee3c89b5d10b93a854ebe00686cbdad846d833a1cf2"},"schema_version":"1.0"},"canonical_sha256":"ef23d1b42c8e8eb7a86d68928ffdc210488e552e1ddca326b89edcd1fb5e0736","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:52.030091Z","signature_b64":"78LDc3uARzrRPCUfq8VsZizF3jvCkg3j8v1uo9H9MjyeIlrU7fMx9aMuFfPSQ8ZA4aVwPB2pEMqAQevDaocRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef23d1b42c8e8eb7a86d68928ffdc210488e552e1ddca326b89edcd1fb5e0736","last_reissued_at":"2026-07-05T06:34:52.029628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:52.029628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.13747","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:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDCRkEn0aMlmdsmidHN3Vx9uVaAKJh4Is79SseNUM+V71JAGib3Adot0ehPf6GRLbbLcvr9RhBCGoFG4LR6JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:42:43.354066Z"},"content_sha256":"30020ec795571f394ae1840e41740e8217ab1e50800cd5595a4fda21f0cf5d66","schema_version":"1.0","event_id":"sha256:30020ec795571f394ae1840e41740e8217ab1e50800cd5595a4fda21f0cf5d66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:54R5DNBMR2HLPKDNNCJI77OCCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Consistent $k$-Center Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Christoph Grunau, Jakub {\\L}\\k{a}cki, Rajesh Jayaram, V\\'aclav Rozho\\v{n}","submitted_at":"2023-07-25T18:04:56Z","abstract_excerpt":"We study the consistent k-center clustering problem. In this problem, the goal is to maintain a constant factor approximate $k$-center solution during a sequence of $n$ point insertions and deletions while minimizing the recourse, i.e., the number of changes made to the set of centers after each point insertion or deletion. Previous works by Lattanzi and Vassilvitskii [ICML '12] and Fichtenberger, Lattanzi, Norouzi-Fard, and Svensson [SODA '21] showed that in the incremental setting, where deletions are not allowed, one can obtain $k \\cdot \\textrm{polylog}(n) / n$ amortized recourse for both $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13747","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/2307.13747/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:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EE1zy49J/LSIhpSFeb0/Eb+S64iZvyWXBgngTXY5aCoHMggAzCsavgPjKepMaBnMM7gT6U7x2afO7C3JIHwDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:42:43.355041Z"},"content_sha256":"a8cf9a555b70b240003911c2c9b16332e6293336112a8dd3dbde9657e33aeb39","schema_version":"1.0","event_id":"sha256:a8cf9a555b70b240003911c2c9b16332e6293336112a8dd3dbde9657e33aeb39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54R5DNBMR2HLPKDNNCJI77OCCB/bundle.json","state_url":"https://pith.science/pith/54R5DNBMR2HLPKDNNCJI77OCCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54R5DNBMR2HLPKDNNCJI77OCCB/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-11T09:42:43Z","links":{"resolver":"https://pith.science/pith/54R5DNBMR2HLPKDNNCJI77OCCB","bundle":"https://pith.science/pith/54R5DNBMR2HLPKDNNCJI77OCCB/bundle.json","state":"https://pith.science/pith/54R5DNBMR2HLPKDNNCJI77OCCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54R5DNBMR2HLPKDNNCJI77OCCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:54R5DNBMR2HLPKDNNCJI77OCCB","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":"3615c734723782fd4862fee3c89b5d10b93a854ebe00686cbdad846d833a1cf2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-25T18:04:56Z","title_canon_sha256":"4f378a43e741e4ca649e6fafcc94a0d8fda9698a74bacc273dd08aef4c3def2d"},"schema_version":"1.0","source":{"id":"2307.13747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.13747","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"2307.13747v1","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13747","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"54R5DNBMR2HL","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"pith_short_16","alias_value":"54R5DNBMR2HLPKDN","created_at":"2026-07-05T06:34:52Z"},{"alias_kind":"pith_short_8","alias_value":"54R5DNBM","created_at":"2026-07-05T06:34:52Z"}],"graph_snapshots":[{"event_id":"sha256:a8cf9a555b70b240003911c2c9b16332e6293336112a8dd3dbde9657e33aeb39","target":"graph","created_at":"2026-07-05T06:34:52Z","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/2307.13747/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the consistent k-center clustering problem. In this problem, the goal is to maintain a constant factor approximate $k$-center solution during a sequence of $n$ point insertions and deletions while minimizing the recourse, i.e., the number of changes made to the set of centers after each point insertion or deletion. Previous works by Lattanzi and Vassilvitskii [ICML '12] and Fichtenberger, Lattanzi, Norouzi-Fard, and Svensson [SODA '21] showed that in the incremental setting, where deletions are not allowed, one can obtain $k \\cdot \\textrm{polylog}(n) / n$ amortized recourse for both $","authors_text":"Bernhard Haeupler, Christoph Grunau, Jakub {\\L}\\k{a}cki, Rajesh Jayaram, V\\'aclav Rozho\\v{n}","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-25T18:04:56Z","title":"Fully Dynamic Consistent $k$-Center Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13747","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:30020ec795571f394ae1840e41740e8217ab1e50800cd5595a4fda21f0cf5d66","target":"record","created_at":"2026-07-05T06:34:52Z","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":"3615c734723782fd4862fee3c89b5d10b93a854ebe00686cbdad846d833a1cf2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-25T18:04:56Z","title_canon_sha256":"4f378a43e741e4ca649e6fafcc94a0d8fda9698a74bacc273dd08aef4c3def2d"},"schema_version":"1.0","source":{"id":"2307.13747","kind":"arxiv","version":1}},"canonical_sha256":"ef23d1b42c8e8eb7a86d68928ffdc210488e552e1ddca326b89edcd1fb5e0736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef23d1b42c8e8eb7a86d68928ffdc210488e552e1ddca326b89edcd1fb5e0736","first_computed_at":"2026-07-05T06:34:52.029628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:34:52.029628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"78LDc3uARzrRPCUfq8VsZizF3jvCkg3j8v1uo9H9MjyeIlrU7fMx9aMuFfPSQ8ZA4aVwPB2pEMqAQevDaocRBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:34:52.030091Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.13747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30020ec795571f394ae1840e41740e8217ab1e50800cd5595a4fda21f0cf5d66","sha256:a8cf9a555b70b240003911c2c9b16332e6293336112a8dd3dbde9657e33aeb39"],"state_sha256":"d9705a4623f81dfd3c5e4e3ac1d52a8a382e01a7893323adb88f33a9ce3d1c02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdXRQGXCQvQQrhXNy9H7E+9pobSC0lmkZymZG85ZmqhZOT820muBxxw3TKBJDrVQ2ZXr1y4WZPYAhrFwqm3kBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T09:42:43.361143Z","bundle_sha256":"7e0fe94f36d5348d7896662ec9a3776ff099ba924a24cf11028366a9e4f4b113"}}