{"as_of":"2026-08-16T13:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:32bf1f2bff38cb828a7e5e3f0da440d204c679b41c3f42b9069061719bda6043","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-16T06:30:59.297886+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-14T10:22:08.716358Z","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-14T10:22:08.816655Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1712.03898","last_updated":"2019-02-11T16:36:10Z","snapshot_observed_at":"2026-08-14T20:04:50.465248Z","submitted_at":"2017-12-11T17:19:24Z","title":"Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes","version":4},"cited_work":{"arxiv_id":"1712.03898","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.03898","snapshot_observed_at":"2026-08-14T10:22:08.816655Z","title":"Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes","venue":"cs.IT","work_id":"885dea8e-f540-4408-935c-669f13de877e","year":2017},"citing_paper":{"arxiv_id":"1908.11366","last_updated":"2019-08-29T17:52:01Z","snapshot_observed_at":"2026-08-15T19:25:24.402565Z","submitted_at":"2019-08-29T17:52:01Z","title":"Improved Storage for Efficient Private Information Retrieval","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T10:22:08.716358Z"},"links":{"cited_paper":"/paper/1712.03898","citing_paper":"/paper/1908.11366"},"observation_digest":"sha256:f9f865d8f9b7c99e81b438fc0d433a9c300dc1e37718022b249aba4a074bdbd8","observation_id":"b611446f-f9ae-4415-bd34-75dc9364cd56","resolution":{"observed_at":"2026-08-14T10:22:08.819825Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1712.03898/citation-record","integrity":"/paper/1712.03898/integrity","json":"/paper/1712.03898/citation-record.json","paper":"/paper/1712.03898"},"outbound":[],"paper":{"arxiv_id":"1712.03898","last_updated":"2019-02-11T16:36:10Z","latest_version":4,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T20:04:50.465248Z","submitted_at":"2017-12-11T17:19:24Z","title":"Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1712.03898."}