{"as_of":"2026-08-11T18:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9ea365d9800598c1a3b88989b78844e80f829f5e14c4ab851420d06350a0f28","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:15:10.437982Z","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-23T17:23:15.275645Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.01942","last_updated":"2021-04-16T10:57:32Z","snapshot_observed_at":"2026-08-11T18:09:42.899209Z","submitted_at":"2021-03-02T18:58:04Z","title":"Size-Ramsey numbers of powers of hypergraph trees and long subdivisions","version":2},"cited_work":{"arxiv_id":"2103.01942","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01942","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Letzter, A","venue":null,"work_id":"b24c87e3-3a11-4cc9-9763-5961322347b2","year":2021},"citing_paper":{"arxiv_id":"2411.10179","last_updated":"2026-05-07T18:09:31Z","snapshot_observed_at":"2026-08-03T01:09:18.317294Z","submitted_at":"2024-11-15T13:28:30Z","title":"Explicit constructions of optimal blocking sets and minimal codes","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-23T17:20:27.568768Z"},"links":{"cited_paper":"/paper/2103.01942","citing_paper":"/paper/2411.10179"},"observation_digest":"sha256:9dc381ed64f1842d1cdde179998b8035bf22ce04ec8ab9e56e25173c8c808511","observation_id":"15d5d760-aaa7-418c-ad77-af9c0a95c9aa","resolution":{"observed_at":"2026-05-23T17:23:15.278615Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.01942","last_updated":"2021-04-16T10:57:32Z","snapshot_observed_at":"2026-08-11T18:09:42.899209Z","submitted_at":"2021-03-02T18:58:04Z","title":"Size-Ramsey numbers of powers of hypergraph trees and long subdivisions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.01942","snapshot_observed_at":"2026-08-06T21:15:10.437982Z","title":"Letzter, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.01498","last_updated":"2025-07-02T09:03:04Z","snapshot_observed_at":"2026-08-11T16:23:59.370933Z","submitted_at":"2025-07-02T09:03:04Z","title":"Size-Ramsey numbers of tight paths","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:15:10.437982Z"},"links":{"cited_paper":"/paper/2103.01942","citing_paper":"/paper/2507.01498"},"observation_digest":"sha256:a15f130132c4e07ac10a37aa7365076e05e1b13823d777d0564f7ed7eb198fcf","observation_id":"24a97e1a-ea4e-4c8c-9a7b-6713558bd8bf","resolution":{"observed_at":"2026-08-06T21:15:10.437982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.01942","last_updated":"2021-04-16T10:57:32Z","snapshot_observed_at":"2026-08-11T18:09:42.899209Z","submitted_at":"2021-03-02T18:58:04Z","title":"Size-Ramsey numbers of powers of hypergraph trees and long subdivisions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.01942","snapshot_observed_at":"2026-08-06T00:11:37.099519Z","title":"Lee and B","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.01525","last_updated":"2026-08-02T22:26:44Z","snapshot_observed_at":"2026-08-11T15:32:14.657087Z","submitted_at":"2026-08-02T22:26:44Z","title":"Combinatorial theorems relative to sparse sets","version":1},"reference_index":320,"source":"pdf_text","source_observed_at":"2026-08-06T00:11:37.099519Z"},"links":{"cited_paper":"/paper/2103.01942","citing_paper":"/paper/2608.01525"},"observation_digest":"sha256:20c083e62570868ae2759350dde56d61cf23d6f9db20a4140dc4b1ef1c69865e","observation_id":"5ff45861-d79d-4e38-812a-96e6e3d32f3f","resolution":{"observed_at":"2026-08-06T00:11:37.099519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2103.01942/citation-record","integrity":"/paper/2103.01942/integrity","json":"/paper/2103.01942/citation-record.json","paper":"/paper/2103.01942"},"outbound":[],"paper":{"arxiv_id":"2103.01942","last_updated":"2021-04-16T10:57:32Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-11T18:09:42.899209Z","submitted_at":"2021-03-02T18:58:04Z","title":"Size-Ramsey numbers of powers of hypergraph trees and long subdivisions"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2103.01942."}