{"as_of":"2026-08-11T14:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed8a5a8f8d0d2f7d071ec3094721a398c9ca0eaee43c4d6199ba82236dcbf8bd","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-11T06:34:44.6726+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-11T00:45:45.196150Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":4,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1505.03210","last_updated":"2015-05-13T01:36:19Z","snapshot_observed_at":"2026-07-06T04:17:41.920060Z","submitted_at":"2015-05-13T01:36:19Z","title":"Tur\\'an numbers of hypergraph trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.03210","snapshot_observed_at":"2026-08-11T00:45:45.196150Z","title":"F¨ uredi and T","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.19461","last_updated":"2024-12-27T05:15:59Z","snapshot_observed_at":"2026-08-11T13:56:07.557881Z","submitted_at":"2024-12-27T05:15:59Z","title":"On tight tree-complete hypergraph Ramsey numbers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T00:45:45.196150Z"},"links":{"cited_paper":"/paper/1505.03210","citing_paper":"/paper/2412.19461"},"observation_digest":"sha256:5bbecd0b684d087b6d5cf40674653893d4a2a6b786d41c5297fce1092a160d38","observation_id":"d0cc13d9-ea58-4c94-a875-8221ad9d3b4a","resolution":{"observed_at":"2026-08-11T00:45:45.196150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1505.03210","last_updated":"2015-05-13T01:36:19Z","snapshot_observed_at":"2026-07-06T04:17:41.920060Z","submitted_at":"2015-05-13T01:36:19Z","title":"Tur\\'an numbers of hypergraph trees","version":1},"cited_work":{"arxiv_id":"1505.03210","doi":"10.48550/arxiv.1505.03210","metadata_source":"pith","pith_arxiv_id":"1505.03210","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Tur\\'an numbers of hypergraph trees","venue":"math.CO","work_id":"3b16e881-eb90-412b-bd8d-13c8c2f17616","year":2015},"citing_paper":{"arxiv_id":"2508.20132","last_updated":"2025-08-26T15:49:20Z","snapshot_observed_at":"2026-08-08T17:38:16.260918Z","submitted_at":"2025-08-26T15:49:20Z","title":"Delta-system method: a survey","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T16:05:09.663509Z"},"links":{"cited_paper":"/paper/1505.03210","citing_paper":"/paper/2508.20132"},"observation_digest":"sha256:413bb743aaf76c6e8a52ba4d9ebc7b297f9e81c4fcfad8402b9fbd57d906769e","observation_id":"0289c5fd-5a67-4396-a280-fff59179cdaa","resolution":{"observed_at":"2026-08-05T16:05:09.943335Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/1505.03210/citation-record","integrity":"/paper/1505.03210/integrity","json":"/paper/1505.03210/citation-record.json","paper":"/paper/1505.03210"},"outbound":[],"paper":{"arxiv_id":"1505.03210","last_updated":"2015-05-13T01:36:19Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T04:17:41.920060Z","submitted_at":"2015-05-13T01:36:19Z","title":"Tur\\'an numbers of hypergraph trees"},"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 2 inbound Pith citation observations for arXiv:1505.03210."}