{"as_of":"2026-08-17T04:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:238e634e0d0de015213f502061b58358b0ee73f108e27086b0b17c419a05131b","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-16T06:30:59.297886+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-14T15:25:33.970043Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T09:16:27.658386Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.09142","last_updated":"2018-11-26T10:53:25Z","snapshot_observed_at":"2026-08-14T17:55:09.193002Z","submitted_at":"2018-11-22T12:46:49Z","title":"Construction of optimal locally recoverable codes and connection with hypergraph","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.09142","snapshot_observed_at":"2026-08-14T15:25:33.970043Z","title":"Xing and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.01471","last_updated":"2019-08-05T05:19:46Z","snapshot_observed_at":"2026-08-16T06:07:43.209266Z","submitted_at":"2019-08-05T05:19:46Z","title":"Constructive asymptotic bounds of locally repairable codes via function fields","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:25:33.970043Z"},"links":{"cited_paper":"/paper/1811.09142","citing_paper":"/paper/1908.01471"},"observation_digest":"sha256:a96fce38719cf9c055de87f74ab56c2091430740df107ac9bf2668158fd53653","observation_id":"22116319-b02f-449a-86e6-6ae140365840","resolution":{"observed_at":"2026-08-14T15:25:33.970043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.09142","last_updated":"2018-11-26T10:53:25Z","snapshot_observed_at":"2026-08-14T17:55:09.193002Z","submitted_at":"2018-11-22T12:46:49Z","title":"Construction of optimal locally recoverable codes and connection with hypergraph","version":2},"cited_work":{"arxiv_id":"1811.09142","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.09142","snapshot_observed_at":"2026-07-04T23:13:13.162876Z","title":"Construction of optimal lo- cally recoverable codes and connection with hypergraph.arXiv preprint arXiv:1811.09142","venue":null,"work_id":"803dd8b7-21b6-46f7-8f58-2a0e0a7e832b","year":null},"citing_paper":{"arxiv_id":"2604.26756","last_updated":"2026-04-29T14:52:39Z","snapshot_observed_at":"2026-07-06T23:12:19.460065Z","submitted_at":"2026-04-29T14:52:39Z","title":"Locality for Codes over the Integers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T11:38:39.075785Z"},"links":{"cited_paper":"/paper/1811.09142","citing_paper":"/paper/2604.26756"},"observation_digest":"sha256:8d90d7448cf6c14605369358c676a5433fb84c5859edbdbeb5c8f8baed131def","observation_id":"7de3942f-f2ac-41df-8449-1f690e80a9f0","resolution":{"observed_at":"2026-07-04T23:13:13.162876Z","resolver_source":"arxiv_id","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/1811.09142/citation-record","integrity":"/paper/1811.09142/integrity","json":"/paper/1811.09142/citation-record.json","paper":"/paper/1811.09142"},"outbound":[],"paper":{"arxiv_id":"1811.09142","last_updated":"2018-11-26T10:53:25Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T17:55:09.193002Z","submitted_at":"2018-11-22T12:46:49Z","title":"Construction of optimal locally recoverable codes and connection with hypergraph"},"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 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1811.09142."}