{"as_of":"2026-08-04T12:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f9647e7082ef009075937ee17c03a14f635f18fe54653f801ca36c362da5861","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T07:37:48.958864Z","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-07-04T16:59:57.753045Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.22019","last_updated":"2024-10-29T13:09:06Z","snapshot_observed_at":"2026-07-06T19:41:32.754401Z","submitted_at":"2024-10-29T13:09:06Z","title":"New bounds of two hypergraph Ramsey problems","version":1},"cited_work":{"arxiv_id":"2410.22019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22019","snapshot_observed_at":"2026-07-04T16:59:57.753045Z","title":null,"venue":null,"work_id":"ea2a3b72-a21f-4881-a095-f11cf5b4c4c4","year":2024},"citing_paper":{"arxiv_id":"2604.02835","last_updated":"2026-04-07T07:38:38Z","snapshot_observed_at":"2026-07-06T22:52:06.460027Z","submitted_at":"2026-04-03T07:56:27Z","title":"A Note on Generalized Erd\\H{o}s-Rogers Problems","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-13T19:06:46.040620Z"},"links":{"cited_paper":"/paper/2410.22019","citing_paper":"/paper/2604.02835"},"observation_digest":"sha256:34f06f6816433747d9bcd8a804e0750cb5f92e85ed3e114dc2ecec9e32bf8c5e","observation_id":"9510f3e3-1ca3-444e-8b78-d76aee46d3b2","resolution":{"observed_at":"2026-05-13T19:08:09.647073Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22019","last_updated":"2024-10-29T13:09:06Z","snapshot_observed_at":"2026-07-06T19:41:32.754401Z","submitted_at":"2024-10-29T13:09:06Z","title":"New bounds of two hypergraph Ramsey problems","version":1},"cited_work":{"arxiv_id":"2410.22019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22019","snapshot_observed_at":"2026-07-04T16:59:57.753045Z","title":null,"venue":null,"work_id":"ea2a3b72-a21f-4881-a095-f11cf5b4c4c4","year":2024},"citing_paper":{"arxiv_id":"2604.23986","last_updated":"2026-04-27T03:02:20Z","snapshot_observed_at":"2026-08-03T12:09:43.114774Z","submitted_at":"2026-04-27T03:02:20Z","title":"A double-exponential lower bound for $r_4(5,n)$","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T02:48:42.816568Z"},"links":{"cited_paper":"/paper/2410.22019","citing_paper":"/paper/2604.23986"},"observation_digest":"sha256:3635edd364e9c559e99bfd0904d9f3ea391c8c4b196f157e4a8fec688a43264a","observation_id":"cb7f8520-647e-4d31-80e3-6cb679681006","resolution":{"observed_at":"2026-05-11T22:26:13.606659Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22019","last_updated":"2024-10-29T13:09:06Z","snapshot_observed_at":"2026-07-06T19:41:32.754401Z","submitted_at":"2024-10-29T13:09:06Z","title":"New bounds of two hypergraph Ramsey problems","version":1},"cited_work":{"arxiv_id":"2410.22019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22019","snapshot_observed_at":"2026-07-04T16:59:57.753045Z","title":null,"venue":null,"work_id":"ea2a3b72-a21f-4881-a095-f11cf5b4c4c4","year":2024},"citing_paper":{"arxiv_id":"2605.04105","last_updated":"2026-05-11T08:25:58Z","snapshot_observed_at":"2026-07-06T23:16:54.673178Z","submitted_at":"2026-05-04T09:29:11Z","title":"An improved double-exponential lower bound for $r_4(5,n)$","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T18:15:49.948962Z"},"links":{"cited_paper":"/paper/2410.22019","citing_paper":"/paper/2605.04105"},"observation_digest":"sha256:52df9675e41eb3e1805de0db6dae9fd9ec6d7cff3d6b6e8656ebf16d5120e930","observation_id":"c8274d84-6dc2-4760-aab8-bc1b345e5ccb","resolution":{"observed_at":"2026-05-09T06:40:39.859048Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22019","last_updated":"2024-10-29T13:09:06Z","snapshot_observed_at":"2026-07-06T19:41:32.754401Z","submitted_at":"2024-10-29T13:09:06Z","title":"New bounds of two hypergraph Ramsey problems","version":1},"cited_work":{"arxiv_id":"2410.22019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22019","snapshot_observed_at":"2026-07-04T16:59:57.753045Z","title":null,"venue":null,"work_id":"ea2a3b72-a21f-4881-a095-f11cf5b4c4c4","year":2024},"citing_paper":{"arxiv_id":"2605.04105","last_updated":"2026-05-11T08:25:58Z","snapshot_observed_at":"2026-07-06T23:16:54.673178Z","submitted_at":"2026-05-04T09:29:11Z","title":"An improved double-exponential lower bound for $r_4(5,n)$","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T03:12:59.572178Z"},"links":{"cited_paper":"/paper/2410.22019","citing_paper":"/paper/2605.04105"},"observation_digest":"sha256:12403f4fce15f0264f75fa82fd9c6edd681440bd57138a82d38f05bd7cc686a9","observation_id":"dddfb597-285e-4a9b-a09a-db2de3542ed0","resolution":{"observed_at":"2026-05-12T03:16:19.229249Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22019","last_updated":"2024-10-29T13:09:06Z","snapshot_observed_at":"2026-07-06T19:41:32.754401Z","submitted_at":"2024-10-29T13:09:06Z","title":"New bounds of two hypergraph Ramsey problems","version":1},"cited_work":{"arxiv_id":"2410.22019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22019","snapshot_observed_at":"2026-07-04T16:59:57.753045Z","title":null,"venue":null,"work_id":"ea2a3b72-a21f-4881-a095-f11cf5b4c4c4","year":2024},"citing_paper":{"arxiv_id":"2606.24198","last_updated":"2026-06-23T06:36:28Z","snapshot_observed_at":"2026-07-06T23:58:49.574536Z","submitted_at":"2026-06-23T06:36:28Z","title":"New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T00:06:35.345332Z"},"links":{"cited_paper":"/paper/2410.22019","citing_paper":"/paper/2606.24198"},"observation_digest":"sha256:e33009d4562e966fc2b8bc0b001d291efe04c5b5f3e0e07475fa6f3f4c369b6e","observation_id":"6005a90e-f3ec-4b8b-93fb-c127b4e3f4c2","resolution":{"observed_at":"2026-07-04T16:59:57.755732Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22019","last_updated":"2024-10-29T13:09:06Z","snapshot_observed_at":"2026-07-06T19:41:32.754401Z","submitted_at":"2024-10-29T13:09:06Z","title":"New bounds of two hypergraph Ramsey problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22019","snapshot_observed_at":"2026-07-14T14:13:26.591026Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10111","last_updated":"2026-07-26T01:49:54Z","snapshot_observed_at":"2026-08-02T07:37:46.089775Z","submitted_at":"2026-07-11T04:13:38Z","title":"Hypergraph Erd\\H{o}s--Rogers functions with consecutive clique sizes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T14:13:26.591026Z"},"links":{"cited_paper":"/paper/2410.22019","citing_paper":"/paper/2607.10111"},"observation_digest":"sha256:c23bb77442a4af51eab8c50163117df8fe4475ac38c33dca91703ee9a44c225c","observation_id":"2ae7f87d-4cb3-4ff3-a5d6-3d4dd698f5cd","resolution":{"observed_at":"2026-07-14T14:13:26.591026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22019","last_updated":"2024-10-29T13:09:06Z","snapshot_observed_at":"2026-07-06T19:41:32.754401Z","submitted_at":"2024-10-29T13:09:06Z","title":"New bounds of two hypergraph Ramsey problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22019","snapshot_observed_at":"2026-08-02T07:37:48.958864Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10111","last_updated":"2026-07-26T01:49:54Z","snapshot_observed_at":"2026-08-02T07:37:46.089775Z","submitted_at":"2026-07-11T04:13:38Z","title":"Hypergraph Erd\\H{o}s--Rogers functions with consecutive clique sizes","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T07:37:48.958864Z"},"links":{"cited_paper":"/paper/2410.22019","citing_paper":"/paper/2607.10111"},"observation_digest":"sha256:a05aac9a086e5a34f0957fd399ff78da7e83c9f531e77861a287e71606200c40","observation_id":"bf3063e4-5b3d-44cc-8b0b-f8104785f352","resolution":{"observed_at":"2026-08-02T07:37:48.958864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.22019/citation-record","integrity":"/paper/2410.22019/integrity","json":"/paper/2410.22019/citation-record.json","paper":"/paper/2410.22019"},"outbound":[],"paper":{"arxiv_id":"2410.22019","last_updated":"2024-10-29T13:09:06Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T19:41:32.754401Z","submitted_at":"2024-10-29T13:09:06Z","title":"New bounds of two hypergraph Ramsey problems"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2410.22019."}