{"as_of":"2026-08-15T09:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6af9bc469cf7cd126445b63306fc30125fcf1252831fed77149589342770ff24","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-07-31T02:32:37.844470Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1402.3851","last_updated":"2014-04-17T20:45:01Z","snapshot_observed_at":"2026-08-15T09:23:10.767200Z","submitted_at":"2014-02-16T22:28:54Z","title":"Simple parallel and distributed algorithms for spectral graph sparsification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.3851","snapshot_observed_at":"2026-07-31T02:32:37.844470Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25059","last_updated":"2026-07-27T20:42:27Z","snapshot_observed_at":"2026-08-04T22:20:25.698074Z","submitted_at":"2026-07-27T20:42:27Z","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-07-31T02:32:37.844470Z"},"links":{"cited_paper":"/paper/1402.3851","citing_paper":"/paper/2607.25059"},"observation_digest":"sha256:20a4f71b388287e22aaed50839d8e279032f4ea41b29480e3eaefce2510d0a38","observation_id":"af23b93c-2a49-4663-841c-c570b34254d5","resolution":{"observed_at":"2026-07-31T02:32:37.844470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1402.3851/citation-record","integrity":"/paper/1402.3851/integrity","json":"/paper/1402.3851/citation-record.json","paper":"/paper/1402.3851"},"outbound":[],"paper":{"arxiv_id":"1402.3851","last_updated":"2014-04-17T20:45:01Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T09:23:10.767200Z","submitted_at":"2014-02-16T22:28:54Z","title":"Simple parallel and distributed algorithms for spectral graph sparsification"},"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:1402.3851."}