{"as_of":"2026-08-08T19:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55905227d8c599a9cba49df9c59cb82bdba17a73db77e83d98d107cb59bdbb62","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-08T06:32:00.761636+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-07T10:17:53.548952Z","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-07T10:17:53.747444Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2008.04450","last_updated":"2020-08-10T23:06:29Z","snapshot_observed_at":"2026-08-08T10:23:56.064374Z","submitted_at":"2020-08-10T23:06:29Z","title":"Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing","version":1},"cited_work":{"arxiv_id":"2008.04450","doi":null,"metadata_source":"pith","pith_arxiv_id":"2008.04450","snapshot_observed_at":"2026-08-07T10:17:53.747444Z","title":"Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing","venue":"cs.DC","work_id":"1f9aa423-c66e-4dca-a97f-852145175a7a","year":2020},"citing_paper":{"arxiv_id":"2506.05932","last_updated":"2025-06-06T09:57:03Z","snapshot_observed_at":"2026-08-07T10:10:55.046349Z","submitted_at":"2025-06-06T09:57:03Z","title":"Combating Reentrancy Bugs on Sharded Blockchains","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:17:53.548952Z"},"links":{"cited_paper":"/paper/2008.04450","citing_paper":"/paper/2506.05932"},"observation_digest":"sha256:8e7b8ab17f1f3ae27755e90908f71a8cb8bdf1a6672703a24424c2035322d403","observation_id":"9140b711-f69d-40e8-9ed4-2a707a78c32a","resolution":{"observed_at":"2026-08-07T10:17:53.750814Z","resolver_source":"local_arxiv","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/2008.04450/citation-record","integrity":"/paper/2008.04450/integrity","json":"/paper/2008.04450/citation-record.json","paper":"/paper/2008.04450"},"outbound":[],"paper":{"arxiv_id":"2008.04450","last_updated":"2020-08-10T23:06:29Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-08T10:23:56.064374Z","submitted_at":"2020-08-10T23:06:29Z","title":"Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing"},"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 1 inbound Pith citation observation for arXiv:2008.04450."}