{"as_of":"2026-08-16T08:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:caabd75248b15afea7a85bea1b112b52d02a37ba4a52a05233433ba0ed4f3389","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:57:55.828464Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:05:29.108395Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T14:05:29.189023Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"cited_work":{"arxiv_id":"1908.02645","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.02645","snapshot_observed_at":"2026-08-14T14:05:29.189023Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","venue":"cs.DS","work_id":"707fb765-1e8a-4d35-ac43-5412be21ad62","year":2019},"citing_paper":{"arxiv_id":"1908.03948","last_updated":"2020-02-10T03:24:35Z","snapshot_observed_at":"2026-08-16T02:25:00.239079Z","submitted_at":"2019-08-11T18:46:25Z","title":"Fully Dynamic k-Center Clustering in Doubling Metrics","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:05:29.108395Z"},"links":{"cited_paper":"/paper/1908.02645","citing_paper":"/paper/1908.03948"},"observation_digest":"sha256:3b2d30223cd9b65307333e80914d86c5e23a2e1e1192522b0aeaeabd3e29856b","observation_id":"a4d93e80-fe9a-45e3-a1da-5e2e8cc873c6","resolution":{"observed_at":"2026-08-14T14:05:29.196064Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.02645/citation-record","integrity":"/paper/1908.02645/integrity","json":"/paper/1908.02645/citation-record.json","paper":"/paper/1908.02645"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.142882Z","title":"1-2, 29--53","venue":null,"work_id":"e46566e0-357b-4a27-8919-d93247d26123","year":2015},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.742656Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:90abad5eb86735d3df3203e89dcd7e4d72765da4d59aa160e768ab02da4f6ffb","observation_id":"005353f4-7706-4a17-8a86-851111a5d863","resolution":{"observed_at":"2026-08-14T14:57:56.146677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.131355Z","title":"3, 385--415","venue":null,"work_id":"2fdef2c9-8570-4289-86be-2d6d638bcd04","year":1993},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.747824Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:f31e81cb219468c7c209e45ceeb31daf62356672031dbe6041cde2f0d468bbde","observation_id":"af0ed0bc-8fa2-412e-8382-398802ccd909","resolution":{"observed_at":"2026-08-14T14:57:56.135349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.119704Z","title":"55, 2016, pp","venue":null,"work_id":"d8f0842c-ab77-415a-b230-d85f783e9c98","year":2016},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.751814Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:614949029a4375fd790cb1dc8bd0ec874873e65fa54cf52d0d9c3fe66eb7168d","observation_id":"4e923b66-5613-489c-8593-89f8fac12822","resolution":{"observed_at":"2026-08-14T14:57:56.123712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.108046Z","title":null,"venue":null,"work_id":"b586f9b3-d52c-4b4a-85b6-c86cebe0ad79","year":2018},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.755960Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:064b0c6f66ebcf7a531089f793a6914c6f0d83dfee9d8f0a3449db1a1cd98d2f","observation_id":"bee8faf3-4cef-4b14-a435-cc432da2de49","resolution":{"observed_at":"2026-08-14T14:57:56.111811Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.096541Z","title":"5036--5044","venue":null,"work_id":"e41e21ac-b9c2-4b3a-a79f-0a95fce4dcf3","year":2017},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.760203Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:ebf1e2814b5106074ecf9851e99c04a109bd84fe33b4b9483648ffa568799c8c","observation_id":"778fd991-96b0-4e63-bad6-5baed7983e56","resolution":{"observed_at":"2026-08-14T14:57:56.100717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.084921Z","title":"Chen, Jian Li, Hongyu Liang, and Haitao Wang, Matroid and knapsack center problems, Algorithmica 75 (2016), no","venue":null,"work_id":"ebd0997f-823b-4015-81e2-b8c79173765f","year":2016},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.764639Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:786676d4ecebbd42f8335a33182cefa0038032a33ad4e5a81d22af453acf3885","observation_id":"4ffbeee4-d375-43c6-9e92-b4bc25a79ceb","resolution":{"observed_at":"2026-08-14T14:57:56.089102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.073125Z","title":"505--517","venue":null,"work_id":"57ee9627-0267-4624-986c-97c296aab61c","year":2015},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.769043Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:d409a066fafe680b001e79aea179fabf3159d0f38508c6ed3d89efdde378e7fb","observation_id":"f2b7f962-b27e-406a-8443-a9fc7da5521d","resolution":{"observed_at":"2026-08-14T14:57:56.076920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.059269Z","title":"19:1--19:12","venue":null,"work_id":"7ea1636f-b231-4875-be16-1f5d6902cc3b","year":2016},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.773197Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:1f1b2cb24c99f8be9ccd95d6381b45f7a84fc9e24c99fc9cedcdc9502aed0012","observation_id":"4871b822-9907-48b0-be95-1e64535dccf5","resolution":{"observed_at":"2026-08-14T14:57:56.064777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.047163Z","title":null,"venue":null,"work_id":"6bf6fe3a-8ef4-4d83-a024-6933c2c84338","year":1994},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.777009Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:72a2eebe22a9e8e4e17ffc0a8e6444b6f1703295370e94f8e1c2c4dcf1915998","observation_id":"66d01c1a-34e2-4c5c-9bfc-1d253b164fe2","resolution":{"observed_at":"2026-08-14T14:57:56.051211Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.033416Z","title":"Long, Performance guarantees for hierarchical clustering, Journal of Computer and System Sciences 70 (2005), no","venue":null,"work_id":"4447eb11-b9d4-4fe7-a551-7416227db39f","year":2005},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.780753Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:dbbe4d0df18306d33f024fb9d53b4c2dd47de190cbd5849cf8f11d9bbc256369","observation_id":"4e0a6ee7-7192-4e97-917f-adcb6e3ebb16","resolution":{"observed_at":"2026-08-14T14:57:56.037822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.019150Z","title":null,"venue":null,"work_id":"01fdd503-aec6-401b-8c41-f5663753ce38","year":2000},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.784733Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:b2d003d9ea5222ab658d65765e1b6bc4125cc9e265ae39dae25fdabb8a73e190","observation_id":"2bad8ac7-e1a1-4a2a-89ed-f9ba05da2f94","resolution":{"observed_at":"2026-08-14T14:57:56.023861Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:56.003187Z","title":"Greene, Optimal algorithms for approximate clustering, Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), 1988, pp","venue":null,"work_id":"3bda5bc3-2099-45f6-bd6a-9f516eafec93","year":1988},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.788506Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:41d3a30b849c4f1ff48d9214a4afba45314a5ae074992df1639ba5f8ea7f1dbb","observation_id":"c5a03519-b546-4598-9f9e-430680e648ae","resolution":{"observed_at":"2026-08-14T14:57:56.008180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.988994Z","title":"Gonzalez, Clustering to minimize the maximum intercluster distance, Theoretical Computer Science 38 (1985), 293--306","venue":null,"work_id":"f6ea3cb7-e1f5-45ec-b467-808259cdaea0","year":1985},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.792227Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:a4aeba41d402ef1882d40610f8de757de64e6229c28100005d97880feb794bb5","observation_id":"7ed7d7b9-dab6-40be-889c-dff07117f091","resolution":{"observed_at":"2026-08-14T14:57:55.993516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.975966Z","title":"1371--1380","venue":null,"work_id":"8afb3dcf-e672-42cb-9d98-b57729f01a5a","year":2013},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.796351Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:824c0b3df3775baf1997dbc762ab75a11c1ba29e138c1b6920e7e4cc5c46108c","observation_id":"15775fac-ee05-41ef-b431-3bcb9e2b1dba","resolution":{"observed_at":"2026-08-14T14:57:55.980083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.962030Z","title":"Nemhauser, Easy and hard bottleneck location problems, Discrete Applied Mathematics 1 (1979), no","venue":null,"work_id":"d8927cf5-4b7e-49d3-aef8-fae7107c6207","year":1979},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.800352Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:4a82ae1f0d30f838f5dd2b88382c32019c5e31d3467683933f4b619483f29ce8","observation_id":"7c5133ea-524e-4ee7-afda-d772838479db","resolution":{"observed_at":"2026-08-14T14:57:55.966616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.946418Z","title":"Hochbaum and David B","venue":null,"work_id":"85ea8aa0-e3b1-4c41-ad6d-ee84f9671674","year":1986},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.804518Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:b2665d296bb8ed20ff241ea10e46df57c4265788967e0c4893eb5cdd9496a9d3","observation_id":"e605105f-3ea4-4ca7-bfb4-eb0cbe69517e","resolution":{"observed_at":"2026-08-14T14:57:55.951944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.931583Z","title":"Sussmann, Fault tolerant k-center problems, Theoretical Computer Science 242 (2000), no","venue":null,"work_id":"f91a612d-d8e3-4108-a6c0-10b0a347b6e5","year":2000},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.808513Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:a01023a3f1438be8c1fbf424084a74c69b661b92e74c33ce580b53ff8ca68e43","observation_id":"9d0dfd04-c9b9-41ce-a5c0-7d6814db51e6","resolution":{"observed_at":"2026-08-14T14:57:55.936603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.917837Z","title":"Sussmann, The capacitated K-center problem , SIAM Journal on Discrete Mathematics 13 (2000), no","venue":null,"work_id":"f73c0f17-d416-4bd8-a970-57a382923ef4","year":2000},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.812975Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:ab99f706d507e21525e1566f3cc13244ca9f4d9ce2b0ba2a958b47e133085d1c","observation_id":"d8764b93-555e-4b62-981d-bd853fdd57e8","resolution":{"observed_at":"2026-08-14T14:57:55.921838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.903582Z","title":"Williamson, A general approach for incremental approximation and hierarchical clustering, SIAM Journal on Computing 39 (2010), no","venue":null,"work_id":"57361f57-b24f-467a-a9dd-fc7e4a58427b","year":2010},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.816726Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:bc18cbc871d22877bef1811b2d50200210b698be467915dd0075dde4ef353801","observation_id":"1ecf77c0-001b-42a3-9a32-169357b02943","resolution":{"observed_at":"2026-08-14T14:57:55.908347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.890259Z","title":"188--200","venue":null,"work_id":"ad3fb731-4d08-4db2-9398-9ec0f563afca","year":2010},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.820735Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:fdeb2efd00fa3f8334962f5b7a1412ca8ab69c3b426279aad948fb3d5ad0314b","observation_id":"32305140-016b-4380-badf-fe3962994127","resolution":{"observed_at":"2026-08-14T14:57:55.894388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.876506Z","title":"165--178","venue":null,"work_id":"93ef39f9-853f-4efd-b3f5-3567bdd77718","year":2008},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.824366Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:616e5881ed00cd760ea8034470cd95b828d6a50d34cddb62f0151878398f712b","observation_id":"7c467572-d3a6-4621-8fad-3c6753f826fc","resolution":{"observed_at":"2026-08-14T14:57:55.881107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:57:55.860565Z","title":"2, 122--144","venue":null,"work_id":"36cd16e7-f34d-4a6c-9d40-2ab6b350c2c9","year":2004},"citing_paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:57:55.828464Z"},"links":{"citing_paper":"/paper/1908.02645"},"observation_digest":"sha256:2fa9daec1fa517aee8863384a41e95ad72a7f28e75fb2265f14463a76116c81d","observation_id":"14d5925e-b528-4d8a-87a7-6fe83e109d41","resolution":{"observed_at":"2026-08-14T14:57:55.865761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.02645","last_updated":"2019-08-07T14:04:23Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T04:38:52.064267Z","submitted_at":"2019-08-07T14:04:23Z","title":"Fully dynamic hierarchical diameter k-clustering and k-center"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":22},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 1 inbound Pith citation observation for arXiv:1908.02645."}