{"as_of":"2026-08-19T03:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a4b098d8a5c88fd3a506568086897fb640720c0869b558ad126aa7248817502","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-18T06:34:40.430872+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-03T02:42:11.535899Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.04749","last_updated":"2019-07-10T14:23:39Z","snapshot_observed_at":"2026-08-17T14:17:03.307908Z","submitted_at":"2019-07-10T14:23:39Z","title":"Dense Peelable Random Uniform Hypergraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04749","snapshot_observed_at":"2026-08-03T02:42:11.535899Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.10020","last_updated":"2026-07-17T19:27:48Z","snapshot_observed_at":"2026-08-06T07:02:56.069810Z","submitted_at":"2026-02-10T17:42:02Z","title":"METTLE: Efficient Streaming Erasure Code with Peeling Decodability","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T02:42:11.535899Z"},"links":{"cited_paper":"/paper/1907.04749","citing_paper":"/paper/2602.10020"},"observation_digest":"sha256:5c56f58bb975deeafd8bcab00a7bfb810a1aadec2ed71683e360a8a9fbd7efe0","observation_id":"a0e8ce75-fda7-4ed3-b609-b58f7b441900","resolution":{"observed_at":"2026-08-03T02:42:11.535899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1907.04749/citation-record","integrity":"/paper/1907.04749/integrity","json":"/paper/1907.04749/citation-record.json","paper":"/paper/1907.04749"},"outbound":[],"paper":{"arxiv_id":"1907.04749","last_updated":"2019-07-10T14:23:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T14:17:03.307908Z","submitted_at":"2019-07-10T14:23:39Z","title":"Dense Peelable Random Uniform Hypergraphs"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1907.04749."}