{"as_of":"2026-08-09T07:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa50476ce855add3c20f245011fb7d9393949e1d53a17879dc75918e96fe93d8","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:24:58.721367Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T05:24:58.816663Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1304.6478","last_updated":"2013-04-24T03:59:39Z","snapshot_observed_at":"2026-07-06T03:11:51.813034Z","submitted_at":"2013-04-24T03:59:39Z","title":"The K-modes algorithm for clustering","version":1},"cited_work":{"arxiv_id":"1304.6478","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.6478","snapshot_observed_at":"2026-08-07T05:24:58.816663Z","title":"The K-modes algorithm for clustering","venue":"cs.LG","work_id":"40bcbb94-104b-412e-99e8-b5b0757d7f20","year":2013},"citing_paper":{"arxiv_id":"2506.08143","last_updated":"2025-06-09T18:46:27Z","snapshot_observed_at":"2026-08-07T05:16:18.455599Z","submitted_at":"2025-06-09T18:46:27Z","title":"Accelerating Spectral Clustering under Fairness Constraints","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:58.721367Z"},"links":{"cited_paper":"/paper/1304.6478","citing_paper":"/paper/2506.08143"},"observation_digest":"sha256:3084194ef3b6c1fcce3b91a6af45ecede1a6fdd84a9f5886b5c9c47d8c0b2760","observation_id":"c71b234a-a336-4b3f-b3f4-b1d11befc547","resolution":{"observed_at":"2026-08-07T05:24:58.822355Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1304.6478/citation-record","integrity":"/paper/1304.6478/integrity","json":"/paper/1304.6478/citation-record.json","paper":"/paper/1304.6478"},"outbound":[],"paper":{"arxiv_id":"1304.6478","last_updated":"2013-04-24T03:59:39Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T03:11:51.813034Z","submitted_at":"2013-04-24T03:59:39Z","title":"The K-modes algorithm for clustering"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1304.6478."}