{"as_of":"2026-08-13T16:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4b2f0ead1d6b3c178f13d354e0453cdd2d6606ea6985de0e52dac3248a590755","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-13T06:32:02.005865+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-03T15:07:06.887351Z","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":"2509.07543","last_updated":"2025-09-11T14:39:19Z","snapshot_observed_at":"2026-08-10T07:26:32.077945Z","submitted_at":"2025-09-09T09:23:36Z","title":"Asynchronous Gossip Algorithms for Rank-Based Statistical Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.07543","snapshot_observed_at":"2026-08-03T15:07:06.887351Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.18444","last_updated":"2026-05-26T18:28:53Z","snapshot_observed_at":"2026-08-13T09:26:44.506981Z","submitted_at":"2025-12-20T17:31:55Z","title":"Snowveil: A Framework for Decentralised Preference Discovery","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T15:07:06.887351Z"},"links":{"cited_paper":"/paper/2509.07543","citing_paper":"/paper/2512.18444"},"observation_digest":"sha256:a9b11f30069059a2657978e336abb2d207f614e5653405a678166475f65a21de","observation_id":"8ec2f832-f878-4ea5-9377-1cbde6270653","resolution":{"observed_at":"2026-08-03T15:07:06.887351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.07543/citation-record","integrity":"/paper/2509.07543/integrity","json":"/paper/2509.07543/citation-record.json","paper":"/paper/2509.07543"},"outbound":[],"paper":{"arxiv_id":"2509.07543","last_updated":"2025-09-11T14:39:19Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-10T07:26:32.077945Z","submitted_at":"2025-09-09T09:23:36Z","title":"Asynchronous Gossip Algorithms for Rank-Based Statistical Methods"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2509.07543."}