{"as_of":"2026-08-23T07:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00593b813962c1ea0f84c757ec5d2f0482efafff2804a86e97c74ac496069655","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T11:57:06.123256Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2607.28298/citation-record","integrity":"/paper/2607.28298/integrity","json":"/paper/2607.28298/citation-record.json","paper":"/paper/2607.28298"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.giscience.2021.ii.6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"11th International Conference on Geographic Information Science (GIScience 2021) - Part II , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"f84eb367-dc1a-4bfa-97f7-46d0beb5442e","year":2021},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.106693Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:f4135d1b808f933a27f3d15ce37f83ee77f3a390eeb09d4135d3d6dfc7a152e5","observation_id":"4070acc2-6a4c-4413-8d6c-1638d144e36b","resolution":{"observed_at":"2026-07-31T12:01:28.485770Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.064666+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.064666+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-31T11:57:01.177284Z","title":"and Kim, Chul E","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.177284Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:99ba0c6f44ce6c10bbc3dad8c825424134d2b6d3994f59d7b56c8d2b56dc8800","observation_id":"3fb903b4-ddd2-4b5f-9923-d98ca4d61696","resolution":{"observed_at":"2026-07-31T11:57:01.177284Z","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-07-31T11:57:01.261630Z","title":"Algorithmica , month =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.261630Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:aa4c7c3c566edab298f4f68bed8580530b07e1df109f047ef4bcc96f8d6c8147","observation_id":"e52a25f4-5c66-4c6d-ae29-6e48f1528531","resolution":{"observed_at":"2026-07-31T11:57:01.261630Z","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-07-31T11:57:01.393663Z","title":"and Thomas, R","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.393663Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:a4e3e2383b9a69597bdeffdd68c318c4eeaae08c06ed59a6620ad6b4972f07f2","observation_id":"f2093e76-20ac-4b48-9fae-26b0f77ec45b","resolution":{"observed_at":"2026-07-31T11:57:01.393663Z","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-07-31T11:57:01.488123Z","title":"Hicks , title=","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.488123Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:2e84e4d570aae6cb016586b5368a1e474ac20cb612435576105ba991de807b75","observation_id":"39320b3f-f08e-41e6-b0d4-137058833b96","resolution":{"observed_at":"2026-07-31T11:57:01.488123Z","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-07-31T11:57:01.628425Z","title":"and Kowalik, Lukasz and Lokshtanov, Daniel and Marx, Daniel and Pilipczuk, Marcin and Pilipczuk, Michal and Saurabh, Saket , title =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.628425Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:70a1387e71ff6fb979c75a9ddabde4b060a44992c8c7b1705fdaf5609107d0e5","observation_id":"9b80402f-455b-4b59-840c-e9ca2be8d889","resolution":{"observed_at":"2026-07-31T11:57:01.628425Z","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-07-31T11:57:01.761793Z","title":"Jones and Geraint L1","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.761793Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:c2ba0299c91d0d08f138d460c019a30b1d1174ef1fa60eee3135db5712a1ec6b","observation_id":"54e54aff-7636-42b3-a7ce-335ad53a704e","resolution":{"observed_at":"2026-07-31T11:57:01.761793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07724","last_updated":"2016-11-23T10:23:46Z","snapshot_observed_at":"2026-08-19T00:58:33.309287Z","submitted_at":"2016-11-23T10:23:46Z","title":"Knapsack Problems: A Parameterized Point of View","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07724","snapshot_observed_at":"2026-07-31T11:57:01.844626Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.844626Z"},"links":{"cited_paper":"/paper/1611.07724","citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:8872538be20ae29a08a28320dc639ef1d97b7649d9ef026711b627fce62f300e","observation_id":"25f91312-e9c1-4e69-8ce6-0caff6b29483","resolution":{"observed_at":"2026-07-31T11:57:01.844626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1007.2021","last_updated":"2011-10-06T00:46:31Z","snapshot_observed_at":"2026-08-15T05:14:02.912956Z","submitted_at":"2010-07-13T02:20:45Z","title":"Parameterizing by the Number of Numbers","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1007.2021","snapshot_observed_at":"2026-07-31T11:57:01.922428Z","title":"Fellows and Serge Gaspers and Frances A","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:01.922428Z"},"links":{"cited_paper":"/paper/1007.2021","citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:b957ec27b8d9599c941b62809b53fc9b185b67ccab8bea7c41d90fc1ec5e8497","observation_id":"81d54324-0e28-4b68-a030-67519a3c9e4d","resolution":{"observed_at":"2026-07-31T11:57:01.922428Z","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-07-31T11:57:02.046392Z","title":"2012 , publisher=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.046392Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:b8a1c6e8b3dd3e2147148e1df1ed2ecc62dce439270f4c38a38eb69248115c3f","observation_id":"0308a7d5-ade1-4a0e-8615-886a9e5296da","resolution":{"observed_at":"2026-07-31T11:57:02.046392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1507.03439","last_updated":"2015-07-13T13:15:14Z","snapshot_observed_at":"2026-08-14T22:40:41.438460Z","submitted_at":"2015-07-13T13:15:14Z","title":"Polynomial Kernels for Weighted Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.03439","snapshot_observed_at":"2026-07-31T11:57:02.131485Z","title":"Polynomial Kernels for Weighted Problems , journal =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.131485Z"},"links":{"cited_paper":"/paper/1507.03439","citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:1f7d7388c104f25853160783ca0e5374c3e2b23bde72cb0dc4819f3ec77c8d84","observation_id":"751c10c3-3e28-488e-937b-73c4022c5d09","resolution":{"observed_at":"2026-07-31T11:57:02.131485Z","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-07-31T11:57:02.213664Z","title":"Annals of Operations Research , volume=","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.213664Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:08d7cd2076a37b9459280f9c8bbf6fd6a7520edb4a0dd3c9c82e2698b0f128c0","observation_id":"48994073-db41-4f35-98bf-53a9a3f7ac5d","resolution":{"observed_at":"2026-07-31T11:57:02.213664Z","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-07-31T11:57:02.346961Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.346961Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:4077e1f5476804d15c1a16b090a05592e433db1589e7271894d0d4832b00a29f","observation_id":"2a78ec5a-8817-43f2-8c77-4eb4c3ae2875","resolution":{"observed_at":"2026-07-31T11:57:02.346961Z","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-07-31T11:57:02.395164Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.395164Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:d112e5acf6cc21059229f5da5df6dc0787f53686192a7d9c90b63bd6fe521048","observation_id":"634ee1ac-8ae9-402b-8fca-fe5b946f8d21","resolution":{"observed_at":"2026-07-31T11:57:02.395164Z","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-07-31T11:57:02.497667Z","title":"Probability and Mathematical Statistics , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.497667Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:78c2d217e9fb35390a48d593e45fd1f96422dbd608a2d6bbb3dfa8e9db5c9021","observation_id":"d52207e5-1ec0-410b-910b-da29011b0fc3","resolution":{"observed_at":"2026-07-31T11:57:02.497667Z","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-07-31T11:57:02.603637Z","title":"SIAM Journal on Algebraic Discrete Methods , volume=","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.603637Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:b874dad3ab4eac4c334d0a7c061517d11bb3f69679d5d372f0f575a20ca2b951","observation_id":"d95a8837-dcaa-4799-b796-05db41338214","resolution":{"observed_at":"2026-07-31T11:57:02.603637Z","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-07-31T11:57:02.711102Z","title":"Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.711102Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:e0e3ec41642fb6b7780067f99026b28cd8ad0d81bd45db23b370ae7930e0f11f","observation_id":"c3043f01-9839-4e0f-9d1b-f1a166708826","resolution":{"observed_at":"2026-07-31T11:57:02.711102Z","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":"10.1007/s10479-006-0072-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the cardinality of the","venue":"Annals of Operations Research","work_id":"b7d1467c-5e88-40cd-9480-d2a3047a046d","year":2006},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.796329Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:fb0a35774a95184d58ea0849cd4891a4be9fdfb09742d5d8a55a3d181c707f6d","observation_id":"be6d24cf-a6d9-43d5-a9b5-10724354002f","resolution":{"observed_at":"2026-07-31T12:01:28.234133Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.205033+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.205033+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-31T11:57:02.861935Z","title":"2005 , url =","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.861935Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:e56e221c11e5252bd04b1ada2ad378a490a1ec125e67e8b14152b1124c242ae8","observation_id":"f001a8a7-1d48-4217-ba37-a29977d8ea1f","resolution":{"observed_at":"2026-07-31T11:57:02.861935Z","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":"10.1145/2699445","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Improved Smoothed Analysis of Multiobjective Optimization , journal =","venue":"Journal of the ACM","work_id":"73166308-33e6-47df-a6f1-be3b1b0af05e","year":2015},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:02.938874Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:92ce5adfac5e07d9cf30b6a3719a84f87c50d3171d97c862347d36c3287c1a4c","observation_id":"2b7453f4-19d9-49c6-aac0-d219f43ef187","resolution":{"observed_at":"2026-07-31T12:01:28.008188Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.361962+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.361962+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-31T11:57:03.005307Z","title":"The smoothed number of","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.005307Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:431e6fb6fbfc4ab401e650c31f6a2f0a7065135fcc426785acfca349555e8fe6","observation_id":"6b0056e6-c479-4c41-9fe6-c345a01582d8","resolution":{"observed_at":"2026-07-31T11:57:03.005307Z","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-07-31T11:57:03.062077Z","title":"1985 , volume =","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.062077Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:279a19f22c3103e28017a2bbc3bbf91e3581e3fff9bc331a2b6b7e2c660ad965","observation_id":"4576bdcd-bc49-49ee-834f-2cb7237599e1","resolution":{"observed_at":"2026-07-31T11:57:03.062077Z","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-07-31T11:57:03.144943Z","title":"Nemhauser and Zev Ullmann , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.144943Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:248b77175a74a34a6b623966e072c1f4a8fd60704de31f069d9b1dc3537d91b7","observation_id":"807080dc-bc11-473f-bdd5-45ab016ab905","resolution":{"observed_at":"2026-07-31T11:57:03.144943Z","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-07-31T11:57:03.210892Z","title":"Investigacao Operacional , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.210892Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:c089d7b4971343b913ab52813d284e54fff1beb92060f7fa178e130ef3dfac56","observation_id":"cac708db-4fc7-4712-9da2-271867662588","resolution":{"observed_at":"2026-07-31T11:57:03.210892Z","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-07-31T11:57:03.281042Z","title":"Computers","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.281042Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:2fa103f3c59936d2a632ef63d7f4722a96559c72869dbeeae150a0bdbb811d26","observation_id":"b6da0dc1-b064-4e8b-9c95-65be2981eb95","resolution":{"observed_at":"2026-07-31T11:57:03.281042Z","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-07-31T11:57:03.357269Z","title":"Multiple Criteria Decision Making: Theory and Applications , pages =","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.357269Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:5e60b778a4f41289844d5d56da8e7e71f602bef8fc3ffe3995fa41915acd9e21","observation_id":"2ee4f2a4-2b74-435b-aba9-537cc430353f","resolution":{"observed_at":"2026-07-31T11:57:03.357269Z","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-07-31T11:57:03.427740Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.427740Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:c3ff1109f585753b6239f20382a803512ab1d190feb7a6771a57b291b4ee6356","observation_id":"63c33cb8-c046-47de-b896-747447af519e","resolution":{"observed_at":"2026-07-31T11:57:03.427740Z","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-07-31T11:57:03.494109Z","title":"Output-sensitive Complexity of Multiobjective Combinatorial Optimization with an Application to the Multiobjective Shortest Path Problem , school =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.494109Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:492da49c26232d79f776f9d1070e047872996d7a5738a83cd8173f8816146747","observation_id":"2ddfd7fe-b4dd-4317-8bf6-3c6cd9627d65","resolution":{"observed_at":"2026-07-31T11:57:03.494109Z","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-07-31T11:57:03.545927Z","title":"Proceedings 41st annual symposium on foundations of computer science , pages=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.545927Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:5a366d6f6d48e875daa64ca927b9c6fbea6fb1c32ab00355183b4a85996cc9e2","observation_id":"fb70c323-ab4f-4ff3-b787-194bc3bae9d0","resolution":{"observed_at":"2026-07-31T11:57:03.545927Z","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-07-31T11:57:03.628372Z","title":"International Transactions in Operational Research , volume=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.628372Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:d977d97168f26ec1b3b795be2548288f02a113cf5f926584b59398d7663113da","observation_id":"d083b79d-35fd-4c9d-8168-537cdad578e1","resolution":{"observed_at":"2026-07-31T11:57:03.628372Z","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-07-31T11:57:03.676032Z","title":"Algorithmica , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.676032Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:cc18c037dcf65a6260202de1faa3ad59ffc275bdb2423824a660dd73c82478b0","observation_id":"48e7eeb8-4a00-4a9b-84ab-0fd9420c1bc4","resolution":{"observed_at":"2026-07-31T11:57:03.676032Z","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-07-31T11:57:03.758925Z","title":"Dey , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.758925Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:7c644361de9983c2d88e3e66edab40582c64cbfd7a39947f52799ffd50c2cc73","observation_id":"b7d9a9c3-add8-40fe-be9e-4fb5453b0f2e","resolution":{"observed_at":"2026-07-31T11:57:03.758925Z","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-07-31T11:57:03.883078Z","title":"Agarwal and David Eppstein and Leonidas J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:03.883078Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:3c55c03776d4e7363097c66c03614907cc90b730a667071af70795ebd0b128ee","observation_id":"58686f6d-8365-430f-8566-f31d17d24eb8","resolution":{"observed_at":"2026-07-31T11:57:03.883078Z","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":"10.1109/focs.2009.21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Smoothed Analysis of Multiobjective Optimization , booktitle =","venue":null,"work_id":"26adefca-3368-4a7d-8db0-32a69c14b37d","year":2009},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.014880Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:d0d39cd4669ea3825dae7a4bf9680f33529af8fb37ef9e0502d717f53a71d078","observation_id":"2e80e5e9-762f-4225-afb1-605fe9f5b41f","resolution":{"observed_at":"2026-07-31T12:01:27.810891Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.44404+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.44404+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/110851833","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2012 , url =","venue":"SIAM Journal on Computing","work_id":"f647e449-65ff-4cef-a8d4-c25653777b2c","year":2012},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.143969Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:c9f4f01d08e9094cb2de0b2693fc187978578f86b10b6a0d402176790c9ed37c","observation_id":"02eaaa25-184c-45e9-8808-b182d48194c8","resolution":{"observed_at":"2026-07-31T12:01:27.632673Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.508032+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.508032+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-31T11:57:04.163560Z","title":"and Phillips, Cynthia A","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.163560Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:4aa1f6e5d4e850178409482abb602f9975b0a5fb07c63907a884ffb667387f55","observation_id":"02fb8ba7-f36e-4b78-a5d4-7908fda37b44","resolution":{"observed_at":"2026-07-31T11:57:04.163560Z","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":"10.1016/j.ejor.2018.01.054","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The quadratic shortest path problem: complexity, approximability, and solution methods , journal =","venue":"European Journal of Operational Research","work_id":"ddcfa383-6382-4c76-b8d1-0a813452b2a6","year":2018},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.244751Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:ba38392b756748effe246b5bea2a0b9c4442ba0658da9484ac0095de2f7fb38f","observation_id":"ffedd7f6-5ce5-4b9b-8f4a-f70ebc484f38","resolution":{"observed_at":"2026-07-31T12:01:27.476338Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.562544+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.562544+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1004.4484","last_updated":"2010-04-26T11:13:47Z","snapshot_observed_at":"2026-08-15T05:20:38.467528Z","submitted_at":"2010-04-26T11:13:47Z","title":"Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1004.4484","snapshot_observed_at":"2026-07-31T11:57:04.364577Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.364577Z"},"links":{"cited_paper":"/paper/1004.4484","citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:6f4ef7bba8bab54f7a761005a8810bf637b68d389ec9de9383e0f15f54012f6d","observation_id":"54712b99-61bb-43c7-afd7-314090e79103","resolution":{"observed_at":"2026-07-31T11:57:04.364577Z","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-07-31T11:57:04.445004Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.445004Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:352f24eb92245a37f5b58490bff6678605f50098320af33e78c7a5628d8e6d4e","observation_id":"e4d0f8be-c012-4350-b03c-79244daa0c48","resolution":{"observed_at":"2026-07-31T11:57:04.445004Z","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":"10.1137/1.9781611974782.53","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =","venue":null,"work_id":"9d5eb795-cf4e-4a61-bec5-61df47ef8c89","year":2017},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.516759Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:a518b83ce82e545cd4742b1edcd91ae936b2dcd41e04c606f06ef3f404c62597","observation_id":"e8e47486-cd6a-480d-8a84-7d96eb2d6060","resolution":{"observed_at":"2026-07-31T12:01:27.340339Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.621649+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.621649+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-31T11:57:04.576821Z","title":"Matula and Farhad Shahrokhi , abstract =","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.576821Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:498f7ee34c9abd4c25553d3248ffd38e21c5e972ad55817a3df908c27b8b40cd","observation_id":"bfec7a9a-5118-4fbf-a584-b106db5a0a5e","resolution":{"observed_at":"2026-07-31T11:57:04.576821Z","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-07-31T11:57:04.652918Z","title":"Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.652918Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:1d807800c38350c82ce3c7f010d3c2a1ed64fa7327142b5224621e70b2aa2e13","observation_id":"fc63e5c8-ee33-4ffa-a0ca-1c3d6215ded7","resolution":{"observed_at":"2026-07-31T11:57:04.652918Z","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-07-31T11:57:04.763065Z","title":"Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.763065Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:44498c7d0ea88cedfea4e47f357df4a0791aac2d07809358332b4995ca2bb40e","observation_id":"d0852f50-0528-44ab-b5a0-c70d33cc28eb","resolution":{"observed_at":"2026-07-31T11:57:04.763065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02377","last_updated":"2020-07-05T16:26:27Z","snapshot_observed_at":"2026-08-10T20:20:06.997565Z","submitted_at":"2020-07-05T16:26:27Z","title":"New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02377","snapshot_observed_at":"2026-07-31T11:57:04.816969Z","title":"New Hardness Results for Planar Graph Problems in","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.816969Z"},"links":{"cited_paper":"/paper/2007.02377","citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:cd31d02bdf12d61f6c8b922aeb170ed9daa9ea0958a79b3e72a0bced46ff63a9","observation_id":"f9151346-5d37-487c-86bb-f29b988f038d","resolution":{"observed_at":"2026-07-31T11:57:04.816969Z","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-07-31T11:57:04.899642Z","title":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:04.899642Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:62d3abb1aa18fe69dbe17f1f22874e598eb88c8da9336cbe065dd73c2ef9d027","observation_id":"2d584539-9c85-43c4-b62b-4a8472a5dbcc","resolution":{"observed_at":"2026-07-31T11:57:04.899642Z","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-07-31T11:57:05.048231Z","title":"1999 , isbn =","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.048231Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:b57baa40ffb6cb232abe35f9c85493fd96e9f3beb1126762f30ad9ab20411c26","observation_id":"d895cce7-be80-4bcb-ad6e-14f977d0bcb6","resolution":{"observed_at":"2026-07-31T11:57:05.048231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.07815","last_updated":"2018-05-11T07:56:53Z","snapshot_observed_at":"2026-08-14T21:14:50.292071Z","submitted_at":"2017-02-25T01:24:03Z","title":"Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.07815","snapshot_observed_at":"2026-07-31T11:57:05.149109Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.149109Z"},"links":{"cited_paper":"/paper/1702.07815","citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:d021b0d39a6cc741e8ca20b9f163fa402c52af71b0519f7606f366871915757b","observation_id":"08f4dd10-b11a-4070-bc63-6a67cfbb72ac","resolution":{"observed_at":"2026-07-31T11:57:05.149109Z","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-07-31T11:57:05.226044Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.226044Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:cfdf50abc622b20db90c2b29b2dc3e41815ebe528a915ae7d4412e47796b8b8b","observation_id":"cd9f5201-900b-4536-bde3-096f600ad68c","resolution":{"observed_at":"2026-07-31T11:57:05.226044Z","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-07-31T11:57:05.276005Z","title":"Yale Law & Policy Review , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.276005Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:b46bd2397b6561b8c5f15d47cc58276fad4009aec2c29805a4d604cbc65f6cb0","observation_id":"7968edde-efd4-46be-8898-c350fc458fca","resolution":{"observed_at":"2026-07-31T11:57:05.276005Z","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-07-31T11:57:05.325009Z","title":"GeoInformatica , volume =","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.325009Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:16fc198a4c87fd5f082a20e8a23847f9193377e689e5bb9810788df8f3ef7118","observation_id":"3fa52939-9af6-479e-9b3f-eb57defdaa91","resolution":{"observed_at":"2026-07-31T11:57:05.325009Z","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-07-31T11:57:05.415778Z","title":"Pattern Recognition in Road Networks on the Example of Circular Road Detection , booktitle =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.415778Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:536ce39873a1371c594469127ab3ae8879a2371efa235f43ebcdbc856720204e","observation_id":"3f92050d-a20c-497a-892b-70f7fff2ea0c","resolution":{"observed_at":"2026-07-31T11:57:05.415778Z","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-07-31T11:57:05.462365Z","title":"Maceachren , title =","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.462365Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:1f8812f51b0ca8e933b761cf9db2fb066d1d15527e3de35be086cac48e38cb68","observation_id":"c3026021-cd67-4fc5-86f1-d85bf8cd0444","resolution":{"observed_at":"2026-07-31T11:57:05.462365Z","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-07-31T11:57:05.504150Z","title":"Operations Research , volume =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.504150Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:d5ca6cad4b40e2578cb1a94a048ec26769e9cb3a0953f0bfac17fb6de4748990","observation_id":"521db3ca-759d-435c-b751-e73c55a20202","resolution":{"observed_at":"2026-07-31T11:57:05.504150Z","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-07-31T11:57:05.558025Z","title":"1991 , author =","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.558025Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:46d81408e61f2dc90ca150bff0223895642019579dc06d18d7db69147264b05f","observation_id":"febf6cd6-e194-4bf6-af41-05624d277c0f","resolution":{"observed_at":"2026-07-31T11:57:05.558025Z","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-07-31T11:57:05.692017Z","title":"and Church, Richard L","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.692017Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:94536b78b9a8243ab88a606d83f4cecb03e9c227eb9b94c8c62cd83f81421272","observation_id":"79c1f0a8-f320-4c84-870a-519b25bbdbdf","resolution":{"observed_at":"2026-07-31T11:57:05.692017Z","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":"10.1017/pan.2020.36","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Political Analysis , author =","venue":"Political Analysis","work_id":"3e9a5b4d-d38f-4f55-aaa1-fa7765a8113c","year":2021},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:05.869933Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:ce671d7f1bdb50c86ca8eef848d047106546d58468b5d7d991d6dd3b18a242c8","observation_id":"1ed91e8f-d848-4c8b-97a2-c32ae56fc55b","resolution":{"observed_at":"2026-07-31T12:01:27.172994Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.74375+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.74375+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-31T11:57:06.025502Z","title":"Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems , series =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:06.025502Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:5cd025b554767830df70f108e88fae552f4f241441b01bc57d83cb3bad40c8ab","observation_id":"8f460f03-ec6a-4864-830d-1058345a41ed","resolution":{"observed_at":"2026-07-31T11:57:06.025502Z","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-07-31T11:57:06.094898Z","title":"Cervas and Bernard Grofman , keywords =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:06.094898Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:e06b9bdd125869e81e906ede157e5809bedac028674e3ccd7c95c9ebc6ff10da","observation_id":"f3d766e9-6335-49c2-8371-95f1fe7e4e82","resolution":{"observed_at":"2026-07-31T11:57:06.094898Z","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-07-31T11:57:06.104184Z","title":"Journal of Optimization Theory and Applications , volume=","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:06.104184Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:92ba10ebedae944caee29c90f8589a6bd26e5dd35a05aa58bb42ff01e0562162","observation_id":"835cb760-ef38-4cce-84a4-4cae8fdd418f","resolution":{"observed_at":"2026-07-31T11:57:06.104184Z","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":"10.1002/cam4.6824","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Rupp, Robin and Mueller, Sarina K","venue":"Cancer Medicine","work_id":"f4e2fd68-f277-48eb-bb16-504483ab3037","year":null},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:06.111282Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:fe7fe8c3979c2166b15b6e174b047ea88b313ca7d9c0b8e8c7d52b6ed1414d98","observation_id":"ab9cf425-59a7-457c-82b7-462fa7b5e617","resolution":{"observed_at":"2026-07-31T12:01:26.991888Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-08T19:08:18.816751+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T19:08:18.816751+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-31T11:57:06.117500Z","title":"2026 , eprint=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:06.117500Z"},"links":{"citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:da48725c028cd81706073699d2fdc549cb8a80dcba367f4e1c6e8606959ee91a","observation_id":"48b10296-13fb-4431-9a7f-ed0722587fe2","resolution":{"observed_at":"2026-07-31T11:57:06.117500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05725","last_updated":"2019-10-31T23:28:39Z","snapshot_observed_at":"2026-08-03T17:47:11.069977Z","submitted_at":"2019-10-31T23:28:39Z","title":"Recombination: A family of Markov chains for redistricting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05725","snapshot_observed_at":"2026-07-31T11:57:06.123256Z","title":"Recombination: A family of","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-31T11:57:06.123256Z"},"links":{"cited_paper":"/paper/1911.05725","citing_paper":"/paper/2607.28298"},"observation_digest":"sha256:637e60c14b3cb74bc262aa7f800e24906287df1e56a61af50ec868759c90006f","observation_id":"934dcde5-5fbd-49f7-a22b-46a0bb452a8b","resolution":{"observed_at":"2026-07-31T11:57:06.123256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28298","last_updated":"2026-07-30T14:39:52Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T20:05:34.104376Z","submitted_at":"2026-07-30T14:39:52Z","title":"Finding Regions of Maximum Circularity in Plane Geometric Graphs"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":53,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":62},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2607.28298."}