{"as_of":"2026-08-20T05:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:648d7282f6689f3d4cc0a12fdcc6e5d34760772a546b7366dfb147a61c2139bc","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-19T06:32:44.657259+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-05-24T17:47:38.948463Z","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-24T17:49:45.403962Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1006.2183","last_updated":"2010-06-11T02:10:58Z","snapshot_observed_at":"2026-08-15T10:43:53.432803Z","submitted_at":"2010-06-11T02:10:58Z","title":"Highly Parallel Sparse Matrix-Matrix Multiplication","version":1},"cited_work":{"arxiv_id":"1006.2183","doi":null,"metadata_source":"pith","pith_arxiv_id":"1006.2183","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Highly Parallel Sparse Matrix-Matrix Multiplication","venue":"cs.DC","work_id":"48e08364-3073-4f9f-9073-ba263338da31","year":2010},"citing_paper":{"arxiv_id":"1907.09575","last_updated":"2019-07-22T21:08:39Z","snapshot_observed_at":"2026-08-18T19:47:05.501167Z","submitted_at":"2019-07-22T21:08:39Z","title":"A 2D Parallel Triangle Counting Algorithm for Distributed-Memory Architectures","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T17:47:38.948463Z"},"links":{"cited_paper":"/paper/1006.2183","citing_paper":"/paper/1907.09575"},"observation_digest":"sha256:5fbc3a6f47eb102fcad4c7780cb9ae79237da0f214b3f204a520ee3a90053c08","observation_id":"8f7e26b4-6f7e-4e2a-8b76-ff5b99747f48","resolution":{"observed_at":"2026-05-24T17:49:45.411549Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1006.2183/citation-record","integrity":"/paper/1006.2183/integrity","json":"/paper/1006.2183/citation-record.json","paper":"/paper/1006.2183"},"outbound":[],"paper":{"arxiv_id":"1006.2183","last_updated":"2010-06-11T02:10:58Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-15T10:43:53.432803Z","submitted_at":"2010-06-11T02:10:58Z","title":"Highly Parallel Sparse Matrix-Matrix Multiplication"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1006.2183."}