{"as_of":"2026-08-14T06:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c015f56554b65abd0e2edb74c746b11b18032994535d9e9fb8606d111a051bf9","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:02:17.295621Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T12:11:39.634286Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T20:40:08.525667Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"cited_work":{"arxiv_id":"2507.09620","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.09620","snapshot_observed_at":"2026-07-04T20:40:08.525667Z","title":"arXiv preprint arXiv:2507.09620 , year=","venue":null,"work_id":"39aaa0e3-2f2c-4e1f-ae04-0b556b5c03b1","year":null},"citing_paper":{"arxiv_id":"2606.25827","last_updated":"2026-07-05T00:58:18Z","snapshot_observed_at":"2026-07-12T12:11:32.102991Z","submitted_at":"2026-06-24T13:45:01Z","title":"Paths and Intersections: Recognizing Outerplanar Metrics","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-25T19:48:10.529872Z"},"links":{"cited_paper":"/paper/2507.09620","citing_paper":"/paper/2606.25827"},"observation_digest":"sha256:3456484ecaceffe17bceb18cbeb937c290fc53b71eb0d00adea408a234f42341","observation_id":"212c6796-5e72-4b46-b9a0-fe80afc3e09a","resolution":{"observed_at":"2026-07-04T20:40:08.528589Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.09620","snapshot_observed_at":"2026-07-12T12:11:39.634286Z","title":"Paths and intersections: Exact emulators for planar graphs.arXiv preprint arXiv:2507.09620,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25827","last_updated":"2026-07-05T00:58:18Z","snapshot_observed_at":"2026-07-12T12:11:32.102991Z","submitted_at":"2026-06-24T13:45:01Z","title":"Paths and Intersections: Recognizing Outerplanar Metrics","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T12:11:39.634286Z"},"links":{"cited_paper":"/paper/2507.09620","citing_paper":"/paper/2606.25827"},"observation_digest":"sha256:ea189ca33ab5acc645de6f790676fd691776c2653dac368fe34e8e0cf566b521","observation_id":"8c43e349-1bdf-45bd-a30b-f594621cce21","resolution":{"observed_at":"2026-07-12T12:11:39.634286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.09620","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:2507.09620 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02883","last_updated":"2026-07-03T02:29:36Z","snapshot_observed_at":"2026-08-13T18:04:35.103910Z","submitted_at":"2026-07-03T02:29:36Z","title":"Paths and Intersections: Minimum Realization of Okamura-Seymour Instances","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/2507.09620","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:13a786882f5aba392aa2eff0e31594604776b56f1a1f92eea5784de553ada252","observation_id":"23965ab7-9c72-4fae-9d67-0df7407e5df5","resolution":{"observed_at":"2026-07-12T06:25:09.946876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.09620/citation-record","integrity":"/paper/2507.09620/integrity","json":"/paper/2507.09620/citation-record.json","paper":"/paper/2507.09620"},"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-06T18:02:20.919726Z","title":"Steiner point removal in graph metrics","venue":null,"work_id":"a55b6ff0-1f6a-4433-8d83-27d37004cf8c","year":2008},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.233715Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:1d2ade66fbf536f5e23dcfb98103bafe9421efa87c9729f83fa56e4186d20be9","observation_id":"92eeed4b-6c73-4aa1-9190-653db44efe68","resolution":{"observed_at":"2026-08-06T18:02:20.972357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:20.767036Z","title":"Covering planar metrics (and beyond): O(1) trees suffice","venue":null,"work_id":"3da3189b-bc28-4c4e-9fd8-f9d728c7c7e8","year":2023},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.285105Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:8c94db63b51ea34ca4ea2ed01abfbd7930584f0f0988cbde64b39ce4afd3abb3","observation_id":"71df2634-62e5-4eac-9127-c862503a5f69","resolution":{"observed_at":"2026-08-06T18:02:20.830502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:20.629232Z","title":"Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more","venue":null,"work_id":"cab24a10-bb56-46a3-b169-6a918fe6e2d9","year":2024},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.288548Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:0b2401c843e72b1bf49f3cae442b42fc7ff5d714ed223e50f8b97f5b567cd54c","observation_id":"f556fde8-4cae-4d18-bcd9-5b4e7135cd4c","resolution":{"observed_at":"2026-08-06T18:02:20.707454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:20.468517Z","title":"Near-optimal distance emulator for planar graphs","venue":null,"work_id":"bb2faa64-ec55-4645-ae47-d04ca623bedf","year":2018},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.322012Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:1b674efc5f93235d3a05c66743abd56269539c091c99e843ebefaeda36e73962","observation_id":"4adb255d-51da-44f8-9d0a-e9f8483b25b4","resolution":{"observed_at":"2026-08-06T18:02:20.551905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:20.322131Z","title":"Steiner point removal: distant terminals don't (really) bother","venue":null,"work_id":"3fee932a-155f-4038-9354-ee20f548a62b","year":2018},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.398824Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:ac4c9cdbcfd6c3fc063c922e12a85afd1f5ff4fcc543a8452caacf6390a72772","observation_id":"d8a5c04f-53ec-4bf0-a957-7e085ad2db93","resolution":{"observed_at":"2026-08-06T18:02:20.390156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:20.189355Z","title":"Almost-linear -emulators for planar graphs","venue":null,"work_id":"884c2ec8-3615-4596-a211-ac50f58afba5","year":2022},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.463174Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:0c78806e413da7f34f28cc7b9952f06bd997966ddc7677309b58e0068457fcae","observation_id":"7d1fb6a9-0608-4f34-b346-a261d1194359","resolution":{"observed_at":"2026-08-06T18:02:20.251385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:20.018673Z","title":"Planar emulators for Monge matrices","venue":null,"work_id":"b4f63266-a65e-4856-baf7-e76e45208609","year":2020},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.604143Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:7642f4830476a6c1319a293502688a05331f5cf26fdc3ca7417cdefe361a3286","observation_id":"ce63e2c0-3329-438c-8abc-1a32c56e8be4","resolution":{"observed_at":"2026-08-06T18:02:20.096817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:19.857438Z","title":"An O( |T|) lower bound for Steiner point removal","venue":null,"work_id":"40c11a08-861f-426a-b961-9932e9f930ca","year":2024},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.794477Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:61682d78bf109709154a8582eb66f714590f814854e071e5c7cdf662580a2dc8","observation_id":"855fdf5a-33f9-466b-9ad0-0312c809e70f","resolution":{"observed_at":"2026-08-06T18:02:19.926767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:19.725164Z","title":"Path and intersections: Characterization of quasi-metrics in directed Okamura-Seymour instances","venue":null,"work_id":"fee4fe82-7bcc-4a1b-bec6-efec39e5d780","year":2025},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:15.911684Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:73d315e4e3a12907d1b4aa35e8612b11da9619ef70fde19dfb01ee66d8857be4","observation_id":"ed28dcc2-fc3f-4229-b9ed-6105c331745b","resolution":{"observed_at":"2026-08-06T18:02:19.786060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:19.599539Z","title":"A tight lower bound for the Steiner point removal problem on trees","venue":null,"work_id":"35bb50c4-6ae8-44c5-b1fe-f0eff85ff58b","year":2006},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:16.050658Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:4a2ac9cbbc0cdf46899844ab31bf26d420d23ce45907d59429a12f4124653957","observation_id":"5c74ed47-4449-471d-8ed1-0b4a8383ef23","resolution":{"observed_at":"2026-08-06T18:02:19.657810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:19.452518Z","title":"Holiest minimum-cost paths and flows in surface graphs","venue":null,"work_id":"f50fabfd-8d51-4db8-97d2-895aa60e1390","year":2018},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:16.178081Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:2dc827c652d4309604fa6779f531522ad6260ffd114c782feba176739c98959d","observation_id":"556bf5a7-7edc-427c-938a-4361290e2f98","resolution":{"observed_at":"2026-08-06T18:02:19.520137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:19.323747Z","title":"A Fourier -f \\'e le mechanikai elv algebrai alapja","venue":null,"work_id":"8f9c4ea5-3edb-4cca-8471-66bddb6fbd5b","year":null},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:16.259464Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:4356c727e78aa4713066e061dd59f825afbfa6e7c6d813a4c837754c7dd9087a","observation_id":"a8de26f2-a6f9-4132-9937-a8b900947c91","resolution":{"observed_at":"2026-08-06T18:02:19.393661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:19.198251Z","title":"Steiner point removal with distortion O( k) using the relaxed- Voronoi algorithm","venue":null,"work_id":"e1c0abb4-e7de-4d7b-973a-9c0a808afd07","year":2019},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:16.387857Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:4d1141463a5c44d8f6f855c4dbe43b033a5b7512f2a81f2c93c455e085ff7755","observation_id":"24d203a0-ceff-4b7e-ae5b-aeb6086d7ef3","resolution":{"observed_at":"2026-08-06T18:02:19.258065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:18.999742Z","title":"Scattering and sparse partitions, and their applications","venue":null,"work_id":"41f250ca-2180-4d67-8306-e6d69c73c9d1","year":2024},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:16.567197Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:2db562a23089a80f981644422190bd9cca6536fe0fd60818888d6a52369d9c8a","observation_id":"b77eb263-f1f5-4f15-be82-7803e35b02a2","resolution":{"observed_at":"2026-08-06T18:02:19.114482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:18.756584Z","title":"Improved guarantees for vertex sparsification in planar graphs","venue":null,"work_id":"96e6ce0d-e89c-4abd-81c2-a32f8a7cd9d7","year":2020},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:16.678651Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:ac0d504f41844b2e71a60fc1c5baf626f7bc0d6505dace225f25d26fbd93316e","observation_id":"4d602a2b-39a7-4558-89eb-d2ca2985081d","resolution":{"observed_at":"2026-08-06T18:02:18.876456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:18.542082Z","title":"Steiner points in tree metrics don't (really) help","venue":null,"work_id":"9f60ed57-b7e9-4ff6-98ee-3a49cbd52982","year":2001},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:16.773152Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:f29ac2053e1bac60a00cf1c9f549423f2c331410ca4561242dd7eaa5c8a57631","observation_id":"e94ae372-98c7-487b-9dc4-5971a79a6603","resolution":{"observed_at":"2026-08-06T18:02:18.657972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:18.253747Z","title":"Ellis Hershkowitz and Jason Li","venue":null,"work_id":"bbef2ec3-21ea-40ba-a7df-232ac7532119","year":2022},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:16.878522Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:71c815b42165261c337763fe16cdfbd0edada18ab5a2c9f77780a8ac98d753c7","observation_id":"5a2b0f6c-ecd6-4f21-8279-e62b495626d1","resolution":{"observed_at":"2026-08-06T18:02:18.419780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:18.005369Z","title":"Cutting corners cheaply, or how to remove Steiner points","venue":null,"work_id":"40bee330-3d07-4373-9f5e-dfb3c2c78c54","year":2015},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:17.056582Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:4565d3f2e5a89fbf86dba5e4ed71a19aff1e0c5e9eab85cd3e5658ce7a2812af","observation_id":"e031687f-1bec-4904-9197-2a55baeee7c9","resolution":{"observed_at":"2026-08-06T18:02:18.150001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:17.712487Z","title":"Preserving terminal distances using minors","venue":null,"work_id":"0ea9fdc5-7cc8-4e8e-9073-7bc239e9fcac","year":2014},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:17.159866Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:bc448d477acc6e06fcf50efcf551850cdc4226d6d0b1038207a1445a5d640179","observation_id":"87b32596-37b2-4794-ae12-f9944e9f9f43","resolution":{"observed_at":"2026-08-06T18:02:17.860302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:02:17.449407Z","title":"Multicommodity flows in planar graphs","venue":null,"work_id":"20a7355a-9912-43f5-9220-cd9a10dbec12","year":1981},"citing_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:02:17.295621Z"},"links":{"citing_paper":"/paper/2507.09620"},"observation_digest":"sha256:491000ad7866126b49149cf6d70c6a04b55693708b68e4b38c4d0bcc6b8c14aa","observation_id":"be73ebff-da71-4e57-9722-ea234a37b048","resolution":{"observed_at":"2026-08-06T18:02:17.540249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T17:49:05.564184Z","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 3 inbound Pith citation observations for arXiv:2507.09620."}