{"as_of":"2026-08-12T21:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a0ab4eb9bdd7ca1bbc39901a7bf266013349628f4e6efa961a40433e2a6c337","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-12T06:34:41.77262+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-09T20:13:11.965758Z","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-11T10:10:33.445145Z","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:d99ab367bba83047e6892c580a3d38de58305c0b6a7a1b0d1e5de29d3de079fc","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-09T20:13:11.965758Z","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:a360c0a7e236bdad87510dc2782722dc8d891cce48fdae627581a0ec1190b687","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-09T20:13:11.965758Z","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:ad7d57c49a745e80459baf2d3f0c6cf8c9d63698ab0f8ed586789023a4f91831","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-09T20:13:11.965758Z","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-10T04:27:17.976071Z","submitted_at":"2026-05-25T14:38:35Z","title":"$K_{2,t+1}$-free graphs with many copies of $K_{t,t}$","version":1},"reference_index":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:d15ce89bf0bd4d583da2ce0f132db7164b4cbcbbc64749120d9d41e77c73699f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-09T20:13:11.965758Z","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-12T10:48:32.964459Z","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:8da054f111b65637dd6549b30fbb0254a52a0eef71fd99adced6fa30451ae4b1","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-09T20:13:11.965758Z","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:90a5107f0a4d644f02b25633ce004a4670190eade2c740a6b760764bb5f208d4","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-09T20:13:11.965758Z","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-09T12:35:01.678294Z","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:a1f0f4eb6674937e1298fd91e4b85cc0f92eaff7d103e1a5aa9216d538f4983a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-09T20:13:11.965758Z","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-09T12:35:01.678294Z","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:90a4d9f243f300e5e3718fac8186179cc30100cc3f07b63f4d1d3dc56af26e36","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-09T20:13:11.965758Z","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-09T12:35:01.678294Z","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:eb9ccb228fd8be0b4a61587a16facf5e2cd5600edfe6ab87c88e31803e0704bb","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-09T20:13:11.965758Z","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:fc4688f4e68475cb704792e68dd6c029ff23262e47cff6d274480fc57c548d16","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-09T20:13:11.965758Z","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:c94e738842d9aaae231cae9b3e42d3913c19ca7877a38b17244450a85defbed0","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-09T20:13:11.965758Z","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:e3b3fff9eb69f1765e10129f096b3aafb9d5e39448ef8bf20b88fab7a35a8c06","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-09T20:13:11.965758Z","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:fb28142dd80c31d63c57abae273d6ba2751953460228fb1dc950fcc731c660b5","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-09T20:13:11.965758Z","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:d6efbc5a399b3613327a66774a84b188ec1a449ef028dc2820ff60b7f31d2068","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-09T20:13:11.965758Z","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:7ae12a3d332ef1fab90a335784f9da36f4f6fc8e4e1ff7b81e8e1f7fde66dfd0","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-09T20:13:11.965758Z","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:00f3f8ea5004692188002d516aca22528c45f27f1331e396eddbbc13f785c923","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-09T20:13:11.965758Z","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:5f523e5339bd14879acf06adf304b8f7c47a890cf0592988000a62a18e8fcc93","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-09T20:13:11.965758Z","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:63bc8930aa6a77fb4d1e1f050e6fab16d6d9939448cbd4f1a93bdbcacb26c60e","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-09T20:13:11.965758Z","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:2f21a870c1856e68f292faa0d76f13f953133c730ef6b4970e76e83fe2dc1cb0","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-09T20:13:11.965758Z","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:d4975171a754702821e7eb65a4aaaca59605ec4edca2de7c8e4a1097739220d4","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-09T20:13:11.965758Z","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:57a8448a5772c37808a7f1f65660af2900b3e083e70c3554178516021414235e","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-09T20:13:11.965758Z","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:c2ff5634bb7d55672e6fe997c73d9196cc86bff91ea76711fa2b367f992865b9","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-09T20:13:11.965758Z","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:18c72a6fb907c9b14bf49eec38ab0c4981f42a9f389c73aefd3d0728cc998c80","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-09T20:13:11.965758Z","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:5210b5ab71fa79b6d4e810a2c33cc2f43724f1964b0afd2dcb56d54c1899f3cc","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-09T20:13:11.965758Z","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:4c0e21cc8322c55a2a59c260762193fe9e333043e228f44c6547186ced4e9ac9","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-09T20:13:11.965758Z","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:31be9637fda9627e83135b88f196e8d65b18d519ec629c4cb5462f70a5b18121","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-09T20:13:11.965758Z","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:d26a03ed7f53a54036fb07a01f5cb47a16d8afe703ba38266e8dacf3c477a4bc","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-09T20:13:11.965758Z","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:59dceed1f4eda0b307e7407ff484225a745871f39056df21a1b5afa184334ab7","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-09T20:13:11.965758Z","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:1ca46a243cc38121b489d5a6dc6c93abab1384a91c5b4df8ac7f3e8a861ae33b","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-09T20:13:11.965758Z","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:132c4aa0e979e483694c753304be93f3faae909ae1a42793475daaa33428dc22","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-09T20:13:11.965758Z","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:021a134ba9ccdc45794197a0e4a8a7c8cfa4ac6f33646bf112be1ba4f94ea2f7","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-09T20:13:11.965758Z","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:45dd518805ec27fc7ce57b39830eda5b2ad219098e4fa2c8190c51b5ab0da6d1","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-09T20:13:11.965758Z","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:85620613b2245665a0fde89b9c4d59be41494022b8c97a87e7ba4328302be362","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-09T20:13:11.965758Z","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:a51c14757457f88472d1709c4aa2e47389f27cd15d9d681efc173e670dc80052","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-09T20:13:11.965758Z","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:f8e04cbd513af237d4cda7566763a5973e74af0c77f4a6233bfadde97469bfd4","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-09T20:13:11.965758Z","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:8419c4fe377166a81241ce0b16ed22b78451852626a88d2a919d19be79e26520","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-09T20:13:11.965758Z","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:e89b699202e1ad57b4f5553d461db4100b0886285d5378660a3133934b716748","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-09T20:13:11.965758Z","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:90b750b39064777278acf262938f771343e295a291a33238e4b7a40f4cc90f5f","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-09T20:13:11.965758Z","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:a2ebf0b8627526627d145df3352f0e80100db32115707ee614c9a72fb5427257","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-09T20:13:11.965758Z","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:c2558f8f23a263fe9102cc078b7769c3566f9ec7ff34d0afe3ac7b3aeec21e51","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-09T20:13:11.965758Z","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:cc3f46bd2386dca35186f3558299bf2990945a38db98ba3dcc2fc04f87215f7d","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-09T20:13:11.965758Z","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:ef8a539d31ef97876b2b11f0037031e6f7ce93581d54c7af3b7a5bbdf35a6909","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-09T20:13:11.965758Z","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:76f9541ca55c6fe0e39e09259790f3bdc8c647a83f11a4b1923e42c2143bdd02","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-09T20:13:11.965758Z","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:35b802745c25965320c443fdd7f79830fce503c3b7727b3aa47f173bfb874ea2","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-09T20:13:11.965758Z","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:08ff28188c75fdcd4a3c18e3b450352dc5a8ac73764334e41ccd1220aaf74b6d","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-09T20:13:11.965758Z","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:362bc7381c5eb1a767e86b55519bc190fc143750c2f7ec638315937ac415a1c2","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-08-09T12:16:01.778012Z","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-09T20:13:11.965758Z","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:29417134a1e5a2496b7965358b3e63c9bdbc74aac6b80c4d2fbf93279823c11e","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":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-09T20:13:11.965758Z","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:bcf4ad563c0547ae6b7a7b5806b00e18aef97e4c731d0608682da3cd60955ede","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-09T20:13:11.965758Z","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:5893c3444e3e35db200d7ce6be2d84c8745999867b86ba938074032009dfdfa0","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-09T20:13:11.965758Z","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:655d6ef0303a85899d5d8559b313c1ca543e92e36cf289c9cd5c5e103807ada2","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-09T20:13:11.965758Z","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:d31cb60aca60da929140fb40b9150c2e2e9957ed1e3bda7ad4c59985e22fd02b","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-09T20:13:11.965758Z","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:fff0a4d301c7b9725f823bd39dabd40e9b386685fc475f5742d1b31232a3ca30","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-09T20:13:11.965758Z","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:a07612eed38c1aa29fcfe49233a73ed0465e99846b48da48e533199b71de8168","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-09T20:13:11.965758Z","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:3ad7432922a76645b338b28b0a02c7e8d37fa59c4f8823e672d5a63bd544350c","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-09T20:13:11.965758Z","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:e2f57bed1334e846430af52bc057fdd3aa32ac4fb648c5a96e8922fb27e5c463","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-09T20:13:11.965758Z","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:2c42f171dee7211df9dde07b05dc8d56328ac573996e0e97355b2c0141a368a7","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-09T20:13:11.965758Z","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:d786e3c3ab3920c51e71f1ad2dabad905fb6f5b7d70e95e322d55a173012a247","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-09T20:13:11.965758Z","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:3362d72b3d2b6131a4057510beb2c9ada3e9325fc593b9ba510b529a725853c6","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-09T20:13:11.965758Z","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:ca49fe10739839c15bc2c20250b6a0db012b09e065cf5f3fc7da7a0cceffb5b8","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-09T20:13:11.965758Z","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:9ef13694c9447e47ffc27db13dbb8cf4d503b3e6dc91f7d7d49c2717926196c6","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-09T20:13:11.965758Z","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:932355b38af8b4314af675e7322889b589e74437050c779eed5fe85feb745569","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-09T20:13:11.965758Z","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:a7817c21b05d6c432e0e5d4432f7298561888bc1192bb5b2ca404c77720eac52","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-09T20:13:11.965758Z","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:59607bb70a2f137475b1b63ee8839e474e5f984be99c31d0c1f14cc05d09f607","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-09T20:13:11.965758Z","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:b81093ee00575da39c04ccbeba48d90382ee6f73e3ae30bf6109523036ad1728","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-09T20:13:11.965758Z","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:d867d7b91483c434524b70de0dd6396d17758db7e8d04cfb87f071e7ef43085d","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-09T20:13:11.965758Z","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:6ae4b2f3ca60d9c71459dfd979a7a03462f4f88a4555f60f99dbcd0ce305411b","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-09T20:13:11.965758Z","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:3c54f922246cb2188b590f07985b4bf47a5d5bad68c7514e9aa000129252b72d","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-09T20:13:11.965758Z","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:f12429c266027bdd91c7a690afb3fae012675fdde9c9a3e45fc4e26981353fb8","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-09T20:13:11.965758Z","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:1ecfdbe7d7fc052d45e11e8de08bd4d34633341acf254634ca0291e32755c12a","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-09T20:13:11.965758Z","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:871e1df60902d661902239ee200d47d41a7852ecbf4df061390be0af2b2aa18c","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-09T20:13:11.965758Z","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:5e3152f1ac63a6e5a49963f82e5a9c3a96d830d724b4c4955449ea7a440f5046","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-09T20:13:11.965758Z","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:b5931083996108def069de3cc0d1dcb0874f79591bfaa83269e5bd64b52f57d1","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-09T20:13:11.965758Z","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:d6ce438c39d090288cc46e9e4edda8a1c55aa2ca60af4a6c275842c6572436b4","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-09T20:13:11.965758Z","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:dda0626eeaa6f7ea11cc8f6481e97c5834f46fdb5546e7824a01a6c73aa15e7e","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-09T20:13:11.965758Z","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:48d5f70bbee07faaa98c25821d34e3a62c8df58bed8693cc9226706978e2b039","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-09T20:13:11.965758Z","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:fea69d04cc4149234ce1ff3eafdef7a23cd1249f009c5c6fea7c40a94d59c5ab","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-09T20:13:11.965758Z","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:fcb7c37f41355f2bb7aed9a3fc65047276945426a1005eea6c16ed260f00d6ac","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-09T20:13:11.965758Z","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:7e1fd32aa6327873dc229ba6b08e458b037d296ba2ad96aa52aa8104544ee897","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-08-12T16:14:21.180583Z","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-09T20:13:11.965758Z","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:f44d4664166d06e344b37b16214cf1b9e9d5d8c39365ac04bb30f8fb6da0eb8e","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-09T20:13:11.965758Z","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:4f92bb7031bd012c5117543e1e2f7e5818421cac2f1ee9bc37ddee4de17a4c89","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07072","last_updated":"2025-03-10T08:55:52Z","snapshot_observed_at":"2026-08-10T10:17:21.350473Z","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-09T20:13:11.965758Z","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:7f6b45709f9fdb6f9c5dcb15729eed9bd3e0468ec4e4625df97b31d96a6f8411","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":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-09T20:13:11.965758Z","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:61c0328ed89ea138dd589f32f73e0712c6ba1d64d8bfcec23f4b8e78354d464c","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-09T20:13:11.965758Z","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:ade6f6615c063e6179517bb7b0f405d800799046fa056efb529437dd0d8bdc4e","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-09T20:13:11.965758Z","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:b6541fa02f3bdef79d998fdea3d9380f989f7c99edcfd22738bed8f3cbd86056","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-09T20:13:11.965758Z","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:117d71bba5f8ddab386e7f35e1a7dd3b91f66492b2bbf7879a134f43613f75d7","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-09T20:13:11.965758Z","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:f9b886ba1faf997a0bfa7678240e627f87219ef1d2e3959c364daa2c468f1162","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-08-12T12:02:01.130322Z","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-09T20:13:11.965758Z","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:e234da023c8dac395f43df48f66164539d850c05c9e5aa8ab849a9fb593b2e92","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":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-09T20:13:11.965758Z","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:289ec884be8c3a7961f3fb9f3e22edd5ccad70f01642a0402c9513b1f305dc3e","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-09T20:13:11.965758Z","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:f42deb7967f628ac26ecf09f694d4752ecc6e41f6efc0c8a1b6d7d986a9f98d9","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-09T20:13:11.965758Z","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:3a2a5b63cea2311e7020b8c0b5088dcc8e3a4d42aa6fc44ad0bb764bcd6a3936","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-09T20:13:11.965758Z","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:76b6c0e9d6c09b5e254178d27b7d2f42c904710adde4551ccad4140236e54950","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-09T20:13:11.965758Z","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:29338ce178230fce13da888c7e510aeddcdab38a6c0ab93bc853286c5a713d22","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-09T20:13:11.965758Z","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:7315845309be3ee46f9e99d70edc8457e15db5af5d9b28512bffb9d063759bf3","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-09T20:13:11.965758Z","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:239d3cad4d25d8ef971db0b657ee258c4e13fd61f4e771f1e6b5ce6f9001d3a4","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-09T20:13:11.965758Z","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:0a7568ec0cef2c50701df15ad145721eb4ce6ea9175f85eb8f561d32d1c51e90","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-09T20:13:11.965758Z","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:ed9ee396cd7308befbffcbdefaf03f23f174c1a26fd7b0dfb739b1a40a5edd5b","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-09T20:13:11.965758Z","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:c3acb4c18d0af174a5e1f023a1bfb52460767419122a1c1aa1600f0ee6ca3d4e","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-09T20:13:11.965758Z","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:47f8e901ed8fecca2d7fb2c112bffc2c0ea0d7c87a6abb9bea57e0fbed6511aa","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-09T20:13:11.965758Z","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:be76e2f2fa43b511290ea988f10a3d41ac234042eccce780d5e64b720966fdd4","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-09T20:13:11.965758Z","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:202d4e9bf59509f294cfa4396a4acadc2f0a7ec3ff87a27c5694beb61e575449","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-09T20:13:11.965758Z","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:2f248ceaa86f7b88501924abe33e7062769f50921d91f3e9de19653b912a6653","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-09T20:13:11.965758Z","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:800acd228aa72e1c2adaf9f41853d4ada86ad894c46a1fa492d6e19f5be196be","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-09T20:13:11.965758Z","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:2ff7f739fa8af52eb78ffc36bb1a74f0454eee9aa09893a7285c4c1264432e8e","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-09T20:13:11.965758Z","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:e5bc8f3f96778eff3a20c887f585d6da32b69da80561835cd671893382e1e2b3","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-09T20:13:11.965758Z","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:95e487ab9367ffcdfcca2d6a267b85c430b83a4ec2343bfc08be21f95c82f3e3","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-09T20:13:11.965758Z","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:db9402f9d7ff67b76c5cb7872bf15a60aa4ccc31a4a2de339838e8d09e285eaf","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-09T20:13:11.965758Z","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:d6c396b53eff890887815e9ad13b9c84f6704055a76139b2e81286d489257718","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-09T20:13:11.965758Z","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:b9e3474de1377a60202d1bc352d6f4a86f69db6922a1c37046a56efeed616233","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-09T20:13:11.965758Z","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:0f4dc02c7b45560f157a6a12e730583d2b0051f45a80dd72b8801e47f82f9a00","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-09T20:13:11.965758Z","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:417abdc270a69bdbd62237f0838d014e8d8b32e6454ada22d5965988ae65c404","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-09T20:13:11.965758Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 216 outbound references and 10 inbound Pith citation observations for arXiv:2506.03418."}