{"as_of":"2026-08-11T15:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4d5663c9f0d55511f9216f3fdb56e21bf72b7cbcc5940a9527eea472b19767b","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-11T06:34:44.6726+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":"1712.08212","last_updated":"2017-12-21T21:14:52Z","snapshot_observed_at":"2026-08-11T03:46:55.970105Z","submitted_at":"2017-12-21T21:14:52Z","title":"Submodular Optimization for Consensus Networks with Noise-Corrupted Leaders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.08212","snapshot_observed_at":"2026-07-14T16:11:18.394700Z","title":"Mackin, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09765","last_updated":"2026-07-07T05:48:17Z","snapshot_observed_at":"2026-08-08T09:46:42.940331Z","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":9,"source":"pdf_text","source_observed_at":"2026-07-14T16:11:18.394700Z"},"links":{"cited_paper":"/paper/1712.08212","citing_paper":"/paper/2607.09765"},"observation_digest":"sha256:0bc364b5b3d6bd15f7700d691307321e45371440ca9c885f8ff7495a384ae850","observation_id":"a151b73e-f70f-46e6-ba67-e6d4882f176e","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/1712.08212/citation-record","integrity":"/paper/1712.08212/integrity","json":"/paper/1712.08212/citation-record.json","paper":"/paper/1712.08212"},"outbound":[],"paper":{"arxiv_id":"1712.08212","last_updated":"2017-12-21T21:14:52Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T03:46:55.970105Z","submitted_at":"2017-12-21T21:14:52Z","title":"Submodular Optimization for Consensus Networks with Noise-Corrupted Leaders"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1712.08212."}