{"as_of":"2026-08-13T16:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e06e4d64ab7a6a205e5acda084ff7853ef52e8bd533bd8bcaae08e1d9200e55","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:42:16.874080Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2505.24490/citation-record","integrity":"/paper/2505.24490/integrity","json":"/paper/2505.24490/citation-record.json","paper":"/paper/2505.24490"},"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-07T12:42:20.107374Z","title":null,"venue":null,"work_id":"5fdd1276-aeb0-4ea5-96c3-2d0f61c07d27","year":2019},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:14.966837Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:03cd8197cf92b89c5933186645267747c9b56656b8ea60ba0937d1caff77cee1","observation_id":"aca55dab-2380-4699-b0e0-486fdc7625a1","resolution":{"observed_at":"2026-08-07T12:42:20.111455Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:19.929747Z","title":"In: SoCG","venue":null,"work_id":"76a45cf2-b15d-4bd1-bfb4-0cb845052827","year":2022},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.036457Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:cb9541c9c6126481c674879c7cd653d7eaffede5e2795828ff82c72f8c247523","observation_id":"53d9cbd4-37dc-44cd-8dcf-856c855b93b4","resolution":{"observed_at":"2026-08-07T12:42:20.015812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:19.727811Z","title":null,"venue":null,"work_id":"afcd8c54-9031-4623-8fa7-4cf9b3cf93f3","year":2024},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.129705Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:2645e7004a023a21a6f7ba07d1d7463ef6a445d5e77044d1fb11d143d7e3e8d0","observation_id":"c58b8d98-a37b-439a-b953-11866543977c","resolution":{"observed_at":"2026-08-07T12:42:19.817173Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:19.604275Z","title":"In: IWOCA","venue":null,"work_id":"ae91b877-4d13-44f9-a844-6dbb220c08bc","year":2024},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.254756Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:9a22357b87719922d828b050eb0a8146a94dd2e14d9e6b8a7ae3d66d70b4f120","observation_id":"eaa1dfbf-78c6-4a9c-84a2-a7fb970e8fbe","resolution":{"observed_at":"2026-08-07T12:42:19.670579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:15.330471Z","title":"Algorithmica 74(4), 1293--1320 (2016), https://doi.org/10.1007/s00453-015-0002-1","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.330471Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:680279e798aa74fb5fc37d595a420f6cb0088aca8563a4b79cd6c4378830c352","observation_id":"fdc0b6e9-f50c-4d2e-ac70-44d829fac801","resolution":{"observed_at":"2026-08-07T12:42:15.330471Z","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-07T12:42:19.447460Z","title":null,"venue":null,"work_id":"b79033ee-b8e4-4ad2-b206-dad30face977","year":2016},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.371126Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:3ea62b17f469698573644252a457f5412562643e2283beadce4ed7b5979595ff","observation_id":"e6ef0204-9963-4050-a5fd-73ce04f6809f","resolution":{"observed_at":"2026-08-07T12:42:19.519650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:19.305766Z","title":"In: SoCG","venue":null,"work_id":"dfde248f-f015-4f54-9b6c-dc4c6307d7d6","year":2017},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.453499Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:e6f52bc01738d91fe28b471ccf241dbc387675d707a979dbeb3c4a246aadc6a0","observation_id":"161ec183-c39f-4118-8123-fc02f28907e9","resolution":{"observed_at":"2026-08-07T12:42:19.382544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:19.184195Z","title":null,"venue":null,"work_id":"b494946b-5a2b-4cf1-a077-6ade847dbd4d","year":2024},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.531211Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:ae462c45254dfa896ef1e84e60a43be5e45e0e0c23332b7c4db75b1c13e65700","observation_id":"88d2437e-54a7-4caf-b6c8-c410c4693426","resolution":{"observed_at":"2026-08-07T12:42:19.239490Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:19.000832Z","title":"u ngener, A., Kaufmann, M.: Improving the crossing lemma by characterizing dense 2-planar and 3-planar graphs. In: GD. Schloss Dagstuhl – Leibniz-Zentrum f\\","venue":null,"work_id":"55df5301-3241-4b60-a4b0-65315c339d68","year":2024},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.627959Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:bbd18c351edba14ff05614297f57fe6e20d6893d842ae8dfd3fef7ceed8038c3","observation_id":"5d3dcb34-eecc-43c8-9f01-efc80c34808b","resolution":{"observed_at":"2026-08-07T12:42:19.111781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:18.897817Z","title":null,"venue":null,"work_id":"bd10f7a0-21f8-4984-b813-a3c7d7346763","year":2024},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.701783Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:f98dbf33b97c7b15374901f2b95ea916efde19b1212047f697cb1f928a2c8805","observation_id":"5aa92775-aa10-4eed-bf2c-c3462a0980d3","resolution":{"observed_at":"2026-08-07T12:42:18.936201Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:15.767339Z","title":"Journal of Combinatorial Theory, Series B 56(1), 9--15 (1992), https://www.sciencedirect.com/science/article/pii/009589569290003G","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.767339Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:4ba1a23fa38d8755ad3f56dfc2e6742de7213787ec59fb61c6d3f3c2997fbc64","observation_id":"0798c802-3dc9-4c75-b7e2-ba32ad343f0b","resolution":{"observed_at":"2026-08-07T12:42:15.767339Z","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-07T12:42:18.773747Z","title":"In: International Symposium on Graph Drawing and Network Visualization","venue":null,"work_id":"7c9a7edb-b1ca-4100-8ca3-69dcdf967699","year":2017},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.846570Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:5b14ad7f605f640306b24fd2e3b66477cc77a1547b84af4d2aeb1d8a80d0089a","observation_id":"0b051a83-d6c4-4c75-817d-7cbf101e85f6","resolution":{"observed_at":"2026-08-07T12:42:18.834327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.08723","last_updated":"2026-05-31T15:55:24Z","snapshot_observed_at":"2026-08-13T08:03:24.908794Z","submitted_at":"2017-08-29T12:26:43Z","title":"Beyond Outerplanarity","version":4},"cited_work":{"arxiv_id":"1708.08723","doi":null,"metadata_source":"pith","pith_arxiv_id":"1708.08723","snapshot_observed_at":"2026-08-07T12:42:17.391808Z","title":"Beyond Outerplanarity","venue":"cs.DM","work_id":"55077313-a3ad-4942-a463-d6975d8832a2","year":2017},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.913980Z"},"links":{"cited_paper":"/paper/1708.08723","citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:ad1860ef3f3e7b9de4cc63bc1b607555189d5884af652b52d85e7ae5db9c9f71","observation_id":"1a67351a-eb50-4e5f-9900-d549b2761bbf","resolution":{"observed_at":"2026-08-07T12:42:17.442338Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:18.673933Z","title":"In: STOC","venue":null,"work_id":"0c20904b-a8a9-4adb-87f0-554d376bf9f1","year":2005},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:15.983315Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:0bb7ae1d3976580d3e4015f49e272e58c5db5fb2a0514f6017971d0a57359f25","observation_id":"0122d06c-2b32-495d-8705-0747c2f6fa7f","resolution":{"observed_at":"2026-08-07T12:42:18.718963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:16.049689Z","title":"Foundations and Trends® in Communications and Information Theory 2(3), 155--239 (2006), http://dx.doi.org/10.1561/0100000006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.049689Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:44a0ed951ad3120be64c80ec1b70186782cea67e0373894abeab087d5e801a50","observation_id":"07a2325b-73cd-431e-bfbc-fbfdc8d2a56b","resolution":{"observed_at":"2026-08-07T12:42:16.049689Z","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":"users/1018325","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:17.222716Z","title":"prove that one of them intersects at least 10000 others","venue":null,"work_id":"c393effc-7fd5-4aca-b884-ab54a727206e","year":2023},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.117300Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:4b1ebd0861dc5c72a3ca7ee1bbaee5b04ee7f7cd9532df65aa586541c76c5ea4","observation_id":"9f94a569-b991-4e06-8a81-60f9709ab468","resolution":{"observed_at":"2026-08-07T12:42:17.328811Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:18.552759Z","title":null,"venue":null,"work_id":"c11f1f74-037d-4d93-adb4-74adf77daeb9","year":2004},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.198794Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:88f034f5a41d9e9c46161d62b98ea52650622c566e003d68349c65a300e1d6be","observation_id":"9f3181e4-139c-4712-9397-724992101bbb","resolution":{"observed_at":"2026-08-07T12:42:18.616984Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:18.453374Z","title":null,"venue":null,"work_id":"3efffe34-15da-44f3-b6fd-6d007b34332c","year":null},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.266372Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:84c28b3f72028cb4e2c6f9ccad50fc46ed60b30d280a330f7b341a6ac1044282","observation_id":"1ab07a82-e42c-4c6c-8b9a-c26fd0bd64f8","resolution":{"observed_at":"2026-08-07T12:42:18.491110Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:18.363487Z","title":"Czechoslovak Mathematical Journal 40(2), 343--352 (1990), http://eudml.org/doc/13856","venue":null,"work_id":"4ac8bc52-2861-42d2-abab-811da17815b6","year":1990},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.344226Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:2251ca553de6fa5c6a0eb0b1bbd340a35a00a3d1737a226486c0197ea06adbcb","observation_id":"9fcfdca5-36ce-4e4a-b9fa-bca2a458bd19","resolution":{"observed_at":"2026-08-07T12:42:18.422521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:18.242792Z","title":null,"venue":null,"work_id":"db02032c-bb38-4fbc-bc20-b685f2e07aae","year":1997},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.458141Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:ff7eb4109c08cd6b9f327ac0d3ec68a62f6dbe8784d836102d1d0110888fd4be","observation_id":"bdd27ff4-84f5-441e-bb35-68f4eb3a0f19","resolution":{"observed_at":"2026-08-07T12:42:18.301617Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:17.935987Z","title":null,"venue":null,"work_id":"97b538e1-5724-4b9d-b37a-22fffb4fc16a","year":2023},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.549174Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:473e5e112c272ecf39fb97b875ab1cef04f07259c351f68dfc30d384365326e1","observation_id":"e9512764-6c45-49de-b466-e2ef9131c40f","resolution":{"observed_at":"2026-08-07T12:42:18.146822Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:17.668197Z","title":null,"venue":null,"work_id":"4a828930-f5e5-4dc8-8a6a-e9bab41d8f53","year":1997},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.631720Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:e3651459ede19a4acf2456d0e4c4a803b3f7fb855449a789dcd6a637bdd2910c","observation_id":"37a55101-822e-4525-9432-4b9b8a0319af","resolution":{"observed_at":"2026-08-07T12:42:17.766902Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.00131","last_updated":"2024-05-17T02:27:50Z","snapshot_observed_at":"2026-08-09T00:15:28.706151Z","submitted_at":"2016-07-01T07:21:40Z","title":"Book crossing numbers of the complete graph and small local convex crossing numbers","version":3},"cited_work":{"arxiv_id":"1607.00131","doi":null,"metadata_source":"pith","pith_arxiv_id":"1607.00131","snapshot_observed_at":"2026-08-07T12:42:17.016019Z","title":"Book crossing numbers of the complete graph and small local convex crossing numbers","venue":"math.CO","work_id":"5ba9be68-2aa5-4faa-975f-b30644b7d972","year":2016},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.725724Z"},"links":{"cited_paper":"/paper/1607.00131","citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:518ce78a5fe3036459bc849b372b3a747cd917d8702369d1b32a96d45731acfe","observation_id":"a768c78f-9087-4904-b1ab-bf336f79a283","resolution":{"observed_at":"2026-08-07T12:42:17.058487Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:16.800417Z","title":", \" * write output.state after.block = add.period write","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.800417Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:3763cb9ef2f6cfffc60941c7457c742886e6cefcde3d42dc97bbe9a5c12c6ec4","observation_id":"146a6869-167b-49f1-a5b5-9ab6baab2bd5","resolution":{"observed_at":"2026-08-07T12:42:16.800417Z","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-07T12:42:16.874080Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:42:16.874080Z"},"links":{"citing_paper":"/paper/2505.24490"},"observation_digest":"sha256:e42cdc06723ef70271292312d9cae70f86a2b62e8c423782f6e0431df3d2ca2b","observation_id":"113e429a-abb9-4c81-8f48-9bfea65f65fd","resolution":{"observed_at":"2026-08-07T12:42:16.874080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.24490","last_updated":"2025-05-30T11:43:14Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-11T19:18:15.535650Z","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":15,"verified_exact":2,"verified_fuzzy":7},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2505.24490."}