{"as_of":"2026-08-13T08:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bbab9a8d12783a0fb168c94c72f8fe1890b26d2cfafbf0ab758b6b3165d576fd","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-13T06:32:02.005865+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-12T16:39:56.842695Z","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-03T02:37:34.565916Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.06670","last_updated":"2024-04-03T15:21:12Z","snapshot_observed_at":"2026-08-13T04:43:50.449082Z","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06670","snapshot_observed_at":"2026-08-12T16:39:56.842695Z","title":"Milojević, B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13510","last_updated":"2024-11-20T18:04:54Z","snapshot_observed_at":"2026-08-12T16:17:28.231302Z","submitted_at":"2024-11-20T18:04:54Z","title":"Disjoint pairs in set systems and combinatorics of low rank matrices","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T16:39:56.842695Z"},"links":{"cited_paper":"/paper/2401.06670","citing_paper":"/paper/2411.13510"},"observation_digest":"sha256:819cce4c5121b7228c2106ed151f7de3f18a7d8740565658661b1fe42b4e5efa","observation_id":"664c4c3c-98da-45ea-a8f3-53753e6f339e","resolution":{"observed_at":"2026-08-12T16:39:56.842695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06670","last_updated":"2024-04-03T15:21:12Z","snapshot_observed_at":"2026-08-13T04:43:50.449082Z","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06670","snapshot_observed_at":"2026-08-11T19:47:19.190675Z","title":"Milojevi´ c, B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06490","last_updated":"2025-09-11T09:40:18Z","snapshot_observed_at":"2026-08-11T19:33:24.099825Z","submitted_at":"2024-12-09T13:46:43Z","title":"On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T19:47:19.190675Z"},"links":{"cited_paper":"/paper/2401.06670","citing_paper":"/paper/2412.06490"},"observation_digest":"sha256:5cb2c79ce9d1711136baba19e42b92527aad8aca5b7c8c2c62d9169d85d7bc80","observation_id":"0a85008a-6fbd-48e9-a2e7-2d84a75635d4","resolution":{"observed_at":"2026-08-11T19:47:19.190675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06670","last_updated":"2024-04-03T15:21:12Z","snapshot_observed_at":"2026-08-13T04:43:50.449082Z","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06670","snapshot_observed_at":"2026-08-06T21:49:45.651161Z","title":"Milojević, B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23942","last_updated":"2025-06-30T15:09:00Z","snapshot_observed_at":"2026-08-06T21:25:28.080518Z","submitted_at":"2025-06-30T15:09:00Z","title":"$C_4$-free subgraphs of high degree with geometric applications","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T21:49:45.651161Z"},"links":{"cited_paper":"/paper/2401.06670","citing_paper":"/paper/2506.23942"},"observation_digest":"sha256:ba9ec8bd1116db5f5c6bcebc8ac72860dc78ea7ca3801bef814968df2b3e07d9","observation_id":"a3c4be52-245a-45ba-986b-3b2f233d09ea","resolution":{"observed_at":"2026-08-06T21:49:45.651161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06670","last_updated":"2024-04-03T15:21:12Z","snapshot_observed_at":"2026-08-13T04:43:50.449082Z","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06670","snapshot_observed_at":"2026-08-06T18:54:14.255225Z","title":"Milojevi´ c, I","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07594","last_updated":"2025-07-10T09:54:26Z","snapshot_observed_at":"2026-08-06T18:34:39.694578Z","submitted_at":"2025-07-10T09:54:26Z","title":"Evasive sets, twisted varieties, and container-clique trees","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:54:14.255225Z"},"links":{"cited_paper":"/paper/2401.06670","citing_paper":"/paper/2507.07594"},"observation_digest":"sha256:c6e2b24ec02134b767dcfe023e8107cc1d1667bd33cc07058650509b8f7604dc","observation_id":"78552685-a7f5-4a06-b5db-bd8583b7275c","resolution":{"observed_at":"2026-08-06T18:54:14.255225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06670","last_updated":"2024-04-03T15:21:12Z","snapshot_observed_at":"2026-08-13T04:43:50.449082Z","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory","version":2},"cited_work":{"arxiv_id":"2401.06670","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.06670","snapshot_observed_at":"2026-07-03T02:37:34.565916Z","title":"Milojevi´ c, I","venue":null,"work_id":"6e970156-92bb-4159-940a-dcf1b0015250","year":2024},"citing_paper":{"arxiv_id":"2605.25905","last_updated":"2026-05-25T14:38:35Z","snapshot_observed_at":"2026-08-10T04:27:17.976071Z","submitted_at":"2026-05-25T14:38:35Z","title":"$K_{2,t+1}$-free graphs with many copies of $K_{t,t}$","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T21:33:07.348124Z"},"links":{"cited_paper":"/paper/2401.06670","citing_paper":"/paper/2605.25905"},"observation_digest":"sha256:9acb6b0a2e60be14bf24c48382b4d801505134bd24e90c0e16b315a082cd5719","observation_id":"2534faed-26ec-463d-81b3-f28d8b960207","resolution":{"observed_at":"2026-06-29T21:33:58.765008Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06670","last_updated":"2024-04-03T15:21:12Z","snapshot_observed_at":"2026-08-13T04:43:50.449082Z","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory","version":2},"cited_work":{"arxiv_id":"2401.06670","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.06670","snapshot_observed_at":"2026-07-03T02:37:34.565916Z","title":"Milojevi´ c, I","venue":null,"work_id":"6e970156-92bb-4159-940a-dcf1b0015250","year":2024},"citing_paper":{"arxiv_id":"2606.09801","last_updated":"2026-06-08T17:53:07Z","snapshot_observed_at":"2026-08-07T15:49:15.030831Z","submitted_at":"2026-06-08T17:53:07Z","title":"On the generalized Tur\\'an number of complete bipartite graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T15:49:09.460599Z"},"links":{"cited_paper":"/paper/2401.06670","citing_paper":"/paper/2606.09801"},"observation_digest":"sha256:810bb779a39a1719a7ad1478a6cdf61f49cb70c74f9a2221bc02e73c3389e401","observation_id":"e26bfac5-7a16-4742-8e35-21b196ed41f1","resolution":{"observed_at":"2026-07-03T02:37:34.567601Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06670","last_updated":"2024-04-03T15:21:12Z","snapshot_observed_at":"2026-08-13T04:43:50.449082Z","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06670","snapshot_observed_at":"2026-07-14T11:16:42.445474Z","title":"Milojevi","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10496","last_updated":"2026-07-11T22:10:16Z","snapshot_observed_at":"2026-08-11T14:22:45.561955Z","submitted_at":"2026-07-11T22:10:16Z","title":"A Colorful Extension of VC-dimension and Geometric Applications","version":1},"reference_index":196,"source":"arxiv_source","source_observed_at":"2026-07-14T11:16:42.445474Z"},"links":{"cited_paper":"/paper/2401.06670","citing_paper":"/paper/2607.10496"},"observation_digest":"sha256:546bc4522c1bb7b489efca3ba8baac1ff6b4453a5cc46c20bb25db322b4aae5e","observation_id":"d0c181e4-8993-4018-838a-7f4878bcaca9","resolution":{"observed_at":"2026-07-14T11:16:42.445474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.06670/citation-record","integrity":"/paper/2401.06670/integrity","json":"/paper/2401.06670/citation-record.json","paper":"/paper/2401.06670"},"outbound":[],"paper":{"arxiv_id":"2401.06670","last_updated":"2024-04-03T15:21:12Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-13T04:43:50.449082Z","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2401.06670."}