{"as_of":"2026-08-09T11:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8396207dc9256a8aa81e8e293580ee3bb9efcdbe669993d41208fe3f8f8444e","coverage":[{"denominator":2,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T11:31:18.596719Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T10:07:59.401967Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2601.06351","last_updated":"2026-06-22T20:38:24Z","snapshot_observed_at":"2026-08-06T02:54:00.651373Z","submitted_at":"2026-01-09T23:14:19Z","title":"A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.06351","snapshot_observed_at":"2026-08-01T10:07:59.401967Z","title":"org/abs/2601.06351","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20367","last_updated":"2026-07-22T16:58:45Z","snapshot_observed_at":"2026-08-09T10:15:19.681890Z","submitted_at":"2026-07-22T16:58:45Z","title":"Variance-reduced Domain Adaptation using Paired Sampling","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T10:07:59.401967Z"},"links":{"cited_paper":"/paper/2601.06351","citing_paper":"/paper/2607.20367"},"observation_digest":"sha256:66e84052e4f3162d12e4d8777273f491e97f84de753ae94d9b6f0fcef1454a23","observation_id":"c3cfa12d-7017-4c01-a5cc-bae6f405e4b2","resolution":{"observed_at":"2026-08-01T10:07:59.401967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.06351","last_updated":"2026-06-22T20:38:24Z","snapshot_observed_at":"2026-08-06T02:54:00.651373Z","submitted_at":"2026-01-09T23:14:19Z","title":"A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.06351","snapshot_observed_at":"2026-08-01T10:04:11.207916Z","title":"org/abs/2601.06351","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20374","last_updated":"2026-07-22T17:04:29Z","snapshot_observed_at":"2026-08-08T12:15:02.666378Z","submitted_at":"2026-07-22T17:04:29Z","title":"Online Variance Reduction for Domain Adaptation on Streaming Data","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T10:04:11.207916Z"},"links":{"cited_paper":"/paper/2601.06351","citing_paper":"/paper/2607.20374"},"observation_digest":"sha256:3697c6e94778cc747d38948d684adcc87cc5e1cd26c3a5666c973fc187a491ce","observation_id":"01abbe62-103a-4b3c-8240-28815010949c","resolution":{"observed_at":"2026-08-01T10:04:11.207916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.06351/citation-record","integrity":"/paper/2601.06351/integrity","json":"/paper/2601.06351/citation-record.json","paper":"/paper/2601.06351"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T11:31:18.508915Z","title":"Strong bounds for large-scale minimum sum-of- squares clustering.arXiv preprint arXiv:2502.08397,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.06351","last_updated":"2026-06-22T20:38:24Z","snapshot_observed_at":"2026-08-06T02:54:00.651373Z","submitted_at":"2026-01-09T23:14:19Z","title":"A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm","version":2},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:18.508915Z"},"links":{"citing_paper":"/paper/2601.06351"},"observation_digest":"sha256:edcb7373cf6d2ff207fa63ae60b8e6a6ffc612ea296436b14c9acc4a918246a0","observation_id":"a0220de4-95be-4878-acb9-9a0ae6dc833d","resolution":{"observed_at":"2026-08-03T11:31:18.508915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.08771","last_updated":"2019-06-20T17:53:15Z","snapshot_observed_at":"2026-08-07T22:48:51.384846Z","submitted_at":"2019-06-20T17:53:15Z","title":"Submodular Batch Selection for Training Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.08771","snapshot_observed_at":"2026-08-03T11:31:18.596719Z","title":"Submodular batch selection for training deep neural networks.arXiv preprint arXiv:1906.08771,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2601.06351","last_updated":"2026-06-22T20:38:24Z","snapshot_observed_at":"2026-08-06T02:54:00.651373Z","submitted_at":"2026-01-09T23:14:19Z","title":"A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:18.596719Z"},"links":{"cited_paper":"/paper/1906.08771","citing_paper":"/paper/2601.06351"},"observation_digest":"sha256:78de97689dca34b00dd3f751e8bccc3ac3d42677093190cf1ea49494b1a9b790","observation_id":"0b9b2de5-deb5-4dd2-b7aa-276814153fa4","resolution":{"observed_at":"2026-08-03T11:31:18.596719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.06351","last_updated":"2026-06-22T20:38:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T02:54:00.651373Z","submitted_at":"2026-01-09T23:14:19Z","title":"A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm"},"reference_resolution":{"displayed":2,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":2},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 2 of 2 outbound references and 2 inbound Pith citation observations for arXiv:2601.06351."}