{"as_of":"2026-08-13T14:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1fef916bd21fd357001080831f03b7264dbfbeb7f019b0714dd40fdee2e8c936","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-13T06:32:02.005865+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-12T05:46:28.302756Z","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-12T05:46:28.416305Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.02268","last_updated":"2025-01-30T05:42:06Z","snapshot_observed_at":"2026-08-12T22:08:06.183992Z","submitted_at":"2024-11-04T16:58:36Z","title":"Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches","version":3},"cited_work":{"arxiv_id":"2411.02268","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.02268","snapshot_observed_at":"2026-08-12T05:46:28.416305Z","title":"Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches","venue":"cs.SI","work_id":"9294aeaa-e193-4164-9b2e-6e6f8322f101","year":2024},"citing_paper":{"arxiv_id":"2411.19901","last_updated":"2024-11-29T18:04:05Z","snapshot_observed_at":"2026-08-13T02:23:04.302756Z","submitted_at":"2024-11-29T18:04:05Z","title":"Memory Efficient GPU-based Label Propagation Algorithm (LPA) for Community Detection on Large Graphs","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-12T05:46:28.302756Z"},"links":{"cited_paper":"/paper/2411.02268","citing_paper":"/paper/2411.19901"},"observation_digest":"sha256:7c50de5653cb9b96882f2e19f701be80bcbcdcfbd300aa39309b9bd60d93aa7f","observation_id":"2f981bef-7173-4bcf-b348-9148fb564d77","resolution":{"observed_at":"2026-08-12T05:46:28.422096Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.02268/citation-record","integrity":"/paper/2411.02268/integrity","json":"/paper/2411.02268/citation-record.json","paper":"/paper/2411.02268"},"outbound":[],"paper":{"arxiv_id":"2411.02268","last_updated":"2025-01-30T05:42:06Z","latest_version":3,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-12T22:08:06.183992Z","submitted_at":"2024-11-04T16:58:36Z","title":"Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2411.02268."}