{"as_of":"2026-08-16T17:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25d63e15b0376e8585b04ff81536241958f0abc5b1ac99d02679b5a3e5e9840d","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:35:03.528168Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.03189/citation-record","integrity":"/paper/1908.03189/integrity","json":"/paper/1908.03189/citation-record.json","paper":"/paper/1908.03189"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.729588Z","title":null,"venue":null,"work_id":"63923f73-527b-4aec-9124-66a374be34db","year":2003},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.466787Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:6d0a6c6273bae6a14450234b0d20bafafc5fc8624e3c4918edaca47041b35fc7","observation_id":"cf29a21f-3f7e-4e22-9693-0ea098f55c33","resolution":{"observed_at":"2026-08-14T14:35:03.732811Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.721858Z","title":null,"venue":null,"work_id":"50c900b9-3fa3-41d5-a177-b7ff7127bb4c","year":1999},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.470343Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:ea56801bf514e00cea2c62881d4a5333b093115a9607cd1deab8130eb1e0b32d","observation_id":"c2bd0879-d51c-42ca-aced-c70c394741a7","resolution":{"observed_at":"2026-08-14T14:35:03.724478Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.713682Z","title":null,"venue":null,"work_id":"3c4782aa-59da-4a32-9ef1-f6a12768b0ea","year":1966},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.473410Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:e23a7e57e406fc2dda51a7391546c9ea068cd004069e0c03dceb2eaf20c55cb5","observation_id":"7281ce42-28d1-4cde-85d5-a165c9a4f336","resolution":{"observed_at":"2026-08-14T14:35:03.716429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.704975Z","title":null,"venue":null,"work_id":"023c2a9a-8811-4ef0-af5c-38939093d55e","year":1974},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.476286Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:35405ecc53f46a12969798faddd3a62bf3405fafc7976743d602c604a73406ee","observation_id":"63ae9701-3dca-4257-9031-6cd16e3c1115","resolution":{"observed_at":"2026-08-14T14:35:03.707739Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.05008","last_updated":"2019-02-08T22:35:33Z","snapshot_observed_at":"2026-08-16T04:13:05.321594Z","submitted_at":"2018-07-13T11:10:47Z","title":"On the extremal number of subdivisions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.05008","snapshot_observed_at":"2026-08-14T14:35:03.479895Z","title":"Conlon, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.479895Z"},"links":{"cited_paper":"/paper/1807.05008","citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:a0fc3c0444db0261a2418a6a184094bf08f8f29dcbffa68662095295f61599e7","observation_id":"4c5fd05c-1a8a-47f9-ab94-173ec0a196c6","resolution":{"observed_at":"2026-08-14T14:35:03.479895Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.697055Z","title":"Davenport, A","venue":null,"work_id":"55d3b28d-bf47-4f2c-b6c5-bafe7e81530f","year":1965},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.483885Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:0e0056d5f70c965b3265e670e9d760a4d5be3b72f63e581b2b9358deb43cd4bd","observation_id":"853d8703-3e57-4f70-bc9e-6ac5a554439b","resolution":{"observed_at":"2026-08-14T14:35:03.699780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.688645Z","title":"Erd˝ os, On extremal problems of graphs and generalized graphs, Israel J","venue":null,"work_id":"3e25e96b-8a2b-4cc3-abec-de8e2ec16b93","year":1964},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.487423Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:0e295189325550f76f32ee02ba7bdc2c7af031856e024338977980a5f1689183","observation_id":"cbefcdaf-c7bf-4bd3-86e5-0caacccbaa3e","resolution":{"observed_at":"2026-08-14T14:35:03.691663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.679866Z","title":"Erd˝ os, A","venue":null,"work_id":"c4ef9634-8f6e-4b25-9310-fd74086b50d0","year":1946},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.490604Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:e78814a7de4bcc5cdf3a931c571368c0fa22a61566d31b639e3046addb910ea7","observation_id":"116b0168-c456-44f0-b247-b42c331802e2","resolution":{"observed_at":"2026-08-14T14:35:03.683180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.669916Z","title":"F¨ uredi,On a Tur´ an type problem of Erd˝ os.Combinatorica, 11 (1) (1991): 75–79","venue":null,"work_id":"aa5d6007-e1a1-496d-8cca-5132466bf1c9","year":1991},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.493774Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:8a6d00345c244f06a43f670b11c26c10e25bb277b70fc69467428760372c5f3a","observation_id":"573d777b-23d9-44b8-8408-92bd4823a245","resolution":{"observed_at":"2026-08-14T14:35:03.673584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.660404Z","title":"F¨ uredi, P","venue":null,"work_id":"97653993-f840-415f-b923-d43430112806","year":1992},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.496853Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:9b7c09212fe3cb205ee43ac6407b9912248e56c93b9d7bd3fedad3226e0e0a8e","observation_id":"f2886a8a-98f3-4c6e-b9e7-9bd10f64daf6","resolution":{"observed_at":"2026-08-14T14:35:03.663597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.03342","last_updated":"2020-04-09T20:09:35Z","snapshot_observed_at":"2026-08-14T16:18:58.284149Z","submitted_at":"2019-06-07T21:57:21Z","title":"Partitioning ordered hypergraphs","version":2},"cited_work":{"arxiv_id":"1906.03342","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.03342","snapshot_observed_at":"2026-08-14T14:35:03.577508Z","title":"Partitioning ordered hypergraphs","venue":"math.CO","work_id":"c4144eb1-2de3-456c-9590-5c6b65ffc39a","year":2019},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.500019Z"},"links":{"cited_paper":"/paper/1906.03342","citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:05b07af845186febd92593da35951e6bf8527101cdcb05ef103da252e833854e","observation_id":"dc24bf9a-118f-4ab7-8fcd-0746bd780c7c","resolution":{"observed_at":"2026-08-14T14:35:03.580484Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07219","last_updated":"2019-04-15T17:54:30Z","snapshot_observed_at":"2026-08-14T16:46:15.845206Z","submitted_at":"2019-04-15T17:54:30Z","title":"The Tur\\'an number of blow-ups of trees","version":1},"cited_work":{"arxiv_id":"1904.07219","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.07219","snapshot_observed_at":"2026-08-14T14:35:03.563963Z","title":"The Tur\\'an number of blow-ups of trees","venue":"math.CO","work_id":"e7d12fc9-0247-408b-99ff-95191ad71a22","year":2019},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.503382Z"},"links":{"cited_paper":"/paper/1904.07219","citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:49ca638232fa218a801e863c31a8e24c09d18972bec7526a2ee24f2c5caade2c","observation_id":"0595ad2e-d719-4d40-8d8b-5ba6bcf281d4","resolution":{"observed_at":"2026-08-14T14:35:03.568528Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.651257Z","title":"Gy˝ ori, D","venue":null,"work_id":"5450f6b0-a326-4ed3-ac95-418864f6a015","year":2018},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.507480Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:a02a8c4f9412d812ed2e20c2bc449610c98959c5ac170c1622af63de7ef3f7bc","observation_id":"9055eaa8-565c-46e6-8408-1d8d5028e30b","resolution":{"observed_at":"2026-08-14T14:35:03.654433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.00468","last_updated":"2018-09-03T07:07:15Z","snapshot_observed_at":"2026-08-14T18:33:52.638923Z","submitted_at":"2018-09-03T07:07:15Z","title":"Improved bounds for the extremal number of subdivisions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.00468","snapshot_observed_at":"2026-08-14T14:35:03.510504Z","title":"Janzer, Improved bounds for the extremal number of subdivisions, arXiv preprint (2018), arXiv:1809.00468","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.510504Z"},"links":{"cited_paper":"/paper/1809.00468","citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:6a8534b71f10272dac6751a7b2613bd8cf2179ad6e646204dba444872f370edc","observation_id":"0bcc1824-4701-46c5-8189-b5b63f0f6f7e","resolution":{"observed_at":"2026-08-14T14:35:03.510504Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.641525Z","title":"Kor´ andi, G","venue":null,"work_id":"de72b06e-7f60-4df1-9443-18794495aa31","year":2019},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.514085Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:f5ad7cfab8cfb332abe577391df2d45621b351ee9c41095bb78ee64892c561e0","observation_id":"8f1240a3-bec4-497f-b61b-a3d634a6ed89","resolution":{"observed_at":"2026-08-14T14:35:03.645051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.631816Z","title":null,"venue":null,"work_id":"016c00a3-7dce-4f41-9992-0ad345e6fd3e","year":2006},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.517174Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:d138e0dfbd2f2968f9a1ff8cc7b9875587fd1931027cbc06e368bca0fab08d97","observation_id":"4ee21cbf-2456-4aa2-aa71-4df2b445edcc","resolution":{"observed_at":"2026-08-14T14:35:03.634940Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.622474Z","title":"K˝ ov´ ari, V","venue":null,"work_id":"e9abe574-afb1-4fc1-85c6-336f47860c5d","year":1954},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.520221Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:c6273c7c9713c6780eb12bb08a4b49492fdc3985094e725c073aa1f29cc2d501","observation_id":"1829ba87-6f3e-4a1a-a7a5-90cb7464ef02","resolution":{"observed_at":"2026-08-14T14:35:03.625616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.612701Z","title":"Marcus, G","venue":null,"work_id":"ffca8c98-8ece-4d53-9a33-548579dc3631","year":2004},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.523226Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:5364880dfbedc50bb7546f722b3912202f3976831150f460afb9722d04097c5e","observation_id":"cc37cd5f-829d-48f3-81fa-580908bc225c","resolution":{"observed_at":"2026-08-14T14:35:03.616183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.604078Z","title":"Pettie, Degrees of nonlinearity in forbidden 0-1 matrix problems, Discrete Mathematics 311 (2011): 2396-2410","venue":null,"work_id":"de888748-867f-4dc9-9f6f-32d8d51a6b88","year":2011},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.525777Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:514fbc04db8caa69f4676e13cd1612fb14f0d135e4a88b792528eab12ce7f450","observation_id":"8804bbbd-d411-47bb-9036-9e6afc5fd964","resolution":{"observed_at":"2026-08-14T14:35:03.606938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:35:03.595157Z","title":"Tardos, On 0-1 matrices and small excluded submatrices, Journal of Combinatorial Theory, Ser","venue":null,"work_id":"f1eb1ec0-287d-4744-9a8c-ea78dd9e1c00","year":2005},"citing_paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:35:03.528168Z"},"links":{"citing_paper":"/paper/1908.03189"},"observation_digest":"sha256:de21eba2f2fdc5816c33aaebd1b2e5b9f486af9d980722945cd58d3ffecd981b","observation_id":"4c103f46-1f9b-42b9-83a8-dbc5a370d685","resolution":{"observed_at":"2026-08-14T14:35:03.598336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03189","last_updated":"2019-08-08T17:47:58Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T03:37:25.883850Z","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":20},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.03189."}