{"as_of":"2026-08-09T07:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f6392896b3a55dc318aa9d4647ec7e8f14cbd3dd173d9410867007768f9cc53c","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-09T06:31:02.800959+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-07T12:54:26.666426Z","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-07T12:54:26.790912Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.08070","last_updated":"2025-01-03T13:23:21Z","snapshot_observed_at":"2026-08-08T12:52:04.232323Z","submitted_at":"2024-04-11T18:16:25Z","title":"Byzantine Reliable Broadcast with Low Communication and Time Complexity","version":2},"cited_work":{"arxiv_id":"2404.08070","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.08070","snapshot_observed_at":"2026-08-07T12:54:26.790912Z","title":"Byzantine Reliable Broadcast with Low Communication and Time Complexity","venue":"cs.DC","work_id":"841812ea-9ed2-4a30-b875-a77ca79f5267","year":2024},"citing_paper":{"arxiv_id":"2505.23246","last_updated":"2025-08-01T12:05:03Z","snapshot_observed_at":"2026-08-07T12:47:18.602655Z","submitted_at":"2025-05-29T08:53:47Z","title":"How to Evaluate Participant Contributions in Decentralized Federated Learning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T12:54:26.666426Z"},"links":{"cited_paper":"/paper/2404.08070","citing_paper":"/paper/2505.23246"},"observation_digest":"sha256:a19c52c62b830e88b00698bada7c7ece4e43ee60ab1804885e05d53743f78394","observation_id":"ea66add3-f8eb-447d-8536-eae9839fb979","resolution":{"observed_at":"2026-08-07T12:54:26.883112Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.08070/citation-record","integrity":"/paper/2404.08070/integrity","json":"/paper/2404.08070/citation-record.json","paper":"/paper/2404.08070"},"outbound":[],"paper":{"arxiv_id":"2404.08070","last_updated":"2025-01-03T13:23:21Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-08T12:52:04.232323Z","submitted_at":"2024-04-11T18:16:25Z","title":"Byzantine Reliable Broadcast with Low Communication and Time Complexity"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.08070."}