{"as_of":"2026-08-13T20:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ccd31c097afc2d6ae745def0449cae6bd87245e3234841aad302f1c14b3fadb9","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-13T06:32:02.005865+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-06T21:22:29.188988Z","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-06T21:22:29.233680Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.07188","last_updated":"2024-02-26T18:40:15Z","snapshot_observed_at":"2026-08-13T16:16:45.285601Z","submitted_at":"2024-02-11T12:51:38Z","title":"Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching","version":2},"cited_work":{"arxiv_id":"2402.07188","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.07188","snapshot_observed_at":"2026-08-06T21:22:29.233680Z","title":"Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching","venue":"cs.IT","work_id":"b530fed6-8ac2-4d8c-89f8-6f493d2e83b5","year":2024},"citing_paper":{"arxiv_id":"2507.00727","last_updated":"2025-07-01T13:17:46Z","snapshot_observed_at":"2026-08-06T21:06:11.863734Z","submitted_at":"2025-07-01T13:17:46Z","title":"On Hierarchical Coded Caching with Offline Users","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:22:29.188988Z"},"links":{"cited_paper":"/paper/2402.07188","citing_paper":"/paper/2507.00727"},"observation_digest":"sha256:bfbf6ec638c9715d4822d5959137db7f175d146930c33ba17d6ed727408e8e95","observation_id":"f83165cd-7b69-49ad-899e-3d925586e23a","resolution":{"observed_at":"2026-08-06T21:22:29.239686Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07188","last_updated":"2024-02-26T18:40:15Z","snapshot_observed_at":"2026-08-13T16:16:45.285601Z","submitted_at":"2024-02-11T12:51:38Z","title":"Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07188","snapshot_observed_at":"2026-08-03T00:06:24.532741Z","title":"Optimal placement delivery arrays fromt-designs with application to hierarchical coded caching,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12220","last_updated":"2026-06-09T19:34:41Z","snapshot_observed_at":"2026-08-06T17:37:57.938191Z","submitted_at":"2026-02-12T17:58:37Z","title":"Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.532741Z"},"links":{"cited_paper":"/paper/2402.07188","citing_paper":"/paper/2602.12220"},"observation_digest":"sha256:bb1043107fb21fa43d732c76832c01c6a7e5fd6abbb42b0f566089e2b7dfce03","observation_id":"fdc6fa85-0b14-4b94-bd77-599d4fcc0974","resolution":{"observed_at":"2026-08-03T00:06:24.532741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.07188/citation-record","integrity":"/paper/2402.07188/integrity","json":"/paper/2402.07188/citation-record.json","paper":"/paper/2402.07188"},"outbound":[],"paper":{"arxiv_id":"2402.07188","last_updated":"2024-02-26T18:40:15Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T16:16:45.285601Z","submitted_at":"2024-02-11T12:51:38Z","title":"Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.07188."}