{"as_of":"2026-08-17T08:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3f461d6132f090bb9ece6c78edc32f180028c9eec15551dabd8a57467122e5d0","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":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":21,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:43:24.710981Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-12T20:51:25.552015Z","title":"The primes contain arbitrarily long arithmetic progressions","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.09321","last_updated":"2024-12-20T15:29:22Z","snapshot_observed_at":"2026-08-16T09:26:06.094825Z","submitted_at":"2024-11-14T10:03:26Z","title":"Upper bounds on diagonal Ramsey numbers [after Campos, Griffiths, Morris, and Sahasrabudhe]","version":2},"reference_index":123,"source":"pdf_text","source_observed_at":"2026-08-12T20:51:25.552015Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2411.09321"},"observation_digest":"sha256:5cf4c1436dcb56a8581af52d827535badcf17a8db5449aaf1b17c5f9aa678082","observation_id":"c6ec4f8f-dfe1-44f1-8329-fbb38d3381fd","resolution":{"observed_at":"2026-08-12T20:51:25.552015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-16T04:43:24.710981Z","title":"Gupta, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01034","last_updated":"2025-05-20T02:09:54Z","snapshot_observed_at":"2026-08-16T04:26:11.510677Z","submitted_at":"2025-05-02T06:14:42Z","title":"Ramsey with purple edges","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T04:43:24.710981Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2505.01034"},"observation_digest":"sha256:3c0dee05ac4098a9c02b329b746f11069d96a72d63dd96ef51824e89e581089c","observation_id":"3f69d8c9-faf2-4e95-bec8-34b494d44dc0","resolution":{"observed_at":"2026-08-16T04:43:24.710981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-15T20:30:31.003954Z","title":"Gupta, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13371","last_updated":"2025-05-19T17:18:29Z","snapshot_observed_at":"2026-08-15T20:12:53.286953Z","submitted_at":"2025-05-19T17:18:29Z","title":"A new lower bound for the Ramsey numbers $R(3,k)$","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:30:31.003954Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2505.13371"},"observation_digest":"sha256:8d77181da0efe5353cee702a1dca88f32cab901d47b5e60b78436692f2b0c6ff","observation_id":"b7c49cd5-00e1-4a09-8dd3-976ee029106e","resolution":{"observed_at":"2026-08-15T20:30:31.003954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2507.12926","last_updated":"2026-04-26T13:17:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-17T09:08:08Z","title":"An exponential improvement for Ramsey lower bounds","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T04:57:55.362164Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2507.12926"},"observation_digest":"sha256:d2c45014f1475ba42bdbbfc4f12bfab2e4cbcbb2c4972bdf79b21ad779aa8b30","observation_id":"4f464bb3-4f07-427f-b986-c44d2fbe6c6a","resolution":{"observed_at":"2026-05-19T05:02:05.151168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-04T21:34:16.170762Z","title":"Gupta, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07934","last_updated":"2025-09-09T17:17:10Z","snapshot_observed_at":"2026-08-09T06:15:06.533041Z","submitted_at":"2025-09-09T17:17:10Z","title":"Ramsey numbers of trees","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T21:34:16.170762Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2509.07934"},"observation_digest":"sha256:a7e5d1086855af6c7c95f5828dd2cd650ff051c22209067e64a005ab956f3712","observation_id":"fe34e543-4f7e-46b8-b53b-e38b6706a07a","resolution":{"observed_at":"2026-08-04T21:34:16.170762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2512.17718","last_updated":"2026-05-18T11:42:37Z","snapshot_observed_at":"2026-08-15T05:39:03.178519Z","submitted_at":"2025-12-19T15:52:01Z","title":"Gaussian random graphs and Ramsey numbers","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T16:52:16.030979Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2512.17718"},"observation_digest":"sha256:daf98c55be29c16dc611434397a548d04fc7c579deea9a78db0d2812fb2d3dc8","observation_id":"302fd14c-f2b4-4ba0-8ecb-e8026f18d580","resolution":{"observed_at":"2026-05-21T16:54:16.331497Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2512.17790","last_updated":"2026-05-07T18:48:09Z","snapshot_observed_at":"2026-08-15T02:12:05.712890Z","submitted_at":"2025-12-19T16:59:25Z","title":"A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-16T20:42:37.554950Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2512.17790"},"observation_digest":"sha256:fb179d45a00a1c7b8597c644317eaced75435f9eee739eb6cb81d32e32bb53aa","observation_id":"81e2668e-78e9-49fe-a0ad-ace15ade08f6","resolution":{"observed_at":"2026-05-16T20:43:24.782959Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","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":26,"source":"pdf_text","source_observed_at":"2026-05-13T19:06:46.040620Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2604.02835"},"observation_digest":"sha256:ceab5bd1376a906714d4dc97ce7d2fdfac061ba70d28098f2a09039dcfa0d817","observation_id":"12e5425c-2753-474f-9c0f-0c7195ee36e7","resolution":{"observed_at":"2026-05-13T19:08:09.650615Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2604.23986","last_updated":"2026-04-27T03:02:20Z","snapshot_observed_at":"2026-08-15T02:12:08.908086Z","submitted_at":"2026-04-27T03:02:20Z","title":"A double-exponential lower bound for $r_4(5,n)$","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T02:48:42.816568Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2604.23986"},"observation_digest":"sha256:67907773c1404abc6e1ec206f14b3838831ed18fa416a8a47c4ec7dbc461360a","observation_id":"fe2d1a1d-4711-4b71-9a5b-133e65ebb83d","resolution":{"observed_at":"2026-05-11T22:26:13.586927Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","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":21,"source":"pdf_text","source_observed_at":"2026-05-08T18:15:49.948962Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2605.04105"},"observation_digest":"sha256:ac488ed873ae436b5dead03bcfdf0d44d33012f7865d16dff0bb1cb3ca8e455d","observation_id":"95d600a8-9e9f-4c51-a7c6-3c19b5153b9c","resolution":{"observed_at":"2026-05-09T06:40:39.846026Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","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":21,"source":"pdf_text","source_observed_at":"2026-05-12T03:12:59.572178Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2605.04105"},"observation_digest":"sha256:a0c0454fa33fb99969ccccafc677be47932416074c3ee39852e4cf0470726abe","observation_id":"4a95b97a-da28-4ad3-86e6-ffa353f23299","resolution":{"observed_at":"2026-05-12T03:16:19.221101Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2605.07322","last_updated":"2026-05-08T06:28:44Z","snapshot_observed_at":"2026-07-31T15:03:18.647540Z","submitted_at":"2026-05-08T06:28:44Z","title":"New results on the odd- and unique-Ramsey numbers","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-11T01:10:28.629383Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2605.07322"},"observation_digest":"sha256:540b3d261671a8be9ac944eecbacad2ae523485e8cb566bdb729a8a2a3e920bb","observation_id":"c090ed9d-c38e-4c09-a89a-8f3edd0f0c18","resolution":{"observed_at":"2026-05-11T04:40:58.455598Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2605.22395","last_updated":"2026-07-02T18:40:07Z","snapshot_observed_at":"2026-08-17T07:55:35.311923Z","submitted_at":"2026-05-21T12:29:05Z","title":"Ramsey numbers of multiple copies of a graph and the random Ramsey theorem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T04:35:57.695167Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2605.22395"},"observation_digest":"sha256:2bb51df11e962c742e2f73b280e4108c21a30fc8b35482a8377a8ed328611475","observation_id":"9a54b823-5bce-4886-8cc7-659267c847ec","resolution":{"observed_at":"2026-05-22T04:36:03.398196Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2605.23301","last_updated":"2026-05-22T07:18:58Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:18:58Z","title":"Finding blowups one vertex at a time","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T04:18:13.076528Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2605.23301"},"observation_digest":"sha256:1ef69131cf15db9138eb3099c9cf3b0fb314942abb163d5cceff59454288e9d2","observation_id":"10d9352d-2208-4229-afc5-95bac6e32dac","resolution":{"observed_at":"2026-05-25T04:20:19.483990Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2605.25843","last_updated":"2026-07-02T07:25:11Z","snapshot_observed_at":"2026-08-14T17:37:56.923405Z","submitted_at":"2026-05-25T13:37:26Z","title":"Sharper Ramsey lower bounds from refined Gaussian estimates","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T21:35:48.106599Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2605.25843"},"observation_digest":"sha256:8591331130a34f3aabaa6eb6d3c8e06d24045dadae3aa802b2004cfd0c15abdb","observation_id":"852c7f00-d85d-423d-a6ae-844cf658eb61","resolution":{"observed_at":"2026-06-29T21:43:59.706201Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2605.25843","last_updated":"2026-07-02T07:25:11Z","snapshot_observed_at":"2026-08-14T17:37:56.923405Z","submitted_at":"2026-05-25T13:37:26Z","title":"Sharper Ramsey lower bounds from refined Gaussian estimates","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-04T00:26:16.564387Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2605.25843"},"observation_digest":"sha256:3980c134a74c9e39ad0839d4d65f22423ad74aaca79628fad0067ace446b9101","observation_id":"b3cc94da-0c6d-4f78-b09f-b476289c7fb0","resolution":{"observed_at":"2026-07-04T00:29:14.908729Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2605.28793","last_updated":"2026-06-16T16:04:49Z","snapshot_observed_at":"2026-08-15T02:12:09.542535Z","submitted_at":"2026-05-27T17:50:42Z","title":"Off-diagonal Ramsey numbers","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T11:21:40.824157Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2605.28793"},"observation_digest":"sha256:5fe44f0d08af8d683d495fffc9ede1d10067bdb23e93268dfdfc7242453d1836","observation_id":"29d146fa-4246-4aaf-bae5-cdc051fb7ba9","resolution":{"observed_at":"2026-06-29T11:23:20.611459Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2606.02389","last_updated":"2026-06-01T15:37:05Z","snapshot_observed_at":"2026-08-15T00:56:10.232787Z","submitted_at":"2026-06-01T15:37:05Z","title":"A degree version of the Burr-Erd\\H{o}s conjecture on trees","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T13:52:37.452784Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2606.02389"},"observation_digest":"sha256:9817e4b9e840cf09d25dbf07885f0bd37b65df6afacf51bf30bc3a85ca6f2a67","observation_id":"74e7b185-0fd3-45bb-bbf0-5ae1eee99482","resolution":{"observed_at":"2026-06-28T14:32:18.454843Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":"2407.19026","doi":"10.48550/arxiv.2407.19026","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gupta, N","venue":"arXiv (Cornell University)","work_id":"e14b3d35-6f0c-4f35-92e9-a62bbb57b76c","year":2024},"citing_paper":{"arxiv_id":"2606.24198","last_updated":"2026-06-23T06:36:28Z","snapshot_observed_at":"2026-08-10T15:17:09.561228Z","submitted_at":"2026-06-23T06:36:28Z","title":"New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T00:06:35.345332Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2606.24198"},"observation_digest":"sha256:4b3b95813d476dd62e061105ba3df9c23a6e88883059a03c2da3a0b8572fce3b","observation_id":"1422d1c0-2851-4170-89fb-749bdc6987ca","resolution":{"observed_at":"2026-07-04T16:59:57.784790Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-07-12T03:51:48.252950Z","title":"Gupta, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03243","last_updated":"2026-07-03T11:56:55Z","snapshot_observed_at":"2026-08-08T13:28:03.239177Z","submitted_at":"2026-07-03T11:56:55Z","title":"On Ramsey-type problems for paths and cycles with few colour changes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T03:51:48.252950Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2607.03243"},"observation_digest":"sha256:70fca14909b03904be55529d30771bd357b82f8bc40b4b3d2294cf00c6995134","observation_id":"bbde28d4-d773-4665-b75d-e0d0c0a4f84c","resolution":{"observed_at":"2026-07-12T03:51:48.252950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.19026","snapshot_observed_at":"2026-08-15T15:18:02.118506Z","title":"Gupta, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01962","last_updated":"2026-08-03T09:30:23Z","snapshot_observed_at":"2026-08-15T15:00:48.577044Z","submitted_at":"2026-08-03T09:30:23Z","title":"New upper bound for multicolor Ramsey numbers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:18:02.118506Z"},"links":{"cited_paper":"/paper/2407.19026","citing_paper":"/paper/2608.01962"},"observation_digest":"sha256:41325c4cce68147553852ab4a5958d76569a801b8568f10b0482a66e9448c083","observation_id":"f6377cb3-6a0d-4baa-bbdd-6502b59830f7","resolution":{"observed_at":"2026-08-15T15:18:02.118506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.19026/citation-record","integrity":"/paper/2407.19026/integrity","json":"/paper/2407.19026/citation-record.json","paper":"/paper/2407.19026"},"outbound":[],"paper":{"arxiv_id":"2407.19026","last_updated":"2024-07-26T18:08:35Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T13:30:40.901662Z","submitted_at":"2024-07-26T18:08:35Z","title":"Optimizing the CGMS upper bound on Ramsey numbers"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 21 inbound Pith citation observations for arXiv:2407.19026."}