{"as_of":"2026-08-15T18:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58582a0cc579e38bfb52ce5c77917b6096c07d832c1ccde78c4b7493b23d2dcd","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-15T06:32:42.880941+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-12T19:50:42.716012Z","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-12T19:50:43.157043Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.04806","last_updated":"2020-05-10T22:54:36Z","snapshot_observed_at":"2026-08-15T16:10:06.857879Z","submitted_at":"2020-05-10T22:54:36Z","title":"Comparison and Benchmark of Graph Clustering Algorithms","version":1},"cited_work":{"arxiv_id":"2005.04806","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.04806","snapshot_observed_at":"2026-08-12T19:50:43.157043Z","title":"Comparison and Benchmark of Graph Clustering Algorithms","venue":"cs.SI","work_id":"760ce83e-a203-4aec-870f-c0f0a35ce276","year":2020},"citing_paper":{"arxiv_id":"2411.10290","last_updated":"2024-11-15T15:47:32Z","snapshot_observed_at":"2026-08-13T04:54:40.689979Z","submitted_at":"2024-11-15T15:47:32Z","title":"The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T19:50:42.716012Z"},"links":{"cited_paper":"/paper/2005.04806","citing_paper":"/paper/2411.10290"},"observation_digest":"sha256:c7a99b08b27660dff18e867676b22b7d3af020fcc23d6cb46629ba0cd05e5b29","observation_id":"e3514552-88c5-47aa-b8f0-0c627ba201fb","resolution":{"observed_at":"2026-08-12T19:50:43.171876Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2005.04806/citation-record","integrity":"/paper/2005.04806/integrity","json":"/paper/2005.04806/citation-record.json","paper":"/paper/2005.04806"},"outbound":[],"paper":{"arxiv_id":"2005.04806","last_updated":"2020-05-10T22:54:36Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-15T16:10:06.857879Z","submitted_at":"2020-05-10T22:54:36Z","title":"Comparison and Benchmark of Graph Clustering Algorithms"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2005.04806."}