{"as_of":"2026-08-01T12:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04bc1df4dc037b2795ce96a15f1dd62c8947642a38ab04ed3f0c882ba639f586","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-01T06:32:01.292127+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-14T16:11:18.394700Z","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":"1302.0450","last_updated":"2013-05-29T17:46:56Z","snapshot_observed_at":"2026-07-06T03:05:30.431173Z","submitted_at":"2013-02-03T03:21:11Z","title":"Algorithms for leader selection in stochastically forced consensus networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1302.0450","snapshot_observed_at":"2026-07-14T16:11:18.394700Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.09765","last_updated":"2026-07-07T05:48:17Z","snapshot_observed_at":"2026-07-16T23:18:00.873654Z","submitted_at":"2026-07-07T05:48:17Z","title":"How Much Does Correctness Cost? Budgeted Placement of Strong Correctors in a Weak Multi-Agent Swarm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T16:11:18.394700Z"},"links":{"cited_paper":"/paper/1302.0450","citing_paper":"/paper/2607.09765"},"observation_digest":"sha256:915fda68169e64242d22fbd6f0bbd441f0b9a568ab92f86cb95bf9a71b3e3273","observation_id":"8324cbbf-5ad3-4a64-a787-87b57e19c8d8","resolution":{"observed_at":"2026-07-14T16:11:18.394700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1302.0450/citation-record","integrity":"/paper/1302.0450/integrity","json":"/paper/1302.0450/citation-record.json","paper":"/paper/1302.0450"},"outbound":[],"paper":{"arxiv_id":"1302.0450","last_updated":"2013-05-29T17:46:56Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T03:05:30.431173Z","submitted_at":"2013-02-03T03:21:11Z","title":"Algorithms for leader selection in stochastically forced consensus networks"},"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-01T06:32:01.292127+00:00","source":"crossref"},{"observed_at":"2026-08-01T06:31:58.492377+00:00","source":"retraction_watch"}],"thesis":"As of 1 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1302.0450."}