{"as_of":"2026-08-22T01:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d374a7f05276f82de1c71576cf6d178d2b20acffa7f2ca2e22b624a8ada2857c","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-21T06:32:19.484+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-16T12:13:30.161220Z","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-11T15:21:08.055152Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.16201","last_updated":"2025-04-24T02:50:21Z","snapshot_observed_at":"2026-08-21T14:44:47.580369Z","submitted_at":"2024-02-25T21:29:44Z","title":"Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16201","snapshot_observed_at":"2026-08-16T12:13:30.161220Z","title":"Honeybee: Decentralized peer sampling with verifiable random walks for blockchain data sharding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-21T22:46:47.061556Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.161220Z"},"links":{"cited_paper":"/paper/2402.16201","citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:e5b708ae99b85097cf61f198f7dcfb43771df31d53248176cc33f36b87d83650","observation_id":"9ca12c09-ada2-47b4-ba22-2962a119d438","resolution":{"observed_at":"2026-08-16T12:13:30.161220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16201","last_updated":"2025-04-24T02:50:21Z","snapshot_observed_at":"2026-08-21T14:44:47.580369Z","submitted_at":"2024-02-25T21:29:44Z","title":"Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks","version":4},"cited_work":{"arxiv_id":"2402.16201","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16201","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Honeybee: Byzantine Tol- erant Decentralized Peer Sampling with Verifiable Random Walks","venue":null,"work_id":"584764e6-3c03-489c-8db9-d089432bc554","year":2024},"citing_paper":{"arxiv_id":"2605.04091","last_updated":"2026-04-26T14:38:58Z","snapshot_observed_at":"2026-08-15T08:15:09.599573Z","submitted_at":"2026-04-26T14:38:58Z","title":"OpenCLAW-Nexus: A Self-Reinforcing Trust Framework for Byzantine-Resilient Decentralized Federated Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-09T20:12:02.031151Z"},"links":{"cited_paper":"/paper/2402.16201","citing_paper":"/paper/2605.04091"},"observation_digest":"sha256:879914ef0c5b978109d8d4ac35a474578daa473b17d31315d49b1f445d514ce8","observation_id":"7de28cf7-d60d-4e54-9890-6c543f8eca98","resolution":{"observed_at":"2026-05-11T15:21:08.067352Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.16201/citation-record","integrity":"/paper/2402.16201/integrity","json":"/paper/2402.16201/citation-record.json","paper":"/paper/2402.16201"},"outbound":[],"paper":{"arxiv_id":"2402.16201","last_updated":"2025-04-24T02:50:21Z","latest_version":4,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-21T14:44:47.580369Z","submitted_at":"2024-02-25T21:29:44Z","title":"Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.16201."}