{"as_of":"2026-08-08T21:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:229ab77fd4a04d7c7a881748134b09e76715b8bca0e6a2f8f9d2da26f011468d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T09:14:46.072879Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-20T22:49:10.701005Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1111.0352","last_updated":"2012-06-14T15:05:55Z","snapshot_observed_at":"2026-07-06T02:36:49.729256Z","submitted_at":"2011-11-02T00:09:18Z","title":"Revisiting k-means: New Algorithms via Bayesian Nonparametrics","version":2},"cited_work":{"arxiv_id":"1111.0352","doi":null,"metadata_source":"pith","pith_arxiv_id":"1111.0352","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting k-means: New Algorithms via Bayesian Nonparametrics","venue":"cs.LG","work_id":"db716498-0756-4dc5-9ab3-303d80fe65d6","year":2011},"citing_paper":{"arxiv_id":"2605.16383","last_updated":"2026-05-11T09:43:43Z","snapshot_observed_at":"2026-07-06T23:27:34.514541Z","submitted_at":"2026-05-11T09:43:43Z","title":"A neurosymbolic Approach with Epistemic Deep Learning for Hierarchical Image Classification","version":1},"reference_index":123,"source":"arxiv_source","source_observed_at":"2026-05-20T22:45:48.618066Z"},"links":{"cited_paper":"/paper/1111.0352","citing_paper":"/paper/2605.16383"},"observation_digest":"sha256:95bed09e63ab3c085f368e791be37617f4149f81d3a16ab9efd0fd711212df5e","observation_id":"938b4097-6293-4151-968a-d2bc74b94044","resolution":{"observed_at":"2026-05-20T22:49:10.704646Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1111.0352","last_updated":"2012-06-14T15:05:55Z","snapshot_observed_at":"2026-07-06T02:36:49.729256Z","submitted_at":"2011-11-02T00:09:18Z","title":"Revisiting k-means: New Algorithms via Bayesian Nonparametrics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1111.0352","snapshot_observed_at":"2026-07-14T14:50:03.831572Z","title":"[Lample et al.(2019)] G","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09889","last_updated":"2026-07-10T18:28:21Z","snapshot_observed_at":"2026-08-02T12:00:29.141267Z","submitted_at":"2026-07-10T18:28:21Z","title":"Remembering Distinct Items, Not Tokens: A Learnable Dirichlet-Process Cache Between State-Space Models and Attention","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T14:50:03.831572Z"},"links":{"cited_paper":"/paper/1111.0352","citing_paper":"/paper/2607.09889"},"observation_digest":"sha256:c4c34abf09eeb227c08d0010614efccb77a9cf3ddf049c5bdecd21068002f9ec","observation_id":"29285f49-c0bd-479d-b217-f92f9c13e7e7","resolution":{"observed_at":"2026-07-14T14:50:03.831572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1111.0352","last_updated":"2012-06-14T15:05:55Z","snapshot_observed_at":"2026-07-06T02:36:49.729256Z","submitted_at":"2011-11-02T00:09:18Z","title":"Revisiting k-means: New Algorithms via Bayesian Nonparametrics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1111.0352","snapshot_observed_at":"2026-07-14T11:45:09.424370Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10441","last_updated":"2026-07-11T18:58:22Z","snapshot_observed_at":"2026-08-08T12:08:13.956705Z","submitted_at":"2026-07-11T18:58:22Z","title":"Context by Distinct Information: An Auditable Dirichlet-Process Working Memory for Long, Redundant Context Streams","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T11:45:09.424370Z"},"links":{"cited_paper":"/paper/1111.0352","citing_paper":"/paper/2607.10441"},"observation_digest":"sha256:57d578410c0780658cb63116baf72015d7a8e1babd707fbcced97117682094e7","observation_id":"3e4e6f1a-9dfa-4114-b2e5-0526f0b608e0","resolution":{"observed_at":"2026-07-14T11:45:09.424370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1111.0352","last_updated":"2012-06-14T15:05:55Z","snapshot_observed_at":"2026-07-06T02:36:49.729256Z","submitted_at":"2011-11-02T00:09:18Z","title":"Revisiting k-means: New Algorithms via Bayesian Nonparametrics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1111.0352","snapshot_observed_at":"2026-08-01T09:14:46.072879Z","title":"arXiv preprint arXiv:1111.0352 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-08T01:14:22.114838Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.072879Z"},"links":{"cited_paper":"/paper/1111.0352","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:6fd50ba3436263a35e59b8d2622a4eeb7ccea660b68b1ae62ecb6a21b9c16063","observation_id":"56558e95-4bc4-449b-84f5-59c76bf7a520","resolution":{"observed_at":"2026-08-01T09:14:46.072879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1111.0352/citation-record","integrity":"/paper/1111.0352/integrity","json":"/paper/1111.0352/citation-record.json","paper":"/paper/1111.0352"},"outbound":[],"paper":{"arxiv_id":"1111.0352","last_updated":"2012-06-14T15:05:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T02:36:49.729256Z","submitted_at":"2011-11-02T00:09:18Z","title":"Revisiting k-means: New Algorithms via Bayesian Nonparametrics"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1111.0352."}