{"as_of":"2026-08-12T13:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a8485aaff0bc168ea360fe46d01fd339fa0e6557cfaa8b95329d3f511456d2f","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:31:51.734230Z","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-25T15:05:57.688180Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.06827","last_updated":"2020-02-28T16:16:10Z","snapshot_observed_at":"2026-07-06T05:19:29.105134Z","submitted_at":"2016-11-21T15:12:33Z","title":"The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$","version":3},"cited_work":{"arxiv_id":"1611.06827","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1611.06827","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Glock, D","venue":null,"work_id":"48d89d2e-23f9-4615-bb8f-4cc31abbcd2a","year":2016},"citing_paper":{"arxiv_id":"1906.11558","last_updated":"2019-06-27T11:34:35Z","snapshot_observed_at":"2026-08-03T11:16:48.276004Z","submitted_at":"2019-06-27T11:34:35Z","title":"Perfectly packing graphs with bounded degeneracy and many leaves","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T15:04:44.773971Z"},"links":{"cited_paper":"/paper/1611.06827","citing_paper":"/paper/1906.11558"},"observation_digest":"sha256:47bce494a706c1aaf1a4545a29cb4f43723ad081fc771836e9eba54e1b97fecd","observation_id":"376a4c3e-5f1b-4682-8fe2-d555e0cb1407","resolution":{"observed_at":"2026-05-25T15:05:57.692912Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06827","last_updated":"2020-02-28T16:16:10Z","snapshot_observed_at":"2026-07-06T05:19:29.105134Z","submitted_at":"2016-11-21T15:12:33Z","title":"The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$","version":3},"cited_work":{"arxiv_id":"1611.06827","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1611.06827","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Glock, D","venue":null,"work_id":"48d89d2e-23f9-4615-bb8f-4cc31abbcd2a","year":2016},"citing_paper":{"arxiv_id":"1907.09950","last_updated":"2019-07-23T15:16:03Z","snapshot_observed_at":"2026-08-02T06:26:57.068485Z","submitted_at":"2019-07-23T15:16:03Z","title":"A rainbow blow-up lemma for almost optimally bounded edge-colourings","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T17:28:29.656919Z"},"links":{"cited_paper":"/paper/1611.06827","citing_paper":"/paper/1907.09950"},"observation_digest":"sha256:4bfaa54ce330d17227e7edf91108b36a052969a6c3eeb5d79ad2b2010e681405","observation_id":"deea8db8-1fa3-4daf-8a75-ee2a9304a9c7","resolution":{"observed_at":"2026-05-24T17:29:44.668443Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06827","last_updated":"2020-02-28T16:16:10Z","snapshot_observed_at":"2026-07-06T05:19:29.105134Z","submitted_at":"2016-11-21T15:12:33Z","title":"The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.06827","snapshot_observed_at":"2026-08-12T11:31:51.734230Z","title":"Glock, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.18291","last_updated":"2024-11-27T12:28:53Z","snapshot_observed_at":"2026-08-12T11:18:01.996802Z","submitted_at":"2024-11-27T12:28:53Z","title":"A short proof of the existence of designs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T11:31:51.734230Z"},"links":{"cited_paper":"/paper/1611.06827","citing_paper":"/paper/2411.18291"},"observation_digest":"sha256:d61171d7f6259378569b3720ee2752fc3a158a037e3a2af051d44ac674c0ad4d","observation_id":"e1594f2f-8c6f-47f5-9f62-d101cb248dcd","resolution":{"observed_at":"2026-08-12T11:31:51.734230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06827","last_updated":"2020-02-28T16:16:10Z","snapshot_observed_at":"2026-07-06T05:19:29.105134Z","submitted_at":"2016-11-21T15:12:33Z","title":"The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.06827","snapshot_observed_at":"2026-08-11T00:42:02.303507Z","title":"The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F.Memoirs of the American Mathematical Society, 284(1406), 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.07607","last_updated":"2026-08-06T20:20:47Z","snapshot_observed_at":"2026-08-12T12:16:24.713283Z","submitted_at":"2026-08-06T20:20:47Z","title":"A congruence obstruction to Roman's bound for Zarankiewicz numbers","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T00:42:02.303507Z"},"links":{"cited_paper":"/paper/1611.06827","citing_paper":"/paper/2608.07607"},"observation_digest":"sha256:6e91ce1b262d4519766a56cac49d23c9374c8f201bb16988c89eab86753c1b98","observation_id":"757f74f8-152e-4367-833e-93704c21ecc4","resolution":{"observed_at":"2026-08-11T00:42:02.303507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1611.06827/citation-record","integrity":"/paper/1611.06827/integrity","json":"/paper/1611.06827/citation-record.json","paper":"/paper/1611.06827"},"outbound":[],"paper":{"arxiv_id":"1611.06827","last_updated":"2020-02-28T16:16:10Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T05:19:29.105134Z","submitted_at":"2016-11-21T15:12:33Z","title":"The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1611.06827."}