{"as_of":"2026-08-08T09:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f7401fe96164b71f8dace1ef32ceb0c79748d22526d1992ba556bc946f5f2bfb","coverage":[{"denominator":216,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:14:56.727129Z","state":"measured"},{"denominator":110,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":110,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T10:50:20.659202Z","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":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-05T10:50:20.659202Z","title":"Gerbner and C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.03851","last_updated":"2025-09-04T03:26:40Z","snapshot_observed_at":"2026-08-05T10:50:20.189599Z","submitted_at":"2025-09-04T03:26:40Z","title":"The generalized Tur\\'an number for K_3 in graphs without suspensions of a path on five vertices","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T10:50:20.659202Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2509.03851"},"observation_digest":"sha256:42ea2c61b99e41a23ea25d26c20b9cc7e190970cc08a1b3b579fb274b72b02a3","observation_id":"01d753a6-14f9-4b3a-9233-46f58745c513","resolution":{"observed_at":"2026-08-05T10:50:20.659202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":"2506.03418","doi":"10.48550/arxiv.2506.03418","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gerbner and C","venue":"ArXiv.org","work_id":"04ccad5a-1097-405e-b6ed-657c71a2afa0","year":2025},"citing_paper":{"arxiv_id":"2604.06357","last_updated":"2026-04-07T18:36:56Z","snapshot_observed_at":"2026-08-03T01:39:19.733390Z","submitted_at":"2026-04-07T18:36:56Z","title":"Helly Theorems for Generalized Tur\\'an Problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T18:44:11.658300Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2604.06357"},"observation_digest":"sha256:fa7e339b4c97fc0071c6ef2e5a9549a751656a7305e5c6f56c47c687967e5178","observation_id":"0d5fc6e4-a613-4bf3-9ed3-2f1c68661d7d","resolution":{"observed_at":"2026-05-11T00:00:56.109340Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":"2506.03418","doi":"10.48550/arxiv.2506.03418","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gerbner and C","venue":"ArXiv.org","work_id":"04ccad5a-1097-405e-b6ed-657c71a2afa0","year":2025},"citing_paper":{"arxiv_id":"2604.18217","last_updated":"2026-04-20T13:01:30Z","snapshot_observed_at":"2026-07-06T23:05:08.728446Z","submitted_at":"2026-04-20T13:01:30Z","title":"Generalized Tur\\'an problems for Berge hypergraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T04:34:11.680951Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2604.18217"},"observation_digest":"sha256:b10eaa2c1e85b17df184079e056d0f627eb03734c2a9f1cf3d62593d9eb980e7","observation_id":"3a1c876d-7bfd-479c-9e88-ad142dbe8897","resolution":{"observed_at":"2026-05-10T12:20:22.988301Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":"2506.03418","doi":"10.48550/arxiv.2506.03418","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gerbner and C","venue":"ArXiv.org","work_id":"04ccad5a-1097-405e-b6ed-657c71a2afa0","year":2025},"citing_paper":{"arxiv_id":"2605.25905","last_updated":"2026-05-25T14:38:35Z","snapshot_observed_at":"2026-08-06T22:13:35.953140Z","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":8,"source":"pdf_text","source_observed_at":"2026-06-29T21:33:07.348124Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2605.25905"},"observation_digest":"sha256:e51106addff7756d925a9fcae30102f42f3da658dc6156c41fdb516a42d80c50","observation_id":"a75128c9-fa8d-4cef-b0dd-ffb79e7bb711","resolution":{"observed_at":"2026-06-29T21:33:58.768340Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":"2506.03418","doi":"10.48550/arxiv.2506.03418","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gerbner and C","venue":"ArXiv.org","work_id":"04ccad5a-1097-405e-b6ed-657c71a2afa0","year":2025},"citing_paper":{"arxiv_id":"2606.02855","last_updated":"2026-06-01T20:19:23Z","snapshot_observed_at":"2026-08-08T02:20:13.504052Z","submitted_at":"2026-06-01T20:19:23Z","title":"$K_{2, t+1}$-free graphs containing an optimal number of $K_{t, t}$'s","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T13:30:44.355841Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2606.02855"},"observation_digest":"sha256:d9b28abb5f7edda0aca4cd5b8410171e4174f66c81758d52e7246a6a9c6a8cb2","observation_id":"16bbb789-3070-44a5-b2e7-d1612dfae87f","resolution":{"observed_at":"2026-06-28T13:32:15.195154Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":"2506.03418","doi":"10.48550/arxiv.2506.03418","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gerbner and C","venue":"ArXiv.org","work_id":"04ccad5a-1097-405e-b6ed-657c71a2afa0","year":2025},"citing_paper":{"arxiv_id":"2607.00212","last_updated":"2026-06-30T21:43:51Z","snapshot_observed_at":"2026-08-07T06:24:44.235347Z","submitted_at":"2026-06-30T21:43:51Z","title":"Strong Majority Edge-Coloring","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-02T18:30:45.381161Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2607.00212"},"observation_digest":"sha256:7063876ec59232382da5442f01ad176878415a7eda5ec878329d760e3ea26817","observation_id":"36e6f641-d690-4f92-a0f3-fdc4640692d8","resolution":{"observed_at":"2026-07-02T18:37:16.229553Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":"2506.03418","doi":"10.48550/arxiv.2506.03418","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gerbner and C","venue":"ArXiv.org","work_id":"04ccad5a-1097-405e-b6ed-657c71a2afa0","year":2025},"citing_paper":{"arxiv_id":"2607.00770","last_updated":"2026-07-05T12:48:59Z","snapshot_observed_at":"2026-08-04T18:26:09.723321Z","submitted_at":"2026-07-01T10:53:33Z","title":"Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-02T10:52:06.775804Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2607.00770"},"observation_digest":"sha256:df9ba18d474fe3beab0a931b07de879dc2ec3c877ad4ea9c14c5a405c3255a35","observation_id":"15d71919-7b76-4472-b7da-768c0777eb9f","resolution":{"observed_at":"2026-07-02T10:56:51.961405Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":"2506.03418","doi":"10.48550/arxiv.2506.03418","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gerbner and C","venue":"ArXiv.org","work_id":"04ccad5a-1097-405e-b6ed-657c71a2afa0","year":2025},"citing_paper":{"arxiv_id":"2607.00770","last_updated":"2026-07-05T12:48:59Z","snapshot_observed_at":"2026-08-04T18:26:09.723321Z","submitted_at":"2026-07-01T10:53:33Z","title":"Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-03T20:33:02.948156Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2607.00770"},"observation_digest":"sha256:e6871e261eb30d4a2bd0c920e1c61a712b0261318c65a26d3a5a69147abc7eda","observation_id":"15152155-02ae-457c-a60b-d5894418af46","resolution":{"observed_at":"2026-07-03T20:38:55.136066Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-07-12T09:16:46.694355Z","title":"Gerbner and C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.00770","last_updated":"2026-07-05T12:48:59Z","snapshot_observed_at":"2026-08-04T18:26:09.723321Z","submitted_at":"2026-07-01T10:53:33Z","title":"Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T09:16:46.694355Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2607.00770"},"observation_digest":"sha256:b248ed086121eb21315b6d31cfa87929b3a253f39a8b2f4907188c7a400d3d8b","observation_id":"80e73317-5681-408e-817f-3092b5bf2f2f","resolution":{"observed_at":"2026-07-12T09:16:46.694355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03418","snapshot_observed_at":"2026-08-02T03:10:54.647247Z","title":"Gerbner and C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14022","last_updated":"2026-07-15T16:54:55Z","snapshot_observed_at":"2026-08-02T12:26:28.076037Z","submitted_at":"2026-07-15T16:54:55Z","title":"Supersaturation for Hypergraph-Weighted Independent Sets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T03:10:54.647247Z"},"links":{"cited_paper":"/paper/2506.03418","citing_paper":"/paper/2607.14022"},"observation_digest":"sha256:1a1113c18173a74eb8a55a507a0d8e754c0340862cc890cbd53898ffa6828c63","observation_id":"0a22e90c-81b0-4f5e-a843-86622377e2f9","resolution":{"observed_at":"2026-08-02T03:10:54.647247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.03418/citation-record","integrity":"/paper/2506.03418/integrity","json":"/paper/2506.03418/citation-record.json","paper":"/paper/2506.03418"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:47.623998Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:47.623998Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:15932cd12c926f0c7ed79de73117583789f4c87cdea0d356c1f5084fcc2e9176","observation_id":"d3f91a73-0121-4d70-bdb6-1488e33ca570","resolution":{"observed_at":"2026-08-07T11:14:47.623998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:47.730424Z","title":"Alon and P","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:47.730424Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:d03a9953ed905a7e9ccb45db9a63114ec7d9752d4aa59f521c235a694f99f676","observation_id":"012c1cd1-8e00-4b75-8236-b3e23703a5a6","resolution":{"observed_at":"2026-08-07T11:14:47.730424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:47.832217Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:47.832217Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:aa5173182d0fe8e1aaffde5f0576404bb1e4fa83b85a4e852c2c61d04fbea54a","observation_id":"b95bfb21-9f4a-4d59-a209-67c3c23b9808","resolution":{"observed_at":"2026-08-07T11:14:47.832217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:47.925747Z","title":"Alon and C","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:47.925747Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:407b8492044643ad822f60f4cf79567808c50d114f940578d8cf64d903e477c4","observation_id":"6c8611c7-3f72-4603-82b4-03904fc767e7","resolution":{"observed_at":"2026-08-07T11:14:47.925747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.003947Z","title":"Alon and J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.003947Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:719d8082cc806a8941f3a32654a91d8d1588038c3b0b06480160686d37b5a4e2","observation_id":"99f662f7-add9-47c5-b88e-b321e2e82ca4","resolution":{"observed_at":"2026-08-07T11:14:48.003947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.119326Z","title":"Balogh, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.119326Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:249cfb230c61262e0482c1c1d41adff9539100fdbf9f8235d8d5098eac665c01","observation_id":"7f54d93a-2396-453a-9a4a-fad5c19f5f90","resolution":{"observed_at":"2026-08-07T11:14:48.119326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.202875Z","title":"Bayer, T","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.202875Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:37a9ab1b31377ec4d32dcf1b9d16f12728606b01d97b1ff0b71eeadde13c5a08","observation_id":"a9e1e6a9-a988-4610-8338-85acdaa12bc2","resolution":{"observed_at":"2026-08-07T11:14:48.202875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.281192Z","title":"Beke and O","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.281192Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:0213f95159834877e7eb231e4f9fa6c5e0edf29ec315d0b1b69f5415219e8d1b","observation_id":"3e471694-a42e-42db-95f5-e418d4e96db5","resolution":{"observed_at":"2026-08-07T11:14:48.281192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.369316Z","title":"Bollob´ as.Modern graph theory, volume 184 ofGraduate Texts in Mathematics","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.369316Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:613fc7101d2305d5c33766c765c50b84904bba5fbcbe8609d446483fe0d22953","observation_id":"d16ecf05-9360-4c0a-9d6d-d7dd4bc0bbac","resolution":{"observed_at":"2026-08-07T11:14:48.369316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.483424Z","title":"Bollob´ as.Extremal graph theory","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.483424Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:cebb0573341d20b5d2b914fb2e9dafff6e1707dc4ca3488893a8cc94cc24f4d1","observation_id":"5dbca1c2-6f7b-440f-b036-3d319b7ffcb1","resolution":{"observed_at":"2026-08-07T11:14:48.483424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.568410Z","title":"Bollob´ as and E","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.568410Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:860c2242554d537f019698ad6810202237a8edf3e74048b8f8f46f73a3cbecae","observation_id":"f4bfa7ee-5d38-4acc-8668-6706f949c357","resolution":{"observed_at":"2026-08-07T11:14:48.568410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.672874Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.672874Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:cec5e1d35ac2dca6b3d2e2e8174a37d4a251b5b2652211d06e18a967f3ed65d3","observation_id":"85f93f68-5866-4fbb-b902-18a71b77929b","resolution":{"observed_at":"2026-08-07T11:14:48.672874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.766150Z","title":null,"venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.766150Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:78d2573f41e5fe4ea4f8e036ff49cec1aaa2a0af95af923deb99c62de11d450d","observation_id":"5fcceb64-4589-48bf-81d4-6bdb5e1fe7f2","resolution":{"observed_at":"2026-08-07T11:14:48.766150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:48.859854Z","title":"Borovicanin, K","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.859854Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:bd5c4b6a95e1c7b263b38f8daaac3bced1d9d990c4137215cc1ebd9a6833847f","observation_id":"b75445e1-aa10-4d6f-a2fe-3b1e6ec71422","resolution":{"observed_at":"2026-08-07T11:14:48.859854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09379","last_updated":"2026-04-30T12:29:42Z","snapshot_observed_at":"2026-08-03T02:31:08.844645Z","submitted_at":"2023-10-13T19:57:51Z","title":"Some exact and asymptotic results for hypergraph Tur\\'an problems in $\\ell_2$-norm","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09379","snapshot_observed_at":"2026-08-07T11:14:48.951693Z","title":"Brooks and W","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:48.951693Z"},"links":{"cited_paper":"/paper/2310.09379","citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:cf3f3a1d0c72e5ad5339befe17aee5e887a81c3959a02d637b20396b6e8e82fc","observation_id":"56984988-0265-4dea-bb31-cd8952994627","resolution":{"observed_at":"2026-08-07T11:14:48.951693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.069380Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.069380Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:579268ab044f00cbdfc684ef6c623ff2d54d90c92c3344ab8a796e6e59900aac","observation_id":"523b1550-c381-40fd-a637-4fde4602e47d","resolution":{"observed_at":"2026-08-07T11:14:49.069380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.150018Z","title":"Bruyere and H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.150018Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:dc31e7d63c673eeb24678c41efbe6826fad7d2d66327aafda7251a551d80e07f","observation_id":"97580f81-27f0-43fb-a8c3-d632bded5e2a","resolution":{"observed_at":"2026-08-07T11:14:49.150018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.218883Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.218883Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:8be264c9abd1f9d86833aef0eb305b2b62c5c69ca713349f1e553322013c6846","observation_id":"12974bf6-b6a4-4e37-853f-1a24ec6445db","resolution":{"observed_at":"2026-08-07T11:14:49.218883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.302955Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.302955Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:4834d60b9a008e5a406520c157019622826297374cb65b8bb7713525aa3326dd","observation_id":"a2fff9d9-5001-49c4-b3fc-8e4ef6d303d8","resolution":{"observed_at":"2026-08-07T11:14:49.302955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.366452Z","title":"Byrne, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.366452Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:28595d99c5ddf70bde4611fe9c10f08ab94eceec2209b94ebf8c27faf50d7d09","observation_id":"ce03c66b-03fa-4571-9ced-7c8d8eaaeeee","resolution":{"observed_at":"2026-08-07T11:14:49.366452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.445007Z","title":"Cambie, R","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.445007Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:19d66eef0de87b52e2a35c9dffc55c03d8f9cc9e2a08678d3bce6b9a3b7b905b","observation_id":"03b888bc-460f-4701-bc28-6d0958484015","resolution":{"observed_at":"2026-08-07T11:14:49.445007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.497317Z","title":"Caro and R","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.497317Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:74a1b70639cc34f150b249734363a3c9cfe395e9ba1c0eaf58ac4844139d8ed8","observation_id":"8fbeca3a-f00e-4b41-a64a-70ee1ccc5a56","resolution":{"observed_at":"2026-08-07T11:14:49.497317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.588454Z","title":"Chakraborti and D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.588454Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:cb09e1a0507b747bda3cc3a63457bbd1bf3e8e4cb77e580cddd2148edb740a9f","observation_id":"6d6e97a8-80f6-4fe8-b0d9-166751ebb876","resolution":{"observed_at":"2026-08-07T11:14:49.588454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.660907Z","title":"Chao and Z","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.660907Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:3e4acd84502eeead6b86ea4182362bea1e249cf5a26e77b4738a3929399c3169","observation_id":"82afed61-b9cd-4256-8826-2837aa320eb6","resolution":{"observed_at":"2026-08-07T11:14:49.660907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:49.970280Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:49.970280Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:e5f23714d7e76909ae2aa30d09e2ffe8eca8cbb90c71560603580cbcd1621d48","observation_id":"cfbd052b-3f38-4246-a2b2-7cab4a5c4ed1","resolution":{"observed_at":"2026-08-07T11:14:49.970280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.064234Z","title":"Chen, J.-B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.064234Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:f053b1e08e89ca4a701ca67d8da2b988e23ce61858da10005a7831549c5d05b9","observation_id":"bdb2e61a-169b-4298-b507-5fcc255c73ce","resolution":{"observed_at":"2026-08-07T11:14:50.064234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.171041Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.171041Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:59dffddadd33933f4ed1b2680c9d958e2a645a7e6868a26f63f16339ee39e690","observation_id":"450df579-94c3-44a2-acf0-66b6ef97431f","resolution":{"observed_at":"2026-08-07T11:14:50.171041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.239710Z","title":"Conlon, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.239710Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:c8b974e666c2f9f5e758a52fd26552da256cb613cbc2e1edf380e23fbad25028","observation_id":"fa86e0b3-d73a-4a6c-acc3-d30435a73382","resolution":{"observed_at":"2026-08-07T11:14:50.239710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.338538Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.338538Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:db51e0c7d5a440bbd547a31049cc0b545ee2c66d35668d150c4ecff6ef4e486f","observation_id":"a73f983f-6349-4ab8-a352-2c59f68d5e64","resolution":{"observed_at":"2026-08-07T11:14:50.338538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.425716Z","title":"Cutler, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.425716Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:e837fa2a17fc50a91beff96175f8e785daf9c0b9f7704a96ae43bf4795683a8b","observation_id":"24c11f7b-4bf5-4d46-a457-0fd09a7848dc","resolution":{"observed_at":"2026-08-07T11:14:50.425716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.525748Z","title":"Cutler and A","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.525748Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:7c0a05f46c7ee40ed63d6cfc4e255d935ac466107b877f24d4d98567d8cd3567","observation_id":"b7a56f58-df46-43a6-b52c-c2d03a883709","resolution":{"observed_at":"2026-08-07T11:14:50.525748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.614124Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.614124Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:a059eab105db194d4f19db86fcc004ffb882527ba63a12e39636b4e7fa460425","observation_id":"0e21a828-ef5d-4c26-8f9a-4d003103931b","resolution":{"observed_at":"2026-08-07T11:14:50.614124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.716070Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.716070Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:4b9a580b69a0dd734a402ce7b32843c66cc6c09d54d4e3f11b3109c692463daf","observation_id":"6620066f-9d5e-46c1-80f2-eb5d20c81f85","resolution":{"observed_at":"2026-08-07T11:14:50.716070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:50.794302Z","title":"De Winter, F","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.794302Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:6bc47ac609b9bf2a44ae76e2917d1d02302f81849d6ee4514d307c86a27814d5","observation_id":"f29cdeb0-0521-4265-9573-204a08535429","resolution":{"observed_at":"2026-08-07T11:14:50.794302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.09089","last_updated":"2018-12-24T07:17:52Z","snapshot_observed_at":"2026-07-06T07:22:50.990416Z","submitted_at":"2018-12-21T12:48:01Z","title":"The maximum number of triangles in graphs without large linear forests","version":2},"cited_work":{"arxiv_id":"1812.09089","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.09089","snapshot_observed_at":"2026-08-07T11:15:12.473923Z","title":"The maximum number of triangles in graphs without large linear forests","venue":"math.CO","work_id":"a5565104-614d-4aa0-b5b1-74aec319e8b9","year":2018},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.880021Z"},"links":{"cited_paper":"/paper/1812.09089","citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:6b3e02f1294a55c4b00634a6dc8a48067262ea8fe87bcc2238c9f4ce312c059f","observation_id":"e4a7fbd0-2d1a-4c6a-9466-905470fcb5d0","resolution":{"observed_at":"2026-08-07T11:15:12.543787Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08265","last_updated":"2023-12-13T16:24:56Z","snapshot_observed_at":"2026-07-06T17:01:09.790694Z","submitted_at":"2023-12-13T16:24:56Z","title":"Clique Supersaturation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.08265","snapshot_observed_at":"2026-08-07T11:14:51.007791Z","title":"Dubroff, B","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.007791Z"},"links":{"cited_paper":"/paper/2312.08265","citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:6ba1daaa7557f79e39d59f15109fded150bdf19d6863c294e90bf45f7eb508ee","observation_id":"0556b7f9-5a42-4d93-a1e3-ca74076a3e24","resolution":{"observed_at":"2026-08-07T11:14:51.007791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.08424","last_updated":"2024-09-12T23:06:55Z","snapshot_observed_at":"2026-07-06T19:14:37.951588Z","submitted_at":"2024-09-12T23:06:55Z","title":"Rational exponents for cliques","version":1},"cited_work":{"arxiv_id":"2409.08424","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.08424","snapshot_observed_at":"2026-08-07T11:15:12.254678Z","title":"Rational exponents for cliques","venue":"math.CO","work_id":"9c05cf23-90b4-4eb5-8548-4c3428822297","year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.085206Z"},"links":{"cited_paper":"/paper/2409.08424","citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:37e175a74545099957b0e42227d45e2dccc769470a111e38478076ed32facde3","observation_id":"8a616a15-ed79-4936-8b21-b0243f946061","resolution":{"observed_at":"2026-08-07T11:15:12.344628Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.151843Z","title":null,"venue":null,"work_id":null,"year":1938},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.151843Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:75c30fdab384ea955db94b8a7477bc246f2182a0c4e3ef02a6cde867e5d6f2d0","observation_id":"bcee589a-e10e-4101-a68c-d12159ee931f","resolution":{"observed_at":"2026-08-07T11:14:51.151843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.273174Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.273174Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:52172d42ad6a0c320d769e288600e8406a1459568828f0ab915a7688af67ec16","observation_id":"95a7298c-02d0-4832-88f6-9361a25e6117","resolution":{"observed_at":"2026-08-07T11:14:51.273174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.344901Z","title":null,"venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.344901Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:b509ca70463262ac31fe594f91fab25ef1fea42ed7a8bed8443eead2dd71d9ca","observation_id":"e778f27e-195c-4aaa-a041-8a00e8b274e8","resolution":{"observed_at":"2026-08-07T11:14:51.344901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.426968Z","title":null,"venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.426968Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:72c3725264322a1d0a8e576a3e214c14c07cb0d4fe7282a97ba966e0231aefaf","observation_id":"b794eb10-f845-4105-93a3-0735efdd9a84","resolution":{"observed_at":"2026-08-07T11:14:51.426968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.504882Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.504882Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:e50f58ed381e97ec30f1212f7d8f051cf22fbe919a366b9e35b30607a0c2f2f1","observation_id":"cfcb3500-8c97-4eed-a044-dabe69b87db5","resolution":{"observed_at":"2026-08-07T11:14:51.504882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.557947Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.557947Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:b627cf9b39c5eecf2d61c141172a8d7e106c551e37872132213b27ee5a06cee5","observation_id":"fdeba52d-0391-44ae-adb1-b3e163b1bf25","resolution":{"observed_at":"2026-08-07T11:14:51.557947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.646212Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.646212Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:929d38e2b2750404660c9fa1d2dc35687f1b732125ba7925e8e84cb943127c8c","observation_id":"79bf2849-685b-4cd8-b5e4-32375df5a306","resolution":{"observed_at":"2026-08-07T11:14:51.646212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.702426Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.702426Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:7daed77840ae12203b1ff1c72d8f06927cbdd7c787ea916724da12b5172b896e","observation_id":"319cf40b-7e92-43a1-9534-76525ae4a449","resolution":{"observed_at":"2026-08-07T11:14:51.702426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.767338Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.767338Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:a8e29f04f18d5149a63f1a2d1ec3fdfed471110c9c603ee02c29cd8b7226bfbc","observation_id":"78d3385c-8d0a-4b18-9a49-a63268acf4d7","resolution":{"observed_at":"2026-08-07T11:14:51.767338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.844416Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.844416Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:f1170d9249de856d4f802f636f9c68e8668600eafe232392972a03ec182cb9c4","observation_id":"e8109273-a47a-4195-823f-7e3bd3504a51","resolution":{"observed_at":"2026-08-07T11:14:51.844416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.901357Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.901357Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:017ad22484576556991ca40ced2805ca9b0a2e50a985e9b7464377980ba5ed7e","observation_id":"c7d8fd2e-e4e4-4c2c-83eb-478accb450ab","resolution":{"observed_at":"2026-08-07T11:14:51.901357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:51.947188Z","title":"Erd˝ os, Z","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:51.947188Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:ef8d48ea1b8c3061df8e7e69116174647ba8fe5ab15425740b9946b4b23b2ecd","observation_id":"ee13af0b-2d41-4088-a5cc-78f3067819fd","resolution":{"observed_at":"2026-08-07T11:14:51.947188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.003057Z","title":"Erd˝ os and T","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.003057Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:5370c62f77af7c3b039fe988c9d85b063b1b9d27aeef0e8a474408f53d932a43","observation_id":"bacc40c2-d103-4fe6-ae1f-2676bb273750","resolution":{"observed_at":"2026-08-07T11:14:52.003057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.063528Z","title":"Erd˝ os and M","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.063528Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:aa3d3fe0f3d662259b35f0e7bd39f1fd625708884e7262f24411b044392ab1d6","observation_id":"b3ae1960-9b76-450e-b891-fb3661609d3f","resolution":{"observed_at":"2026-08-07T11:14:52.063528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.150941Z","title":"Erd˝ os and M","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.150941Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:132e454017f55014326d5363dbff06e148fe4efb4e4c7098ef9c591f2d1e7967","observation_id":"e90d2dc9-4951-423f-b31d-636051eec17f","resolution":{"observed_at":"2026-08-07T11:14:52.150941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.217544Z","title":"Erd˝ os and M","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.217544Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:fe5d6d47ee1c2f81728c82cdfdcea1c6f9fe00c5689925bacffaab0998762259","observation_id":"0f1cd3a0-2707-4089-b333-1d53dc893355","resolution":{"observed_at":"2026-08-07T11:14:52.217544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.294572Z","title":"Erd˝ os and M","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.294572Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:f2013eb2bff1f2009aa9aae9c27aac70ccce966fa3270cf81d5dfdabcbc6d0c1","observation_id":"b771c4a4-2612-4eae-a796-3e97939dffe4","resolution":{"observed_at":"2026-08-07T11:14:52.294572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.368516Z","title":"Erd˝ os and A","venue":null,"work_id":null,"year":1946},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.368516Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:8e02f538b69618584908cb5b38a14350f129b47daa530262ee3933841baefb4d","observation_id":"cf3e9ec4-7ea6-4925-8173-43a4f5034017","resolution":{"observed_at":"2026-08-07T11:14:52.368516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.448099Z","title":"Ergemlidze, E","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.448099Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:2107c5202f00cce9aef5f0f1b44592eca2847d0f1bcec8cef67155371dc7ef92","observation_id":"46420ec8-4f53-4d7d-886c-3af09257b7e7","resolution":{"observed_at":"2026-08-07T11:14:52.448099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.490236Z","title":"Ergemlidze and A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.490236Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:555f9b9b9f7f0da0b3f981104d7a3e3965a2d8729d30ebfb34ad4774ce95fc86","observation_id":"a2eeca66-bae5-41c4-8973-3d665c2931db","resolution":{"observed_at":"2026-08-07T11:14:52.490236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.543684Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.543684Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:a740a89f41cc92980faee7826149e70f38f77cc9e0a08f33dffd78613f1a98e1","observation_id":"e6532d3f-a589-4904-9709-93c70efeed0e","resolution":{"observed_at":"2026-08-07T11:14:52.543684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.599730Z","title":"Fiorini.On some extremal properties of bipartite graphs of large girth","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.599730Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:bbd92f86b5cf7354cf9c4551640068ca24e9dcef6e06f97afc342326c80cef1d","observation_id":"23cac3e3-2b5d-491a-9d96-838f37a8c84f","resolution":{"observed_at":"2026-08-07T11:14:52.599730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.672958Z","title":"Fiorini and F","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.672958Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:d670745de398f25677cae1f9ed5c221ead4249931efa847baab30d485d756a6d","observation_id":"c2ef3181-c2dd-4ba0-bc47-844f6b2705f7","resolution":{"observed_at":"2026-08-07T11:14:52.672958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.726949Z","title":"Fiorini and F","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.726949Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:db29ec8f6f1abac61f7ef65bd92a65660b4a8251d38928d897ab031299757a48","observation_id":"c4e4779d-72a2-4483-9154-40278f15c5d4","resolution":{"observed_at":"2026-08-07T11:14:52.726949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.785026Z","title":"F¨ uredi","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.785026Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:90a7f934e35b0cf44ae522074d52555c4dd30424309e8790881dd1922c04de48","observation_id":"30996656-ac92-4a9c-b9e2-d1f72fc84d3d","resolution":{"observed_at":"2026-08-07T11:14:52.785026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.835839Z","title":"F¨ uredi, M","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.835839Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:7344f3a89d2603f0158bb8c614459408ca83a141b82f0342c600777040fce278","observation_id":"bf5db151-9d52-47f1-a8c8-be22beb3481e","resolution":{"observed_at":"2026-08-07T11:14:52.835839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.890837Z","title":"F¨ uredi and A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.890837Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:3023b8c82ee1f1282af915dbf15143453ade1af25b5ee9a1f53b3f1dcfa3bd2e","observation_id":"3b898cff-298c-43a9-8c61-5f449320626d","resolution":{"observed_at":"2026-08-07T11:14:52.890837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:52.942047Z","title":"F¨ uredi and L.¨Ozkahya","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:52.942047Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:30f73685336795069ec50b07df31f33a76f5c47b3550016b3befa09841deb652","observation_id":"d0172f49-2276-4e6b-bfee-e48a1dcbe3b7","resolution":{"observed_at":"2026-08-07T11:14:52.942047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:53.011320Z","title":"F¨ uredi and M","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.011320Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:29795c5848f4ad22d075c0bf0e0607c6e677c17c51b2d99d9d052f2a940f8f0b","observation_id":"dbe3dd5d-cc30-4631-b5a6-f611574aed71","resolution":{"observed_at":"2026-08-07T11:14:53.011320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:53.098598Z","title":"F¨ uredi and D","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.098598Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:4c656bfb5e29b3a2b627b9c41365c94ce17c3cc2de87758397fb4fcb8c991880","observation_id":"c5c2a908-1606-4a48-8829-6189945acdc5","resolution":{"observed_at":"2026-08-07T11:14:53.098598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:53.168790Z","title":"Gan, P.-S","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.168790Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:86fe1f092e1d4b3427d4860e2b0e6a6107c5ed94d2fc84606673fd696b457021","observation_id":"128b8785-1302-418e-9bf4-4d7d52747692","resolution":{"observed_at":"2026-08-07T11:14:53.168790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15579","last_updated":"2025-03-02T08:39:58Z","snapshot_observed_at":"2026-07-06T19:55:59.816003Z","submitted_at":"2024-11-23T14:56:35Z","title":"Phase transition of degenerate Tur\\'{a}n problems in $p$-norms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15579","snapshot_observed_at":"2026-08-07T11:14:53.255758Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.255758Z"},"links":{"cited_paper":"/paper/2411.15579","citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:ad7689b459bc779aaadaf2dd176a0a8deeeaa9c2108bd841a4dabeae7efec1ba","observation_id":"0ae3e660-30c5-49df-91ba-f09df758a779","resolution":{"observed_at":"2026-08-07T11:14:53.255758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2311.15289","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:15:12.006744Z","title":null,"venue":null,"work_id":"ee71f423-9d75-4d11-872e-2c9058967822","year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.323411Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:adcea041a5aedbfe67bd0e5bd5e70a008c93c5dbdb79082b0594eb6b9f043ac9","observation_id":"58dd170e-c338-48b8-b88e-de8871255865","resolution":{"observed_at":"2026-08-07T11:15:12.098537Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07072","last_updated":"2025-03-10T08:55:52Z","snapshot_observed_at":"2026-08-07T17:17:34.473748Z","submitted_at":"2025-03-10T08:55:52Z","title":"The maximum number of cliques in disjoint copies of graphs","version":1},"cited_work":{"arxiv_id":"2503.07072","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.07072","snapshot_observed_at":"2026-08-07T11:15:11.744330Z","title":"The maximum number of cliques in disjoint copies of graphs","venue":"math.CO","work_id":"ef540e7d-5583-47b2-b06c-f39cdcddb877","year":2025},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.411572Z"},"links":{"cited_paper":"/paper/2503.07072","citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:a51723db5fb9d528698cf7b9e9a4a4f4409524f9b5304a5608469ae434376374","observation_id":"d89b61a5-275a-4eb1-81dd-0f589229cce5","resolution":{"observed_at":"2026-08-07T11:15:11.833466Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:53.514478Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.514478Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:54e07c3e35886f823ca3dc5fbb5727eef0f54c758aab293109e3b379aa7a14ac","observation_id":"1835cde6-8f9d-4217-8f86-38db7876ce92","resolution":{"observed_at":"2026-08-07T11:14:53.514478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:53.635809Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.635809Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:74d9a8bd85909f53abf13a9746b75b1674df675f10c9bf0a61374227d5a6d055","observation_id":"abc3e4ef-49c7-40e3-a2e3-bbcd0d39af8f","resolution":{"observed_at":"2026-08-07T11:14:53.635809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:53.724844Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.724844Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:7045e5c94b21faa0fc3e6d334784039267dc653d4c5009d4cb8f464a81724de9","observation_id":"a47fbf0d-6e84-4598-a8c3-a27fc322b7cb","resolution":{"observed_at":"2026-08-07T11:14:53.724844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:53.810272Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.810272Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:05af215f8b4f1ae92a11f74b7ade100bf2305387430774356b0299e2c2fdc870","observation_id":"e1806fc1-6de2-4b09-9b29-4e2f5c2a4996","resolution":{"observed_at":"2026-08-07T11:14:53.810272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:53.948737Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:53.948737Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:124fd521cc061bf55380f3b5eee2be9a6a9826b841c6a4c7ddcf49da231179f7","observation_id":"7a8292e0-b846-4fb4-9e28-1ceadd454ddb","resolution":{"observed_at":"2026-08-07T11:14:53.948737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.09113","last_updated":"2023-09-17T00:12:01Z","snapshot_observed_at":"2026-07-06T16:19:30.162137Z","submitted_at":"2023-09-17T00:12:01Z","title":"On generalized Tur\\'an problems with bounded matching number","version":1},"cited_work":{"arxiv_id":"2309.09113","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.09113","snapshot_observed_at":"2026-08-07T11:15:11.554755Z","title":"On generalized Tur\\'an problems with bounded matching number","venue":"math.CO","work_id":"32ce8c74-93df-423e-9b57-258b811cc500","year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.075080Z"},"links":{"cited_paper":"/paper/2309.09113","citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:b1dd07d1a758d41044dc3198f7a4a6f34cf66280093189cff54c166bb6339b4f","observation_id":"460e83e3-08d8-474d-8e9d-3290a851fa22","resolution":{"observed_at":"2026-08-07T11:15:11.636797Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.177699Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.177699Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:8bcba79ce281d27e51e006278fafb392fab660a4623ee753f26bdbb4f7b51d6d","observation_id":"6a242d1e-ff7e-4f6a-9d6b-0ccfa933d768","resolution":{"observed_at":"2026-08-07T11:14:54.177699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.256761Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.256761Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:9079428f6c314c4e5bf8679ea0462ea73396a40d3bc69eea95a9ec6281a99318","observation_id":"2b210531-adc6-4660-9925-0a389f69dff0","resolution":{"observed_at":"2026-08-07T11:14:54.256761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.412968Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.412968Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:f18b1c06c8f1cabf97bede74b509adc082d244ef33f0093d35f804726f5f871a","observation_id":"c60c33b4-75e4-49fc-b627-936693c6b505","resolution":{"observed_at":"2026-08-07T11:14:54.412968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.502073Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.502073Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:3b1e6f10009c2f66612b9c7e47cb7aff3014000c43c1299dcef8e7bd30496b25","observation_id":"336e2f78-fb36-484e-8f4c-71542bc56c65","resolution":{"observed_at":"2026-08-07T11:14:54.502073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.578687Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.578687Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:12e8f33080e3ab2fc81113250468e6f42d736cfa046b0ab2dfbbca0a9af3d481","observation_id":"3cd77d54-8b57-458a-985d-ff30e6159c8a","resolution":{"observed_at":"2026-08-07T11:14:54.578687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.659719Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.659719Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:4fbed0c8db362f37d1c86c3c8049edc189dc9c9d0721cfd63d21a2d172bff91c","observation_id":"76d5609b-259e-4677-b78c-dd053aa46600","resolution":{"observed_at":"2026-08-07T11:14:54.659719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.745164Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.745164Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:41e53588e9ba017fb955d1523d4dabc2e63f6b7c8684d17df03254e047ffaa52","observation_id":"b2cc9c68-c294-48b3-a922-2bd4c77df9b7","resolution":{"observed_at":"2026-08-07T11:14:54.745164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.785546Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.785546Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:c75dfdaf13ddaad9165249f6629a96d77bce66d8d05cb323a03d23a7e4d6fc72","observation_id":"f9cc0ef7-38d6-413b-b3b7-ca8864e472a6","resolution":{"observed_at":"2026-08-07T11:14:54.785546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.841584Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.841584Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:75c8360334a6d0d33c7e7757b860c78820fdc5ad3273fdb0e91d8c9c461dbe4d","observation_id":"0631f9c8-e936-4275-aa7f-b303bdc7503b","resolution":{"observed_at":"2026-08-07T11:14:54.841584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:54.901756Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:54.901756Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:2697b0b6a39cbcd53722013dc30e8b1348a778e0f79dbcab43c3a26d5fa19805","observation_id":"0799309a-e7b0-440e-af59-793dc7ab5f52","resolution":{"observed_at":"2026-08-07T11:14:54.901756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:55.018256Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:55.018256Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:6ff237eccc297bd4399f26e1f76f02984e378d271bc34b940fc34b54ce31f184","observation_id":"bf94d821-6d67-4b3e-b3df-bdd78fdc6e67","resolution":{"observed_at":"2026-08-07T11:14:55.018256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:55.180056Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:55.180056Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:ca3a9ba51f72f0e744085d99db812a3656529507c8d38bd9644d3a5b8d6d043c","observation_id":"0147c498-ed9e-463c-913f-d39e4caa3cb8","resolution":{"observed_at":"2026-08-07T11:14:55.180056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:55.293498Z","title":"Gerbner, E","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:55.293498Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:5fb796845bccb6ac2416fdb8039bbca5c3338df2699b8ad80e8c3f08473ccf71","observation_id":"a82bc8fa-ce09-4ee7-be06-ea6151924a0d","resolution":{"observed_at":"2026-08-07T11:14:55.293498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:55.448580Z","title":"Gerbner and H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:55.448580Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:75ff3cfac05aa8b95c18f4257ad61050ea74cde777c1dffbd99f9b6dc63e0667","observation_id":"22383850-fa0f-436a-a482-2d91e9353814","resolution":{"observed_at":"2026-08-07T11:14:55.448580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:55.607040Z","title":"Gerbner and A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:55.607040Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:8c288000376221a1b4af8e61eb77fd87024129478d2419f502e6a3305d27d413","observation_id":"182da61f-daf7-4444-b024-fb239dca75f1","resolution":{"observed_at":"2026-08-07T11:14:55.607040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:55.717993Z","title":"Gerbner, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:55.717993Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:77f89fe7e9044561591616dbd6c23f051e12a9769187ebd921eb49f4f937eebd","observation_id":"912c79f2-2bd4-4e39-96c0-356122c67fa3","resolution":{"observed_at":"2026-08-07T11:14:55.717993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:55.865266Z","title":"Gerbner, A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:55.865266Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:37069c36b20b4657d36ce177e409594d3fbe46865e57098f8c297127ad1b9da7","observation_id":"b01d1f0c-2bad-4f89-aaba-5c66f74c1230","resolution":{"observed_at":"2026-08-07T11:14:55.865266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:55.996932Z","title":"Gerbner, Z","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:55.996932Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:75d60714ac942e70af4d1d8251481066c159d2d221b1c5bee6d9388deaeb6933","observation_id":"07422ab0-6bb5-4aed-bfdf-3782b60470f6","resolution":{"observed_at":"2026-08-07T11:14:55.996932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:56.121073Z","title":"Gerbner and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:56.121073Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:a31f3871f3e345a8335739cc75d9183bc496cfc58415ced4e9249874ee57ae57","observation_id":"21164473-1f2b-45ed-aeb2-8c0956f722b7","resolution":{"observed_at":"2026-08-07T11:14:56.121073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:56.269562Z","title":"Gerbner and C","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:56.269562Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:5c1eef0373e99bfa3bb1c9ac65ad4dae7bbd784fe0ca7bed543786f523740c53","observation_id":"def119ae-e465-43bd-9bde-738c92e43b5e","resolution":{"observed_at":"2026-08-07T11:14:56.269562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:56.425933Z","title":"Gerbner and C","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:56.425933Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:d4af422523ccc776381ae21fd9ee3cca3527b84e3f3f62d61829f0ea3e38446c","observation_id":"2d0f1444-f94b-4da5-b2de-7f4de9ac5428","resolution":{"observed_at":"2026-08-07T11:14:56.425933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:56.580907Z","title":"Gerbner and C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:56.580907Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:f1bd8bfd538eea6bfe5c86f49c9de66c7d3c50c56e41ecb19c9d4b32d552d577","observation_id":"94655f15-df8a-48a7-8c16-34b378d7d874","resolution":{"observed_at":"2026-08-07T11:14:56.580907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:14:56.727129Z","title":"Gerbner and B","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:56.727129Z"},"links":{"citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:610c12e8f5ac5207a32fc96e7f7f6507f1083665ec8e74576a29ceced7b3e210","observation_id":"53bef32c-0967-4845-a45e-b96043892b37","resolution":{"observed_at":"2026-08-07T11:14:56.727129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T11:01:03.005703Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":95,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":216},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 100 of 216 outbound references and 10 inbound Pith citation observations for arXiv:2506.03418."}