{"as_of":"2026-08-17T06:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22024dd2297a9fd91e131335ae263565422da694f0761a09ccb7a87e2df7aafd","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-16T06:30:59.297886+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-14T14:42:07.475071Z","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-14T14:42:07.579912Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1305.5520","last_updated":"2013-11-20T19:16:07Z","snapshot_observed_at":"2026-08-15T00:16:48.829530Z","submitted_at":"2013-05-23T19:13:15Z","title":"Distributed Minimum Cut Approximation","version":2},"cited_work":{"arxiv_id":"1305.5520","doi":null,"metadata_source":"pith","pith_arxiv_id":"1305.5520","snapshot_observed_at":"2026-08-14T14:42:07.579912Z","title":"Distributed Minimum Cut Approximation","venue":"cs.DS","work_id":"a0dc2a67-18fc-40b2-a007-788460420747","year":2013},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.475071Z"},"links":{"cited_paper":"/paper/1305.5520","citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:c6af8a2c4ae504fd5d8135b08c9061adefc3d0acfbfb9e30e193b5a190156e23","observation_id":"bee75c45-7933-45b2-995e-451b9b2cd137","resolution":{"observed_at":"2026-08-14T14:42:07.583306Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1305.5520/citation-record","integrity":"/paper/1305.5520/integrity","json":"/paper/1305.5520/citation-record.json","paper":"/paper/1305.5520"},"outbound":[],"paper":{"arxiv_id":"1305.5520","last_updated":"2013-11-20T19:16:07Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T00:16:48.829530Z","submitted_at":"2013-05-23T19:13:15Z","title":"Distributed Minimum Cut Approximation"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1305.5520."}