{"as_of":"2026-08-20T03:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:350173584b6f4ef6c01c127fa6f10750e1c8c5accc11b31cfb768ae98fe17cc8","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:44:55.313456Z","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-07-03T13:18:12.924017Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.10418","last_updated":"2025-06-10T18:04:41Z","snapshot_observed_at":"2026-08-18T00:31:53.561678Z","submitted_at":"2024-10-14T12:10:52Z","title":"Unified Breakdown Analysis for Byzantine Robust Gossip","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10418","snapshot_observed_at":"2026-08-16T10:44:55.313456Z","title":"Unified breakdown analysis for byzantine robust gossip,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.17471","last_updated":"2026-06-01T14:09:03Z","snapshot_observed_at":"2026-08-17T05:37:01.897703Z","submitted_at":"2025-04-24T12:03:15Z","title":"GRANITE : a Byzantine-Resilient Dynamic Gossip Learning Framework","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T10:44:55.313456Z"},"links":{"cited_paper":"/paper/2410.10418","citing_paper":"/paper/2504.17471"},"observation_digest":"sha256:952f62db8f1814b65924304bef550b16817481b3a9118d88188383ac28c9dafb","observation_id":"acda48b4-5a43-4559-8ef6-724f07ade0a8","resolution":{"observed_at":"2026-08-16T10:44:55.313456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10418","last_updated":"2025-06-10T18:04:41Z","snapshot_observed_at":"2026-08-18T00:31:53.561678Z","submitted_at":"2024-10-14T12:10:52Z","title":"Unified Breakdown Analysis for Byzantine Robust Gossip","version":3},"cited_work":{"arxiv_id":"2410.10418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10418","snapshot_observed_at":"2026-07-03T13:18:12.924017Z","title":null,"venue":null,"work_id":"6110f43c-32ce-4759-bbbf-c461024483ab","year":2024},"citing_paper":{"arxiv_id":"2606.12246","last_updated":"2026-06-10T15:48:31Z","snapshot_observed_at":"2026-08-12T23:27:33.467854Z","submitted_at":"2026-06-10T15:48:31Z","title":"Efficient and Robust Online Learning to Rank in Decentralized Systems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T08:16:52.079166Z"},"links":{"cited_paper":"/paper/2410.10418","citing_paper":"/paper/2606.12246"},"observation_digest":"sha256:e0c4c795702a163ec6a212116e2d94b7d11995d2b37a5de5bf7a288658d61ae7","observation_id":"47a3673b-a1c8-488d-937d-24da7ef0f446","resolution":{"observed_at":"2026-07-03T13:18:12.925579Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10418","last_updated":"2025-06-10T18:04:41Z","snapshot_observed_at":"2026-08-18T00:31:53.561678Z","submitted_at":"2024-10-14T12:10:52Z","title":"Unified Breakdown Analysis for Byzantine Robust Gossip","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10418","snapshot_observed_at":"2026-08-06T00:39:24.016852Z","title":"Unified breakdown analysis for byzantine robust gossip,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.03156","last_updated":"2026-08-04T05:45:35Z","snapshot_observed_at":"2026-08-18T02:20:10.525923Z","submitted_at":"2026-08-04T05:45:35Z","title":"Trust-Aware Topology Learning for Dynamic Decentralized Federated Learning under Adversaries","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T00:39:24.016852Z"},"links":{"cited_paper":"/paper/2410.10418","citing_paper":"/paper/2608.03156"},"observation_digest":"sha256:0e235ab966252353706f927046ccb22f8f8a64aaa972ae7a3f82d60645bb9822","observation_id":"58d94e66-69bf-4b69-9a40-0d3503c14bbc","resolution":{"observed_at":"2026-08-06T00:39:24.016852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.10418/citation-record","integrity":"/paper/2410.10418/integrity","json":"/paper/2410.10418/citation-record.json","paper":"/paper/2410.10418"},"outbound":[],"paper":{"arxiv_id":"2410.10418","last_updated":"2025-06-10T18:04:41Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T00:31:53.561678Z","submitted_at":"2024-10-14T12:10:52Z","title":"Unified Breakdown Analysis for Byzantine Robust Gossip"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2410.10418."}