{"as_of":"2026-08-08T09:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1591ec30dac8907537882b4742b5c85ac0631113ca34e50535f3983fd37c6b00","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:07:21.092637Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.00878/citation-record","integrity":"/paper/2506.00878/integrity","json":"/paper/2506.00878/citation-record.json","paper":"/paper/2506.00878"},"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:07:24.495851Z","title":null,"venue":null,"work_id":"a6ff95d3-804b-435b-935f-758a1d919509","year":2008},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.122903Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:77131e6c5ce5f455d0e95f1b74483ee06280fccbe198ea3545dd66bb4ff45202","observation_id":"804d54a0-1c09-4aa0-a0d6-93dba24c4641","resolution":{"observed_at":"2026-08-07T12:07:24.548672Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:24.329248Z","title":"Zhang and G","venue":null,"work_id":"2f160e78-99a3-4c9e-b75a-27ad6fc0f2a3","year":2013},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.191217Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:40d200c301fc00dfebdcf12636e7083192f93322074a3dcf38c0a5cbc67198c0","observation_id":"77ea6299-bfc2-4f0f-965c-17677cb62890","resolution":{"observed_at":"2026-08-07T12:07:24.392278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:24.177636Z","title":"Angelini, M.A","venue":null,"work_id":"7a9bcbfc-1a29-4bc1-848d-a3ec08bc0044","year":2018},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.288863Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:463aa346a8ed964d8ac5c2fb1fd7f128648925ab00da48c1b96a471af45b213e","observation_id":"a9395929-bc60-4b96-b39c-9e37e616cc44","resolution":{"observed_at":"2026-08-07T12:07:24.256950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:23.993004Z","title":"Bodendiek, H","venue":null,"work_id":"fdd6df36-dc3c-4ccb-b9b4-d1e35c6a1a9b","year":1984},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.373368Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:a371aef75bae2a2c84ba7de144667aff8979bb5a187f2288b0da2be91c582048","observation_id":"f8204a79-bb0b-4f60-b70a-0887ecab3957","resolution":{"observed_at":"2026-08-07T12:07:24.088406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:23.807000Z","title":"Fabrici and T","venue":null,"work_id":"fc00c7d6-249d-4239-bca2-2a29a55c0d0f","year":2007},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.465744Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:b5bb068727f15b0d65a19e98f1417165cfe61dd1b472622af7a796cea6b477e9","observation_id":"c729ee01-1f1c-4d1d-ac99-b29a6a13f78a","resolution":{"observed_at":"2026-08-07T12:07:23.871667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:23.592282Z","title":"Pach and G","venue":null,"work_id":"3f6217b4-a1e7-4bd8-81cc-53ac432c4ebb","year":1997},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.554228Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:3ba9f4980ea153501537258ca09160067dc43c5b4c2f67e2de1f0124b4e37773","observation_id":"e7ab22a9-2e5f-4f91-ab43-1fcc9d5212e7","resolution":{"observed_at":"2026-08-07T12:07:23.696088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:23.457713Z","title":null,"venue":null,"work_id":"936cc3c3-0e82-492a-9a55-93cf3571e14a","year":2013},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.642714Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:5fccf53f31817d518f180fda118cb0c7d1f6db01f8b8a351ebdd01fb457a1298","observation_id":"ac34a594-5641-4e36-8d0e-5b7d1229dc9a","resolution":{"observed_at":"2026-08-07T12:07:23.520066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:23.297828Z","title":null,"venue":null,"work_id":"597973ed-2cdc-4636-b7b9-6836e0f0df82","year":2018},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.736282Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:82e8293e8862a7970afead6f839a1efae834d3d23d0beb71b993f20e7d75a34b","observation_id":"b31fe85a-5b33-447c-abe7-d81076d37104","resolution":{"observed_at":"2026-08-07T12:07:23.384190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:23.152895Z","title":null,"venue":null,"work_id":"f12bcd5c-e516-4f09-a66c-a5cabfdd459c","year":2016},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.847736Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:142336c8461a8350c18550f153d136e7d812577024504fed932e413234122ae2","observation_id":"2c00692d-b7df-405c-aeef-283ab9b19e22","resolution":{"observed_at":"2026-08-07T12:07:23.217992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:22.998542Z","title":"Barát and G","venue":null,"work_id":"18b9b323-3828-476f-9ab4-24bd5847139e","year":2018},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:19.945358Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:9bc489e6f627c8becac777369b1324df3d0c049ad56a3d08fecfba2ae4091c12","observation_id":"63838b00-c996-476d-9e0c-00a4a1dd57e0","resolution":{"observed_at":"2026-08-07T12:07:23.071074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:22.837131Z","title":null,"venue":null,"work_id":"ee6122d9-58df-4ec0-b4bd-0e0a24297319","year":2014},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.026570Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:d01e2c359dc9769135e33dc86d37ce0f6b839747dc2d4f53e4f9473f0a92e229","observation_id":"504b823a-4169-481a-b231-a3ee8c6ba5b4","resolution":{"observed_at":"2026-08-07T12:07:22.898408Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:22.641304Z","title":"Bachmaier, F","venue":null,"work_id":"8e8519a8-dc6e-4397-8f3c-d79ff8078dea","year":2017},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.157332Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:c603ab72dd51f1fd1224e00ccc6b244f5610b509160aa5dbec4a4bff86a15938","observation_id":"bd9d6e2a-683f-45cc-b104-ab138fd385eb","resolution":{"observed_at":"2026-08-07T12:07:22.741030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.16085","last_updated":"2024-08-28T18:28:23Z","snapshot_observed_at":"2026-08-07T22:24:10.140583Z","submitted_at":"2024-08-28T18:28:23Z","title":"On $k$-planar Graphs without Short Cycles","version":1},"cited_work":{"arxiv_id":"2408.16085","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.16085","snapshot_observed_at":"2026-08-07T12:07:21.622139Z","title":"On $k$-planar Graphs without Short Cycles","venue":"math.CO","work_id":"dffae46d-d286-42e4-8310-30b62c748f30","year":2024},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.249495Z"},"links":{"cited_paper":"/paper/2408.16085","citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:f00a4288c0431ebd6bb125420854eb8eb521b1a20d029659c0367a19f15b19f7","observation_id":"e4b89eb6-9d12-4a95-bcc6-d52f1aad9c15","resolution":{"observed_at":"2026-08-07T12:07:21.727731Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:22.448587Z","title":null,"venue":null,"work_id":"e354e978-5fe8-4d59-82a7-d9c6e060c3d7","year":2021},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.338983Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:3294eb14d548ec71c2582e4291c44b030349e23e405d4643259c0f3315d5fc08","observation_id":"cf749b5a-49ff-49d7-8e8f-e7b76e1867b3","resolution":{"observed_at":"2026-08-07T12:07:22.553161Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08726","last_updated":"2023-03-15T16:11:55Z","snapshot_observed_at":"2026-07-06T15:03:48.321032Z","submitted_at":"2023-03-15T16:11:55Z","title":"The Number of Edges in Maximal 2-planar Graphs","version":1},"cited_work":{"arxiv_id":"2303.08726","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.08726","snapshot_observed_at":"2026-08-07T12:07:21.487023Z","title":"The Number of Edges in Maximal 2-planar Graphs","venue":"math.CO","work_id":"6ebd4f3c-1ab3-45cb-a3fe-4e680131f6ed","year":2023},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.453908Z"},"links":{"cited_paper":"/paper/2303.08726","citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:cea1665c47e34a759191efd84304f06877ee230248d9898d9731575dc9233b82","observation_id":"247e4006-5ba0-4786-ad25-7f3355ce2813","resolution":{"observed_at":"2026-08-07T12:07:21.554279Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11696","last_updated":"2025-02-17T11:34:22Z","snapshot_observed_at":"2026-08-07T18:12:51.093040Z","submitted_at":"2025-02-17T11:34:22Z","title":"Determining the minimum size of maximal 1-plane graphs","version":1},"cited_work":{"arxiv_id":"2502.11696","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.11696","snapshot_observed_at":"2026-08-07T12:07:21.316213Z","title":"Determining the minimum size of maximal 1-plane graphs","venue":"math.CO","work_id":"45548801-4538-4b79-ada8-426765c717dd","year":2025},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.561577Z"},"links":{"cited_paper":"/paper/2502.11696","citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:8a704c1f7c7f88e12153ed2076bce93c0b166527c5e035acb2331e03eb7f1cb0","observation_id":"5096b455-ce23-41d9-aa4a-4d7f77e55a75","resolution":{"observed_at":"2026-08-07T12:07:21.399777Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:22.286841Z","title":null,"venue":null,"work_id":"deee5076-8208-4c29-9713-d2e66abdfec4","year":null},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.658143Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:a6a4962e9bc60ff564b2a01d3ac2c351ff69ecde3722d6c7f9b5e96610c1b52b","observation_id":"cb8636c1-d148-48f5-9de4-4f75ba835834","resolution":{"observed_at":"2026-08-07T12:07:22.380289Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21558","last_updated":"2025-04-30T11:57:00Z","snapshot_observed_at":"2026-08-07T15:57:57.321203Z","submitted_at":"2025-04-30T11:57:00Z","title":"The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity","version":1},"cited_work":{"arxiv_id":"2504.21558","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.21558","snapshot_observed_at":"2026-08-07T12:07:21.183019Z","title":"The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity","venue":"math.CO","work_id":"4166a93c-90db-4652-b2c2-fa7f38953257","year":2025},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.791747Z"},"links":{"cited_paper":"/paper/2504.21558","citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:770c5766ce95b70fd458cd07cef170b3e00b0fdd3790954518a69c3431e71daa","observation_id":"7772579c-c5b1-4521-95ec-760ba4baf8be","resolution":{"observed_at":"2026-08-07T12:07:21.248695Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:22.124703Z","title":null,"venue":null,"work_id":"f532f167-ea3a-4ca2-9409-6ab99bc57672","year":2016},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.893039Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:06367f4e57698292a0ccda9d2fa038308de0e6ed0da0c67374d3d1908fda39e8","observation_id":"edc849e8-cf1c-4d10-b7c6-84867f638535","resolution":{"observed_at":"2026-08-07T12:07:22.163178Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:21.974621Z","title":"Král’ and L","venue":null,"work_id":"ba9616d9-ad45-4eab-a0ff-ef71e4d106b0","year":2010},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.999303Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:c8dbad7e310697a62dbb4aeb5244daec46ff08d2d6cdba21b16c992ac843a6ad","observation_id":"43a62d12-ab28-44f0-b7dd-96c61a20cfd7","resolution":{"observed_at":"2026-08-07T12:07:22.047578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:21.792142Z","title":"Thus, graph Gk[(V (Ci−1)∪ V (Ci)∪ V (Ci+1))\\ S] is connected","venue":null,"work_id":"9367147e-122f-4577-b1a4-ca5f903fe283","year":null},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:21.092637Z"},"links":{"citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:c2b9c7baa5b0ddaee3ec067c1d0bc13151539b48d2253c1efd9f29b860a5015a","observation_id":"dd6f09b5-c415-4213-ae4d-80f5e0e1781b","resolution":{"observed_at":"2026-08-07T12:07:21.868717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T11:53:30.859465Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":4,"verified_fuzzy":9},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2506.00878."}