{"as_of":"2026-08-21T16:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8fd51ca93efaf79d9d64c35d1c72a9dadef968c77e3ec40193aa83650a43955d","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:02:48.164997Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.18384/citation-record","integrity":"/paper/2506.18384/integrity","json":"/paper/2506.18384/citation-record.json","paper":"/paper/2506.18384"},"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-15T19:02:48.903376Z","title":"Acar, Daniel Anderson, Guy E","venue":null,"work_id":"c2009900-0e48-46c1-b14c-daedbca15620","year":2019},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.821506Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:4a4f23dee15b35abd2c2cd1b7ae7344b79856f082145cf62aab31dd46f0341df","observation_id":"6103b296-d334-4faf-a907-1ac35811bbe1","resolution":{"observed_at":"2026-08-15T19:02:48.907255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.892711Z","title":"Acar, Daniel Anderson, Guy E","venue":null,"work_id":"1d6e64cb-ee01-4d3d-8e2f-cfab52b7256e","year":2020},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.826561Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:fbe34b7b621ebc658dfda5c29f2f6726bf8326b45c87ca4b39cf76f63ed23835","observation_id":"f69198d6-2665-4d38-934d-641339dc5a95","resolution":{"observed_at":"2026-08-15T19:02:48.896330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.882802Z","title":"Acar, Guy E","venue":null,"work_id":"f64f8f98-39ec-4a05-b7cf-e4e87a5cd398","year":2004},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.831368Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:f4fb52fd8996100a9a381c5bf2fc3428e133d6624b238b75e65c925f8ecc2fa9","observation_id":"30527f7c-7a88-4e1a-9c0e-4427dd9f609a","resolution":{"observed_at":"2026-08-15T19:02:48.886039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.872466Z","title":"Acar, Guy E","venue":null,"work_id":"de7e7ebe-3cb3-49b6-87df-34e7767f6882","year":2005},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.836235Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:49f98c4f16dc76f48c8149df0e5270127b4ba4da9d77801734ec5218397646cc","observation_id":"42f3980d-6494-49d3-8d2e-8b3b96e7546d","resolution":{"observed_at":"2026-08-15T19:02:48.875910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.862084Z","title":"2023.Parallel Batch-Dynamic Algorithms Dynamic Trees, Graphs, and Self-Adjusting Computation","venue":null,"work_id":"0c82c54a-46dc-4cdb-87d3-e4ce31df3899","year":2023},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.840631Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:733a57c3632795ddf9d43d127dc1ba4b87f6c5e39a2d34a138dfb2bdc0ef1fc0","observation_id":"4a7a122c-f2cf-4aad-9dfb-0e151fc49040","resolution":{"observed_at":"2026-08-15T19:02:48.865700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.08786","last_updated":"2023-06-14T23:44:48Z","snapshot_observed_at":"2026-08-16T15:23:49.467503Z","submitted_at":"2023-06-14T23:44:48Z","title":"Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span","version":1},"cited_work":{"arxiv_id":"2306.08786","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.08786","snapshot_observed_at":"2026-08-15T19:02:48.261158Z","title":"Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span","venue":"cs.DS","work_id":"835da5d5-c7d6-4f9d-9f9e-8ce040f7f9f5","year":2023},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.844851Z"},"links":{"cited_paper":"/paper/2306.08786","citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:91defd5a5453fccb88ce0613385bcbc649d38096e06d116dd86cee3566bed6eb","observation_id":"5670b130-950e-4f80-9e92-bc151ddb08b5","resolution":{"observed_at":"2026-08-15T19:02:48.265776Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.851414Z","title":"Blelloch","venue":null,"work_id":"900e2c02-5454-490a-84d6-6a83fd089d4b","year":2024},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.849940Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:3e4d7a4bdd5bf0342194ba2c492488c9b490097016804db044b7a8d85ec278f1","observation_id":"0ec7c8cc-a653-4f45-b775-4d954e5010bf","resolution":{"observed_at":"2026-08-15T19:02:48.855155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07248","last_updated":"2019-04-15T18:00:03Z","snapshot_observed_at":"2026-08-14T16:46:14.964751Z","submitted_at":"2019-04-15T18:00:03Z","title":"Machine Learning in Astronomy: a practical overview","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07248","snapshot_observed_at":"2026-08-15T19:02:47.854474Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.854474Z"},"links":{"cited_paper":"/paper/1904.07248","citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:87fc463b3ef4e88a822cb6e4c723f3366510695788fac3db72635200fad671dc","observation_id":"50ba2c13-8bc3-4c72-9ff8-c6ed1011fdda","resolution":{"observed_at":"2026-08-15T19:02:47.854474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:02:48.841655Z","title":null,"venue":null,"work_id":"2586f391-90b2-465d-840a-aa220e824052","year":2024},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.859384Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:ad1bd0cb0497e46063f434c9348fa1381e4239bff4bd7f32acd07fc3191f5e74","observation_id":"ffa21d78-b380-425b-8f4e-d6865aab0d93","resolution":{"observed_at":"2026-08-15T19:02:48.844382Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.832604Z","title":"Bender and Martin Farach-Colton","venue":null,"work_id":"3fb49f82-97de-46df-b189-f5fb3e13d7a4","year":2000},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.862563Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:5aa8bd76f7517c8f31d45efe90569e8155f07de28122f4790b139fd5c6851e95","observation_id":"49afe1ec-848e-422e-aafd-ea369e3bb618","resolution":{"observed_at":"2026-08-15T19:02:48.835652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.823351Z","title":null,"venue":null,"work_id":"1d97252f-281a-4e62-98da-2a11e7c272ae","year":2006},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.865522Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:3e173ce233a68272089fc876a20d511f7a55680a66f26a7dd22f3cc484646e73","observation_id":"aee4002d-589f-4b18-b224-37108b6e5d25","resolution":{"observed_at":"2026-08-15T19:02:48.826744Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.813556Z","title":"Blelloch, Jeremy T","venue":null,"work_id":"40f3c06c-757c-44b3-af63-37404f7bbc80","year":2020},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.869170Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:3ecb6b83d730498758134675b3dd78fe3f6a250a15650903c01ec54a710e6c52","observation_id":"f8a13b86-0225-48de-b57d-3fc0a8b51605","resolution":{"observed_at":"2026-08-15T19:02:48.816980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.803627Z","title":null,"venue":null,"work_id":"429196ed-1cb7-470e-9f26-d0a1df371999","year":2015},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.871854Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:110f6aafcd297832dfb02987afa6ebe15003b1679d2ba9a588a671474a21a8fc","observation_id":"4a0c6ce5-7d7c-46d9-88da-4bde4f1d95aa","resolution":{"observed_at":"2026-08-15T19:02:48.807161Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.793121Z","title":null,"venue":null,"work_id":"fd21cd4f-eaac-40f8-a6b4-666f2029cf3e","year":1988},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.874778Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:37b4b5937d79199de58600c9f5c96b7fb61ea58f8a055c1923e9b62273fce9bb","observation_id":"2a165ebd-124c-4f34-8d1e-6fb841df16e4","resolution":{"observed_at":"2026-08-15T19:02:48.796619Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.783132Z","title":null,"venue":null,"work_id":"637a451c-c7db-404b-8318-a81db16aee07","year":2024},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.877533Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:e35797d33fb8abd6e64bf6672ecc3aad80ba688341186b746d302668eafcc7a8","observation_id":"b138a9c9-fcee-4af3-b0f3-552d6d88ec24","resolution":{"observed_at":"2026-08-15T19:02:48.786460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.773063Z","title":"Demaine, Gad M","venue":null,"work_id":"1aae5876-8ab6-4fb7-ac7e-328c906ac52c","year":2014},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.880344Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:52b7ef9d9867f0eb01489fcd095e730a0a6ddd81f7ee11ee781f9b65cae3342d","observation_id":"a22e38dc-c0e3-4521-988c-b89ade37df79","resolution":{"observed_at":"2026-08-15T19:02:48.776633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.762856Z","title":null,"venue":null,"work_id":"4d14f834-6c84-4f8d-a61a-db95d35b4385","year":2022},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.883772Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:a2d545967a303026183a0d95dae571732b7cf4a93e658b36da21a0bbbe5946d9","observation_id":"05a98d99-e201-4177-a256-a40694704fa9","resolution":{"observed_at":"2026-08-15T19:02:48.766564Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.753081Z","title":null,"venue":null,"work_id":"a521638d-a215-4c8a-b16a-9e6590113ee3","year":2019},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.886722Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:c8c8a6b8a7c1a4f41a0bd82f165e7b0a0d0926cae22bca1c4dd69a1afef570d8","observation_id":"647afafd-e784-4aa6-a80f-b3916da9610d","resolution":{"observed_at":"2026-08-15T19:02:48.756478Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.742722Z","title":"Gowda, and Yan Gu","venue":null,"work_id":"fea183b7-6b73-4e86-87b4-bd60524fc0f3","year":2024},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.891026Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:b9ef51082b0a4d7bf93db0d64aa2644505147b94e7cbb80682ff872ea59c02bd","observation_id":"0ff2adf3-49ea-4a73-9212-d212de43a0a6","resolution":{"observed_at":"2026-08-15T19:02:48.746386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.733003Z","title":null,"venue":null,"work_id":"ee4fb9d7-2634-4aeb-8a15-ebc5c132646d","year":2020},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.896915Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:ee402321051ac745cfec8206cd165ff7aa675931020dfb56777a54b123033861","observation_id":"a6bbc526-7b0a-447f-b03e-8f97d460f3ac","resolution":{"observed_at":"2026-08-15T19:02:48.736261Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.722722Z","title":null,"venue":null,"work_id":"27a501da-d44b-4fd7-a747-bea5c4668f9d","year":2021},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.901451Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:c99dcffad27be03f12e087cb8a0371ee37804666608abcdd23351081923630db","observation_id":"9ddaa831-77ac-43b4-9673-44a088256587","resolution":{"observed_at":"2026-08-15T19:02:48.726453Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.713574Z","title":null,"venue":null,"work_id":"53caa117-04ff-4322-982e-a85e6234d738","year":null},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.905834Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:9a42da4c3822dffdbc05ed286ae2a2a8227f1a7bfc29b8ba2d750819636ef2fd","observation_id":"7eb1b48c-c17f-4c89-90f6-cae6fe79bb2e","resolution":{"observed_at":"2026-08-15T19:02:48.716463Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.694060Z","title":null,"venue":null,"work_id":"c1e3ebae-0758-4e95-bda2-f90f0b444e0e","year":2023},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.914078Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:1f37261555be0e1f1a0b35f284757cfcec26ed3439a3ecb38c38528e329c6c10","observation_id":"5a6a45c1-36c7-41ef-9c41-89c79269e07a","resolution":{"observed_at":"2026-08-15T19:02:48.697251Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.683595Z","title":null,"venue":null,"work_id":"4c8a99d4-a62c-4570-9a6f-edfbcc5c8650","year":2021},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.917938Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:ee703f01379f3730216204d246b7b064df9168ecd1d315631109ad935bff527e","observation_id":"38d0982d-2426-4331-a42d-87a3cd5c2b19","resolution":{"observed_at":"2026-08-15T19:02:48.687341Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.673217Z","title":null,"venue":null,"work_id":"f5dbda99-63dd-4b0b-9ee2-67f5a8e28b03","year":1998},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.921606Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:642c013c31ad64b6e75885aa1e2bb6803f2bd377b762911090c59023b1ba0cd3","observation_id":"2a0dd06f-896e-475e-a81c-d03ef71a0a73","resolution":{"observed_at":"2026-08-15T19:02:48.676773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.662335Z","title":null,"venue":null,"work_id":"353f4ca2-922d-4c02-92dc-db6a2509d35f","year":1985},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.925437Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:2ee7640328ae98ab52ccb10f46ec1f5d4ed9e941cbfdaa3caf7b23d9ee4812e8","observation_id":"6808a945-0667-417b-a5d4-ff99dae933db","resolution":{"observed_at":"2026-08-15T19:02:48.666193Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.651258Z","title":null,"venue":null,"work_id":"80fbfd62-0867-4cd3-b3e0-7461d4a26bab","year":2019},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.929350Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:e329d6924502b8f055396338a9dce400e77da6a3adab1bc77a6a428a6f8d8fea","observation_id":"35e85706-df50-492b-8ebd-179271562d4a","resolution":{"observed_at":"2026-08-15T19:02:48.654885Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.639527Z","title":null,"venue":null,"work_id":"b7066ed7-c039-4d48-9242-ff1ed4b1ac64","year":2018},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.932897Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:2adc65e6a0b96e666dbae27eeb44165ff5dc2e8ad0d5d03f458751d36000150c","observation_id":"8ae3aa31-5eb2-4952-9110-30a8bb42a818","resolution":{"observed_at":"2026-08-15T19:02:48.643684Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.627417Z","title":null,"venue":null,"work_id":"63a8d467-b4df-4ddd-806a-47c1c0dc357f","year":1969},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.936451Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:b96826a507a8ce1ffa58937b44d5bb4f311fdc438921f8e82ddd58614953cb4e","observation_id":"e12051d7-34c2-4439-a67f-4480d9ae7eb5","resolution":{"observed_at":"2026-08-15T19:02:48.631228Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.615277Z","title":null,"venue":null,"work_id":"f98646b4-c90e-4643-80a0-06906fa879c6","year":2019},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.940160Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:c1531f8c275fb03e8c4f40436956c1f317853ef1d7e3dc14ade5e9fd89a56b03","observation_id":"a9b83a9d-88e1-4bec-b04a-a7df0ce0873a","resolution":{"observed_at":"2026-08-15T19:02:48.619540Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.601694Z","title":null,"venue":null,"work_id":"f94e5e32-9c28-45e4-8148-3fbbda79328d","year":2005},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.943991Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:51ec6325f0fa14d174b509d0fde27a93bbf3347809e966bbc29efdafaf0e0b12","observation_id":"659c2f7c-6684-4bcd-90a6-2f763cea8105","resolution":{"observed_at":"2026-08-15T19:02:48.605977Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.587304Z","title":null,"venue":null,"work_id":"8c3ca510-6320-445c-a4b3-5e47c2bfeaf8","year":1995},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.947615Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:8aeef3ef147fae208749d89069363c62d25fcbfcdad7109cc837165336497c51","observation_id":"5ac93e82-d29e-441a-8e8b-6ee1146e6eb0","resolution":{"observed_at":"2026-08-15T19:02:48.592075Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.573806Z","title":null,"venue":null,"work_id":"6df089af-1fb5-43e2-a3fe-eaebef349de8","year":2001},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.951401Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:77155799e554ef06bcf32b8e486f4cb522624315becea926172e2cb38474e679","observation_id":"431c6f38-51ca-4906-b3a2-84dc3bf02fdf","resolution":{"observed_at":"2026-08-15T19:02:48.577957Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.561225Z","title":"1992.An Introduction to Parallel Algorithms","venue":null,"work_id":"11023d0b-dd15-4c81-a1f6-0c6b68593a2f","year":1992},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.955261Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:745e1971d18996ba74e4e0d9850906de806500f3a3a7dcd9e265300e9fc2b02e","observation_id":"5cd694ef-a5d8-41b8-aa24-c7f7c52c0175","resolution":{"observed_at":"2026-08-15T19:02:48.565095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.550716Z","title":null,"venue":null,"work_id":"b37b3900-4b53-460c-89f2-9e181727525c","year":2007},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.067570Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:a9b1e0d194f4da5f6750f6e9079c744c7b1a2ed4fee99be81da64bfc0dd87404","observation_id":"b4303082-1811-40d4-a41f-fbd0e2446643","resolution":{"observed_at":"2026-08-15T19:02:48.553888Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:02:48.071882Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.071882Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:901a99ede9cddabeecdb3682c8747e5bfe43d1be7b472d67787b03eed1ec4a37","observation_id":"ac153c49-cd16-42bf-83d9-e449f0ac80ec","resolution":{"observed_at":"2026-08-15T19:02:48.071882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:02:48.079537Z","title":"2008.Intro- duction to Information Retrieval","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.079537Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:f05bc483e1d78ff53b13bad46a088e37a50dc91f9783f69c82678f3eaf5df238","observation_id":"e655596d-3ec6-4905-a88e-8bc21fc7e4d3","resolution":{"observed_at":"2026-08-15T19:02:48.079537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:02:48.531262Z","title":"InProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","venue":null,"work_id":"b07148d8-7bfe-4630-9a72-62e98f0cb8b8","year":null},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.075665Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:6642f210ef46e9ece771ae854bb140bd031ea2fcb5afeedddb59299c49e6c68c","observation_id":"69da1abb-97d6-4f01-8365-73c4aa8af53f","resolution":{"observed_at":"2026-08-15T19:02:48.535723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.500846Z","title":null,"venue":null,"work_id":"cf5bd0b5-8732-4065-964f-2d8b0a2b3ecf","year":1985},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.087450Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:1d01ffe60e708cb498bdbb965e7269b45d1f961194fdc4d3cc7a6b805bdde073","observation_id":"07385db2-6fe6-4e01-9d11-3dfdde2d9467","resolution":{"observed_at":"2026-08-15T19:02:48.504494Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.512900Z","title":null,"venue":null,"work_id":"3e7676d5-b192-4013-b51b-d1558c4dff8f","year":2025},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.083420Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:a2c657deb0759f4832aaf9cc8a46a6663a307c7f495fdc4d8e72940dfc2969f1","observation_id":"9700ea0f-2f87-4ff7-bb5d-103d3986062e","resolution":{"observed_at":"2026-08-15T19:02:48.516795Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.474030Z","title":null,"venue":null,"work_id":"d6f2fde9-81bd-4fc3-ae60-514a09e07c22","year":2023},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.096171Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:e2bbf0cd02f20c8a6a9b010ba412e24450103209ecd89060b3b0e2cf3b82de91","observation_id":"f411a93e-d825-49bb-821f-c0926d39c785","resolution":{"observed_at":"2026-08-15T19:02:48.479727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.488849Z","title":null,"venue":null,"work_id":"345021c7-b5da-4a64-a6fa-7a21d260803e","year":2023},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.092006Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:6f1b570062b08a553f486b7d54e5ab46cef528305dc97c4807510070b66d58b1","observation_id":"3dbf7fba-8842-4006-90ea-b162b829a281","resolution":{"observed_at":"2026-08-15T19:02:48.493093Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.447339Z","title":null,"venue":null,"work_id":"df850d6d-8725-4639-9836-821ac3092b33","year":2004},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.106251Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:1fb745eea40644a62a1c636483bcf91e48b355d7ddaaf7b325b8735b44e34b05","observation_id":"30674bfe-6ff9-4272-9ca6-5e27e4f7114f","resolution":{"observed_at":"2026-08-15T19:02:48.451713Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.459570Z","title":null,"venue":null,"work_id":"4a150508-28ef-4e2d-912f-3323d5bb75be","year":2012},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.100571Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:cb85fec05f0362a3a7da7b37ce930f7ea941bc71335e051edb29b89e159a7d6d","observation_id":"78ccfb72-db59-47f6-b700-6308c327cbde","resolution":{"observed_at":"2026-08-15T19:02:48.464857Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.420911Z","title":"Blelloch","venue":null,"work_id":"e7e34270-608c-47a9-a746-a907da40139c","year":2014},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.114096Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:7196f8590a26f03d9874c7f53993c36223578c9bbbf94d8ced6b5bdea4541535","observation_id":"028b5304-e249-4047-816d-869fca4dc18f","resolution":{"observed_at":"2026-08-15T19:02:48.425333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.433476Z","title":null,"venue":null,"work_id":"494d6d45-c942-437a-bbd5-89de8bbfb31d","year":2024},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.110223Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:e387071af87ef9d5f81de584ae9abcf702c75364ea88358fd8bbc47894a3da67","observation_id":"f30d1e8f-9746-488b-9cc4-352284124364","resolution":{"observed_at":"2026-08-15T19:02:48.437848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.394930Z","title":null,"venue":null,"work_id":"9e496163-141d-4626-a4a7-63b9ab7c3dec","year":2019},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.122185Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:948a7dca27f41eb5ebf57cb3e49c7981104f0f0f9e3998ce15a35fe6f9e2db5a","observation_id":"0929c474-ec90-49a1-a1ff-c72bf88a8018","resolution":{"observed_at":"2026-08-15T19:02:48.399653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.408163Z","title":null,"venue":null,"work_id":"542e476d-2db5-46fb-8e84-c7ebeee5c9c8","year":1983},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.118509Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:3a20b4fb24d5b3e295b74cdd02b2456cecdae944c08d2498e8e6bbfd8940cb11","observation_id":"00379c07-acfc-47d3-88d2-df089766d023","resolution":{"observed_at":"2026-08-15T19:02:48.412573Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.372053Z","title":null,"venue":null,"work_id":"eaa45822-2f30-4d0a-838a-2c465c669c1c","year":1980},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.129328Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:45e5576705e986b3b4850b3fe35432e33f952a2a6def7034f9f7957b759832bd","observation_id":"c4d94d9a-3218-4860-8738-fac705f847c6","resolution":{"observed_at":"2026-08-15T19:02:48.376236Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.383993Z","title":null,"venue":null,"work_id":"6f5c79b6-c1c8-4dab-a358-443267404355","year":2022},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.126174Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:400fd440cc8cd27d5d069ab2ca381d8ccbf16d6e7543b62065fef6a173e68202","observation_id":"301454d3-44f4-4323-915b-817cfb46a8ed","resolution":{"observed_at":"2026-08-15T19:02:48.387248Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.344595Z","title":null,"venue":null,"work_id":"e7e5c20d-c21c-4804-a4b9-65b1f0e60493","year":2021},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.135550Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:18af865553737e14652054e844e2486f63170ed5831a741baceedd83c157ccd5","observation_id":"54391c92-ffff-42fa-8920-726d04abe429","resolution":{"observed_at":"2026-08-15T19:02:48.348807Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.359316Z","title":null,"venue":null,"work_id":"586f1896-0dd4-4dd0-9ac9-25cf8b62e433","year":2020},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.132556Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:4b25bc8777c815f7dd464cb682ed5b42ea0f8b085b6c0dd184d681ea1dee8bf3","observation_id":"a2b483bc-e147-4e17-b037-8088e03d2faa","resolution":{"observed_at":"2026-08-15T19:02:48.362929Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.327556Z","title":null,"venue":null,"work_id":"c522d343-7a9a-4fc0-a683-32a1656c9419","year":2017},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.142007Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:a0fc47c0692614e1d60a00dfdcae8f520d61dfd1a7475b97e53cdb2a4033efaf","observation_id":"e6857239-b87e-485a-ab65-44b3879cdb92","resolution":{"observed_at":"2026-08-15T19:02:48.335509Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02379","last_updated":"2021-03-23T23:26:51Z","snapshot_observed_at":"2026-08-16T19:15:40.403560Z","submitted_at":"2020-10-05T22:50:33Z","title":"A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem","version":3},"cited_work":{"arxiv_id":"2010.02379","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.02379","snapshot_observed_at":"2026-08-15T19:02:48.224068Z","title":"A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem","venue":"cs.DS","work_id":"25e47a22-0dcf-4e4a-b884-5cd07349abb2","year":2020},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.138534Z"},"links":{"cited_paper":"/paper/2010.02379","citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:bf0cd707ef84f4d69f17b9e238e8f9cd79b31ac3e752e177dbd8d94becde2e45","observation_id":"afabb625-ba66-4062-a7a5-208799ac15f7","resolution":{"observed_at":"2026-08-15T19:02:48.232626Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.298945Z","title":null,"venue":null,"work_id":"28a56086-3ac1-4591-8d95-1441aec6b8c6","year":2022},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.148674Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:34cd8a709655f86d71cfdec8fd2f92372333a5a954a2b099ecf57b179b8fe0d3","observation_id":"afc930f0-75a4-4ca5-acab-1fcd75433854","resolution":{"observed_at":"2026-08-15T19:02:48.303664Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.312744Z","title":null,"venue":null,"work_id":"1cd56e31-0090-4fa8-a08c-dbc9145cdc52","year":1981},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.145517Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:ee84b2a76b9daa2ea4cca85d1747815ced6187fe2bb645d7e7a276b90b230595","observation_id":"cbc357fc-4424-4a2a-8346-bc5a54a93325","resolution":{"observed_at":"2026-08-15T19:02:48.317665Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T19:02:48.285389Z","title":null,"venue":null,"work_id":"e998eeed-ce30-48eb-83ce-17b5cc28e7b0","year":2015},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.156127Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:a70e445f899c559a78278bda1682464c416d52baba0c57fcf453288af56d7cc9","observation_id":"91f8d031-17b3-43e4-b73e-85146c82bd2e","resolution":{"observed_at":"2026-08-15T19:02:48.289215Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.06188","last_updated":"2021-12-12T09:08:41Z","snapshot_observed_at":"2026-08-16T17:35:19.980806Z","submitted_at":"2021-12-12T09:08:41Z","title":"Parallel Batch-Dynamic $k$d-Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.06188","snapshot_observed_at":"2026-08-15T19:02:48.151794Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.151794Z"},"links":{"cited_paper":"/paper/2112.06188","citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:2c96eed3fd4d87fd6fe436c28ef774edac74042379c6884fac5ebebda54fbe31","observation_id":"8801ca99-eda0-4818-88cb-44e5146da0cc","resolution":{"observed_at":"2026-08-15T19:02:48.151794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:02:48.274060Z","title":null,"venue":null,"work_id":"67091403-b8e1-4cbe-8792-0e244f2b93ce","year":2021},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.164997Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:02385ee523d8066e752b87e745d2b36f17ed7ec799b4490fa39ec20968076bfb","observation_id":"a85e31c9-2b97-4a0d-899c-b820ab9f3790","resolution":{"observed_at":"2026-08-15T19:02:48.277669Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-15T21:02:55.071736Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.07745","snapshot_observed_at":"2026-08-15T19:02:48.160896Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.160896Z"},"links":{"cited_paper":"/paper/2501.07745","citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:75241565e920bb9f3833dde964d3075ca106c8ac7c4dfa2cc1fcef7d039469ab","observation_id":"0e22483d-d68e-41ea-9fcc-0cd645c4dc41","resolution":{"observed_at":"2026-08-15T19:02:48.160896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:02:48.704179Z","title":"InNeural Information Processing Systems (NeurIPS)","venue":null,"work_id":"7e3b2321-a968-406a-8a84-02af6b4383e5","year":null},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:47.910022Z"},"links":{"citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:ba0b2081c3ccd63016f16daf555a13905734200351eba37cf78c4922458e3fa1","observation_id":"a6eac1a0-5b14-4194-adf9-1e11f2f4576f","resolution":{"observed_at":"2026-08-15T19:02:48.707781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":2,"verified_fuzzy":14},"total_outbound_references":61},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2506.18384."}