{"as_of":"2026-08-08T23:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c1696cb54c6b48664a838f971be6cfb42b76bce53f6f4e4721ffe921dbd6a7d","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:56:23.096823Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T07:36:00.092763Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.16123","last_updated":"2025-07-27T06:22:45Z","snapshot_observed_at":"2026-08-07T16:49:14.572182Z","submitted_at":"2025-03-20T13:11:44Z","title":"Distributed Learning over Arbitrary Topology: Linear Speed-Up with Polynomial Transient Time","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16123","snapshot_observed_at":"2026-08-07T05:56:23.096823Z","title":"YOU ANDS","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07021","last_updated":"2025-06-08T07:02:22Z","snapshot_observed_at":"2026-08-08T09:34:49.520388Z","submitted_at":"2025-06-08T07:02:22Z","title":"Stochastic Push-Pull for Decentralized Nonconvex Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T05:56:23.096823Z"},"links":{"cited_paper":"/paper/2503.16123","citing_paper":"/paper/2506.07021"},"observation_digest":"sha256:7e06c579c387c6418f22f72aadee911e67e3a1bceed5f70d2d58353013f60e99","observation_id":"b86fa3cb-f8c8-4533-bd3a-2866bd3ed699","resolution":{"observed_at":"2026-08-07T05:56:23.096823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16123","last_updated":"2025-07-27T06:22:45Z","snapshot_observed_at":"2026-08-07T16:49:14.572182Z","submitted_at":"2025-03-20T13:11:44Z","title":"Distributed Learning over Arbitrary Topology: Linear Speed-Up with Polynomial Transient Time","version":2},"cited_work":{"arxiv_id":"2503.16123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.16123","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed learning over arbitrary topology: Linear speed-up with polynomial transient time","venue":null,"work_id":"4997d69a-ea27-41aa-bf8e-3cdb84a30d1f","year":2025},"citing_paper":{"arxiv_id":"2604.08219","last_updated":"2026-04-09T13:15:34Z","snapshot_observed_at":"2026-07-06T22:57:22.475588Z","submitted_at":"2026-04-09T13:15:34Z","title":"Stochastic Momentum Tracking Push-Pull for Decentralized Optimization over Directed Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T17:05:01.911625Z"},"links":{"cited_paper":"/paper/2503.16123","citing_paper":"/paper/2604.08219"},"observation_digest":"sha256:9c9a05f0c2a42f11a604abe2a7496425222a18c8695134e6e6cd61fa57c13645","observation_id":"5a616a36-1fcf-49d8-9d2e-d666cec38608","resolution":{"observed_at":"2026-05-11T07:36:00.096508Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.16123/citation-record","integrity":"/paper/2503.16123/integrity","json":"/paper/2503.16123/citation-record.json","paper":"/paper/2503.16123"},"outbound":[],"paper":{"arxiv_id":"2503.16123","last_updated":"2025-07-27T06:22:45Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T16:49:14.572182Z","submitted_at":"2025-03-20T13:11:44Z","title":"Distributed Learning over Arbitrary Topology: Linear Speed-Up with Polynomial Transient Time"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2503.16123."}