{"as_of":"2026-08-23T04:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f340f387428f69947a97ba1c57ba2367a832a9d9f3cdb5d5a8222fc84d59076","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T20:49:37.630367Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2501.19285/citation-record","integrity":"/paper/2501.19285/integrity","json":"/paper/2501.19285/citation-record.json","paper":"/paper/2501.19285"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T20:49:37.425285Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.425285Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:3fa9e966098cf154bdee528cd361adc6beacf0e0d0176f3c2e7ee724b09b1af6","observation_id":"663cf501-4811-4bd2-b1d9-ac6f9a9e5b18","resolution":{"observed_at":"2026-08-09T20:49:37.425285Z","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-09T20:49:37.430941Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.430941Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:e64ad33d91351dede0e6ba259c1a525bba538e789125db28b49b3eb8341d647c","observation_id":"d0eca1ba-3819-4369-b9af-5d37847d266e","resolution":{"observed_at":"2026-08-09T20:49:37.430941Z","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-09T20:49:38.220990Z","title":null,"venue":null,"work_id":"d0e9bc08-49b1-4506-8ae4-4b9092a0d8ac","year":2007},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.435316Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:167a673f76fb2f80bb605dcae9e4e2e256f01ef80784f7390f7724fc6f8809aa","observation_id":"a5e6e87f-7b1e-4132-a0fb-0e74543b2906","resolution":{"observed_at":"2026-08-09T20:49:38.224525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.211180Z","title":null,"venue":null,"work_id":"be78f5d7-c40a-4253-b6c4-4e2ff0897aba","year":2001},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.439349Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:0be34c869c47d6d79535edeae9b460985c9ec365fa1278d145de4d6fd39752a7","observation_id":"48bd5e1f-bcc1-4448-b206-720579f123d6","resolution":{"observed_at":"2026-08-09T20:49:38.214533Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.201375Z","title":"H.; and Krause, A","venue":null,"work_id":"95d0a6df-c605-4a66-a667-c4d6aea549db","year":2016},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.443872Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:3ac326ae93a782f24dbe3a84b8b6cace2d29643987d2b95bafd5a59bb6b551c6","observation_id":"2bf5b6d9-d4e6-4503-b928-5285a8906183","resolution":{"observed_at":"2026-08-09T20:49:38.204876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.187539Z","title":null,"venue":null,"work_id":"c208409f-5ab1-4120-8419-c1d1aeb6bcdb","year":2018},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.447872Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:e142c60592bfcc5e101729fbc81a3c51258a40786955e6dc95eb7ea028f87812","observation_id":"ac1f10c0-b773-40b0-98dc-f62cefd7b2e7","resolution":{"observed_at":"2026-08-09T20:49:38.191087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.177298Z","title":null,"venue":null,"work_id":"88c370d4-4b73-4825-b5a2-029a9c5c42fb","year":2024},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.451879Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:c576b12f57525a0c9531b065e910452b7b47281dba46a57af093e8bb2d7622d0","observation_id":"53a0de5a-5cb9-44a5-8772-39da23dcb01d","resolution":{"observed_at":"2026-08-09T20:49:38.180962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.167335Z","title":null,"venue":null,"work_id":"6515973a-a0c3-4aa4-953b-dbd4794c3d0b","year":2014},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.455561Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:03fc89ffc46cdb299d43111e00eb5646379e3dd8c6bcee72021002ff218bb9ca","observation_id":"7e655441-b6d7-4b50-a4d0-3837ab077603","resolution":{"observed_at":"2026-08-09T20:49:38.170719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.157951Z","title":"S.; Krauthgamer, R.; Schwiegelshohn, C.; Toftrup, M","venue":null,"work_id":"db64c6cc-baf7-434e-a00a-7a181f637889","year":2022},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.459694Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:fb20ad695031ed06a1941563bda4546982e26ef903cbeb79df68ee730b7ab45d","observation_id":"6a51cc2d-2765-4cc5-aee4-fce8d109d288","resolution":{"observed_at":"2026-08-09T20:49:38.161247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.147654Z","title":null,"venue":null,"work_id":"1975e03a-3b68-4798-a89a-3ff6ca461198","year":2017},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.463538Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:d7d37391b678a2b3cd3d87ecf062e9033b51771a1eaf1b938db3343ff4772a18","observation_id":"99dd4ff9-d27f-414a-b15d-c311be31ce02","resolution":{"observed_at":"2026-08-09T20:49:38.151343Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.137025Z","title":null,"venue":null,"work_id":"33351155-8037-4a4b-8258-d538fbf69916","year":1999},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.467385Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:fe7db226f0a7e21c1292206add5ddc7967d90df454a12887b1ee1de9d25bf7c1","observation_id":"3fab3f79-8865-44ff-81e3-e4aa6cf2d50b","resolution":{"observed_at":"2026-08-09T20:49:38.140808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.125258Z","title":null,"venue":null,"work_id":"42891736-1c12-41bc-b751-b7682eec7f7e","year":2023},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.471031Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:174ba1e544e3b172557f0a002d569e0bc80224dd051394811ab2c3a5ce34f508","observation_id":"6d375025-4e5c-46a7-8c59-6dc77cf7a037","resolution":{"observed_at":"2026-08-09T20:49:38.129914Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.112957Z","title":null,"venue":null,"work_id":"54c81486-1b27-4e3b-a358-5b693e1da78a","year":2009},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.474768Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:6c0ca3c425d0df6010ff908df5dc7f1bc1334184e0e5f77dd0ca6b11739a6900","observation_id":"b53f46ff-e8aa-4116-b5af-2e3d09a9e520","resolution":{"observed_at":"2026-08-09T20:49:38.117452Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.101879Z","title":null,"venue":null,"work_id":"3ba7f7ce-52ea-4a9c-96f1-e94c0292ab68","year":2006},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.478376Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:048f0b5991e83bcb3026bfefd5c2cede23f0b81a67c55a2f8284756be7c6ef39","observation_id":"03880aba-7eb0-4cfc-9016-aedd85b46bcb","resolution":{"observed_at":"2026-08-09T20:49:38.105599Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.089548Z","title":"G.; Saulpic, D.; and Schwiegelshohn, C","venue":null,"work_id":"74c8f003-fd87-4031-81b9-061c91454567","year":2022},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.482246Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:31ff17580bcc613f07db6b756d46dae91f00ad21983f817510d48b4b883f4cb7","observation_id":"90345970-7bf1-4d4f-86db-afd9b338169f","resolution":{"observed_at":"2026-08-09T20:49:38.093997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.076146Z","title":null,"venue":null,"work_id":"1db85727-3021-4b51-9837-df7945966709","year":2020},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.486117Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:fb2da482e7f0dac82e82d6f00d37f175c30441665e97470250a738ed626d5d0a","observation_id":"5c90aee7-3f25-4539-b117-b07ffba184d6","resolution":{"observed_at":"2026-08-09T20:49:38.080888Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.063381Z","title":null,"venue":null,"work_id":"67b9546f-e4ff-4bdb-b54d-ad9385d74819","year":2021},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.489986Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:d2693243f1139623d9021fd87f45585035289f534c3f2c044d91bb963854c791","observation_id":"af49e044-ecf2-45a2-a4e9-35bd58e7e941","resolution":{"observed_at":"2026-08-09T20:49:38.067999Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.052428Z","title":null,"venue":null,"work_id":"c1e540a2-e4f4-4e1b-9fc7-7395df4055cb","year":2021},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.493852Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:8eeff92cdbbace1adea2b88a730e887757aa645f429dc487b368016d05558946","observation_id":"870b91d4-9f58-4f6b-b525-3c749a0e860e","resolution":{"observed_at":"2026-08-09T20:49:38.056284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.041798Z","title":null,"venue":null,"work_id":"7bff2ff7-0c3a-46d6-93d7-1d99c391585c","year":2007},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.497740Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:65fc250ca94b8f0095785d23dbae83ebdd0432993a25d0f592bc15f3068bb444","observation_id":"f8e3bd4f-c17e-4f86-a619-9e60368d784c","resolution":{"observed_at":"2026-08-09T20:49:38.045389Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.031302Z","title":null,"venue":null,"work_id":"ac48cd8c-cfbe-414d-81ab-f2285d4a696d","year":2021},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.502068Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:d4dd55320c432f8e1c21d3739287f6a177a62e56277173b19fc2133c98d47060","observation_id":"6b30b7e9-5d77-4749-b156-636f5c300953","resolution":{"observed_at":"2026-08-09T20:49:38.034795Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:38.018990Z","title":null,"venue":null,"work_id":"42b81181-c60e-459a-885f-57e249813ef3","year":2015},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.506098Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:dc51aaeecb92ec384705b4f5f6fd75c7574f5dce64a66db8a5c8d8a2139c7d57","observation_id":"5670f454-6ac2-490e-ac44-648a48e2730b","resolution":{"observed_at":"2026-08-09T20:49:38.023588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.509833Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.509833Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:c725ca2bd518959ea51f588db91baba28a048269afbfb1e7887ed1309db91652","observation_id":"9f434352-5484-407a-8ad0-44dd22d5751d","resolution":{"observed_at":"2026-08-09T20:49:37.509833Z","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-09T20:49:38.001910Z","title":null,"venue":null,"work_id":"d1265ff0-172a-4024-98ec-bbaf5182990f","year":2020},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.513403Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:43ce87944e03e3bfb63c40b6361e9c3d92aaeb7455c8c39ccbf7d8e365d62a1d","observation_id":"8e164b13-7c4c-42e9-b342-23cca3470a2b","resolution":{"observed_at":"2026-08-09T20:49:38.005489Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.990522Z","title":null,"venue":null,"work_id":"7fc39604-40e4-453a-b68d-bca57c07a6c8","year":2011},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.517060Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:5272f8d0f14146fd5b33c90bb312dcd567e65e0fe2a335d067bdfbdaeafa8294","observation_id":"6388fda5-34e1-4903-a73b-9e14306a7dc9","resolution":{"observed_at":"2026-08-09T20:49:37.993918Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.980237Z","title":null,"venue":null,"work_id":"025dc5fd-b10b-4cc9-8e2a-80f69d571ab0","year":2016},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.520621Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:6eb45b3aff51d8962022478e1128fae6434a2381a23a27eaf1e6c22f6eb3e08d","observation_id":"c6362ec9-d4f5-47de-9628-1788387484f4","resolution":{"observed_at":"2026-08-09T20:49:37.983846Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.968206Z","title":null,"venue":null,"work_id":"2d0f2461-5c37-4f25-9d6f-5f718c19da19","year":2004},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.524275Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:4e31cfff4290d1f58ffd17df35521bcf2804dd4210d7e3556d93c00d02bc005c","observation_id":"344171f2-a9db-4d64-8cd2-52c3f4c13fd4","resolution":{"observed_at":"2026-08-09T20:49:37.972436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.957919Z","title":null,"venue":null,"work_id":"5a04528e-104a-451b-a393-e92ec616e025","year":2024},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.527990Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:5a175eeab3e3567b13a8a9431a27f7cd205d6f2944331c783da81294b292d35b","observation_id":"5396f447-2e38-4060-9f20-3360934cc7d8","resolution":{"observed_at":"2026-08-09T20:49:37.961391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.947635Z","title":"H.-C.; and Lou, J","venue":null,"work_id":"966b0e6e-0ba5-43f5-ac01-df7bf140d475","year":2023},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.531735Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:35073f03171031d7b929c4abd1301e6fd72a43c15f246620e195cd6d2aa9ec13","observation_id":"9260317f-049e-4c13-83ea-619c8b3d9ac2","resolution":{"observed_at":"2026-08-09T20:49:37.951099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.937010Z","title":null,"venue":null,"work_id":"9e171c2a-62ef-4755-a7e9-c9622dd38b44","year":2024},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.535462Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:c3c4ffb618cc66c4f7de6709a1ac4adc679e359668ed241a92d5d2ef71024830","observation_id":"f650fa4e-cf2c-4985-856f-a642e9a536a3","resolution":{"observed_at":"2026-08-09T20:49:37.940632Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.925649Z","title":null,"venue":null,"work_id":"faade7bf-201f-49fc-b834-a7ac5ada4741","year":1979},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.539071Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:4c1e47eb9f030bce1a9e27a4707ded68abdb9b406fd6c7ece2a387ac07b4b621","observation_id":"64eea0d8-84dc-49a8-a6ee-844bfdfe9727","resolution":{"observed_at":"2026-08-09T20:49:37.929675Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.914284Z","title":null,"venue":null,"work_id":"201539b9-bb57-4829-861d-60409b9274d0","year":1986},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.542761Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:e76a000454ef0c5bc79e5a8048e8828449cc273db6fa8cb0a93850b3f2a9ac59","observation_id":"e6657cd6-728c-411f-9dfe-341d5c043b7f","resolution":{"observed_at":"2026-08-09T20:49:37.918018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.902819Z","title":null,"venue":null,"work_id":"892ee812-04d1-449d-afd7-5cb3cd7be9cb","year":1990},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.546983Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:32944d6c708d48f9f887ac0036f927e7bfe430a1d726a50226240a01872f921c","observation_id":"58301c80-175e-4334-8b93-5d4c9b92dba6","resolution":{"observed_at":"2026-08-09T20:49:37.906946Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.891188Z","title":null,"venue":null,"work_id":"74cf208b-1001-422a-9880-ab7212105b13","year":1987},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.551141Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:1e8d2448571bded2af674115e70f8296c410a8957886adbbd511eb013de4d02b","observation_id":"652f170c-8417-4804-9e75-81dc965f8a3a","resolution":{"observed_at":"2026-08-09T20:49:37.894845Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.880208Z","title":null,"venue":null,"work_id":"96058843-131a-434d-8d13-d2def4e6c1fe","year":2008},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.555103Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:0c389c222e9b43ab5f7185825c2d75865f8d72c623c97b4edf14a1774b7e9acb","observation_id":"3fe57558-9c30-4cad-a61c-b932f9a0fbb6","resolution":{"observed_at":"2026-08-09T20:49:37.883838Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.869466Z","title":null,"venue":null,"work_id":"6304b928-ee2a-40ed-8ba0-6ad7b038fb2e","year":2019},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.558710Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:b272398b152a1e664bdba90fc637abf3036dde9d8926b201f737b454c07f1c02","observation_id":"a74dfaf2-e904-412b-b2aa-c2d00422dd9b","resolution":{"observed_at":"2026-08-09T20:49:37.873022Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.562149Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.562149Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:d2500db9e63b00a58796ff83b206feb97475f01145a202c0c97f465b489ce896","observation_id":"cd480442-edd0-4da5-9b03-06a0ec05920d","resolution":{"observed_at":"2026-08-09T20:49:37.562149Z","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-09T20:49:37.851045Z","title":null,"venue":null,"work_id":"69b5841c-acab-48d5-b729-34370d7ba50b","year":2019},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.565844Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:c95772aaa04c471697fd8a36864ea78e837494ca6c06b0f35c8c218b2c912acf","observation_id":"71f4ca1b-a961-4b0f-88ad-d713bedd0e14","resolution":{"observed_at":"2026-08-09T20:49:37.855104Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.840601Z","title":null,"venue":null,"work_id":"91953980-8875-4aac-9683-1690864fddb7","year":1994},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.569429Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:66f363e38e69705e529fc53e548bb513db952357787bd2dec351ddeeaa80128a","observation_id":"7ccc5ae9-e3ac-4aa6-97e9-689dca89bba2","resolution":{"observed_at":"2026-08-09T20:49:37.844269Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.827354Z","title":null,"venue":null,"work_id":"215db555-c06e-403f-9fdc-4b98177f34cd","year":2013},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.573247Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:a5d594ac5b6a577ca00e64cbd53ec668f24b9aab472192584b08f9329e2dd9e9","observation_id":"9cf1d06f-053b-4c8b-b0a2-0325ef261f30","resolution":{"observed_at":"2026-08-09T20:49:37.831153Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.817350Z","title":null,"venue":null,"work_id":"9220880c-d903-45df-bfbd-733bfa3c95b1","year":2012},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.577336Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:cadf526d5357c73efe19330b581ac6d795cafda2305bf86f2f348e32c0aa9f80","observation_id":"46f83e01-6dea-4d02-9d88-4a6da847ee26","resolution":{"observed_at":"2026-08-09T20:49:37.820967Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.807033Z","title":"R.; and Plaxton, C","venue":null,"work_id":"65db28d5-1304-4d39-ac8b-252bfe9f66a8","year":2004},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.582048Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:00ba5d3684d751207271f2c201bc98b79297d423faa4884106d7f97cecff51f9","observation_id":"b5e04e53-22d8-4da3-bfb9-f1569d1df894","resolution":{"observed_at":"2026-08-09T20:49:37.810694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.795622Z","title":null,"venue":null,"work_id":"8fe68f13-b7ad-419b-b6ac-cf2d247bd835","year":2004},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.585742Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:9617017b6b6e6aca85b7c50d99c41f1ab845c9b3f74377d767c8535287999378","observation_id":"b33fa0d9-6a78-4fbe-bcf8-8fe9faabdc3d","resolution":{"observed_at":"2026-08-09T20:49:37.799259Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.785169Z","title":null,"venue":null,"work_id":"cb458ea4-7e40-4b3e-8487-8297e1bc36bd","year":2001},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.589337Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:a8ae573254504604a3c624ba37fb3896766ee741a0fb3a2046957a7f30da4bcc","observation_id":"98e8a2b8-e753-4900-a130-3e3c4ec97f05","resolution":{"observed_at":"2026-08-09T20:49:37.788956Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.773677Z","title":null,"venue":null,"work_id":"ba52bfc0-0563-4821-bb82-f11d8b3ee2d1","year":2009},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.593300Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:21ad93e88b0e00cc6917ac62c7c5bff8072bb36fef237d15b15aed48bb4e2895","observation_id":"9b9ef6df-1ec5-4daa-8043-7fabcac85a57","resolution":{"observed_at":"2026-08-09T20:49:37.777764Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.761188Z","title":null,"venue":null,"work_id":"899614e9-4af9-4760-a7de-a27d0502df96","year":1999},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.597515Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:5382a2ea77b900d87a9b48e24931db035d8c5aa0d11141f6738eb467b21519a0","observation_id":"86e1c849-007d-49d9-b7a7-8d69b272e98c","resolution":{"observed_at":"2026-08-09T20:49:37.765207Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.748710Z","title":null,"venue":null,"work_id":"c9975ee0-7045-44f3-8c5f-0f1f46360a9c","year":2022},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.601662Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:4c59217a7e9638f13e7b1c83f3223f32b7771a29d3db3119c0d87077492a92e7","observation_id":"befd04cf-e0b3-4669-8cc6-b049d5acbe54","resolution":{"observed_at":"2026-08-09T20:49:37.753043Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.736151Z","title":null,"venue":null,"work_id":"97fb8090-93ae-428a-b5d3-23fcf5326f46","year":2020},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.605371Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:91552785256ff317aeb45da2734c7ff2d69e1460ae324a58489a267d1df54857","observation_id":"ffd579c0-344c-4808-8533-aacbf7a18f02","resolution":{"observed_at":"2026-08-09T20:49:37.740375Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.723048Z","title":null,"venue":null,"work_id":"6bca8cd5-b787-46fa-b061-3edaf465cec9","year":2022},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.609123Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:1c068891490007515e41b9636d30cc07e3b68813cde0209810ffa85ca0412f47","observation_id":"495e7b5b-9e45-49e7-80fe-102c2508e848","resolution":{"observed_at":"2026-08-09T20:49:37.727024Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.709294Z","title":null,"venue":null,"work_id":"d9a2ccb7-6c8e-48b2-b409-e68d72fe9b36","year":2021},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.613049Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:273c3042133bd235c32997ee155ed905eb0bf2ac5caab829120b6c777652cfe1","observation_id":"fcbdbf9b-dcff-4917-a99e-8f64a6c77541","resolution":{"observed_at":"2026-08-09T20:49:37.714066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.697540Z","title":null,"venue":null,"work_id":"cfbf0f11-170c-4961-b221-d3f9873d6ce7","year":2005},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.616829Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:3914756b5e2b34f22b7729abb27b79f80ac1231bb297c7d246e97823f600fabb","observation_id":"5e240dd5-fc57-41af-aaab-a77482e448f6","resolution":{"observed_at":"2026-08-09T20:49:37.701233Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.685241Z","title":null,"venue":null,"work_id":"f07d3105-c2a0-478e-96ce-41b8a1495cbe","year":2023},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.620803Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:923121e26d41cd0f77cffd305e435bb1a6beab811d9d722d28bf7dde1649bebe","observation_id":"cc61cf88-63dd-4d1f-bcd3-b4be9bd98abc","resolution":{"observed_at":"2026-08-09T20:49:37.690032Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.671791Z","title":"J.; Mayclin, J.; Thrun, S.; Piech, C.; and Shomorony, I","venue":null,"work_id":"ca0d138c-1a93-4655-9a62-47902f531f8e","year":2020},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.625406Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:d0be8268743df6a5070365507e4fdd250a9878367500137031594c5e3d858a78","observation_id":"e99ff144-5463-4182-bf06-d92a5c3757cf","resolution":{"observed_at":"2026-08-09T20:49:37.677156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-09T20:49:37.658194Z","title":null,"venue":null,"work_id":"ea21701a-cb7e-44c8-8845-087fd3cc95d4","year":2015},"citing_paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-09T20:49:37.630367Z"},"links":{"citing_paper":"/paper/2501.19285"},"observation_digest":"sha256:50f464509cee21e6c8545e6d0d22585f8a8f198ddba9882dd9c76720cd8aa1b0","observation_id":"f11ebc29-38a8-4d8a-9dff-a6264de47e71","resolution":{"observed_at":"2026-08-09T20:49:37.663213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.19285","last_updated":"2025-01-31T16:48:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T11:06:20.928763Z","submitted_at":"2025-01-31T16:48:16Z","title":"OneBatchPAM: A Fast and Frugal K-Medoids Algorithm"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":0,"verified_fuzzy":6},"total_outbound_references":53},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2501.19285."}