{"as_of":"2026-08-09T19:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b52d859e45b0e176f6ebcb7bf17ed13330cad39d80c87f54b9e8f45c11a367c8","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-09T06:31:02.800959+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-07T12:59:58.582707Z","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-05T21:04:50.558887Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.11835","last_updated":"2020-03-26T11:09:39Z","snapshot_observed_at":"2026-07-06T09:07:31.294850Z","submitted_at":"2020-03-26T11:09:39Z","title":"Succinct Dynamic Ordered Sets with Random Access","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.11835","snapshot_observed_at":"2026-08-07T12:59:58.582707Z","title":"Proceedings.129–140","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.23073","last_updated":"2025-06-02T15:51:22Z","snapshot_observed_at":"2026-08-07T12:51:44.426119Z","submitted_at":"2025-05-29T04:25:10Z","title":"DX100: A Programmable Data Access Accelerator for Indirection","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-07T12:59:58.582707Z"},"links":{"cited_paper":"/paper/2003.11835","citing_paper":"/paper/2505.23073"},"observation_digest":"sha256:dbc33d6d1cf784f67eb7da1f9516687865575f1eafcdf25e74dc612a3c0bb038","observation_id":"10ff4040-4ca0-403a-9148-b1625e84c404","resolution":{"observed_at":"2026-08-07T12:59:58.582707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.11835","last_updated":"2020-03-26T11:09:39Z","snapshot_observed_at":"2026-07-06T09:07:31.294850Z","submitted_at":"2020-03-26T11:09:39Z","title":"Succinct Dynamic Ordered Sets with Random Access","version":1},"cited_work":{"arxiv_id":"2003.11835","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.11835","snapshot_observed_at":"2026-08-05T21:04:50.558887Z","title":"Succinct Dynamic Ordered Sets with Random Access","venue":"cs.DS","work_id":"52430f8b-221c-4446-83da-582a2b4655f4","year":2020},"citing_paper":{"arxiv_id":"2508.09570","last_updated":"2025-08-27T12:13:45Z","snapshot_observed_at":"2026-08-05T21:04:46.879986Z","submitted_at":"2025-08-13T07:40:25Z","title":"Re-thinking Memory-Bound Limitations in CGRAs","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-05T21:04:49.603031Z"},"links":{"cited_paper":"/paper/2003.11835","citing_paper":"/paper/2508.09570"},"observation_digest":"sha256:343d30a3bb5532a79afa325637ec34cc6c68b4388f9bd5fb1569d1bf95b903b6","observation_id":"3d353f05-7f0f-453a-a178-27da85ac1cb7","resolution":{"observed_at":"2026-08-05T21:04:50.564502Z","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/2003.11835/citation-record","integrity":"/paper/2003.11835/integrity","json":"/paper/2003.11835/citation-record.json","paper":"/paper/2003.11835"},"outbound":[],"paper":{"arxiv_id":"2003.11835","last_updated":"2020-03-26T11:09:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T09:07:31.294850Z","submitted_at":"2020-03-26T11:09:39Z","title":"Succinct Dynamic Ordered Sets with Random Access"},"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 2 inbound Pith citation observations for arXiv:2003.11835."}