{"as_of":"2026-08-20T01:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13e928fc8b46c1547397b08246fe87ef624134fac8105ede86c75dcb568c9890","coverage":[{"denominator":159,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T06:25:09.946876Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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.02883/citation-record","integrity":"/paper/2607.02883/integrity","json":"/paper/2607.02883/citation-record.json","paper":"/paper/2607.02883"},"outbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.25827","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:2606.25827 , 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":1,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/2606.25827","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:61e99b50a4ece77bfa3085ec60c403f8266c91633812944c2f6af701622499d3","observation_id":"e7450908-e23f-488c-9d83-a93e93cf1e97","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Louis and Yau, Stephen S","venue":null,"work_id":null,"year":1965},"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":2,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:98ce79c0a2794751c8ef9739bc90e82e689c775b66e929186cdc46b89e15e610","observation_id":"8a665642-67d0-4dfb-a540-81deab5eb459","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":null,"venue":null,"work_id":null,"year":1966},"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":3,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:0638e5445fc2d9f10dfa954b17cdc0132d21b5dd7db8255f8e16fe837d62e0f3","observation_id":"4629050d-de86-4f79-acbb-7b3b11da25fb","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"On Optimal Realizations of Finite Metric Spaces by Graphs , journal =","venue":null,"work_id":null,"year":1988},"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":4,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:b9e0d375f1ee9c000b29bc0ae0e8def04e5fac71fe073565a2f40c08ae697916","observation_id":"d9663405-ef4c-4b8a-b262-4f4d95b82143","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"SIAM Journal on Discrete Mathematics , volume =","venue":null,"work_id":null,"year":1988},"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":5,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:7cb60fb066dc70558a309cd580bea2dde9493cb73320e1ec9bc4c6ad5832fcc0","observation_id":"e9f72f58-d1d2-45ef-b07f-a72b1b418f4f","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Annual Symposium on Theoretical Aspects of Computer Science , pages=","venue":null,"work_id":null,"year":2003},"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":6,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:4dc6afe8e2a3a8bbde4cb9b050c3bbe19980fccc33b8d22b90c3aecdc2931f00","observation_id":"156ecf12-9bac-4cfc-9cbb-0e4c4b000088","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"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09620","last_updated":"2025-07-13T12:58:55Z","snapshot_observed_at":"2026-08-18T11:01:20.366586Z","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:ef8d13732ddf13b32aa41dd2eb34ba68df155774dbbbdfbd420ee5936bafe985","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2025},"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":8,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:4f25a3333c6f6796e15846f0d7f475cf3572859ddc8db20fe3f89c9ae0930cf5","observation_id":"3341a1b7-1542-4445-9fcd-a222e378a8c9","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages=","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":9,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:c249eaa5f0ffe04173905210d8db52d3005bcd407b410ce8816756b4fd108343","observation_id":"279d6872-8c7b-4629-accc-f5ae039ea3e4","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"}},{"citation":{"cited_paper":{"arxiv_id":"1807.01478","last_updated":"2018-07-04T08:26:37Z","snapshot_observed_at":"2026-08-14T18:55:53.914749Z","submitted_at":"2018-07-04T08:26:37Z","title":"Near-Optimal Distance Emulator for Planar Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.01478","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1807.01478 , 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":10,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1807.01478","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:1f278f6b10c12ea5f164acd4c9a17a304f9dde63ca218b9d389540b00900eb3f","observation_id":"4baa6728-ef7a-41c9-822f-debcf5d7d230","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"1972 , publisher=","venue":null,"work_id":null,"year":1972},"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":11,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:63855e18867e2758bcca618a9ab3bee797394ba166fe148020307ab2c94f422f","observation_id":"144b8b5e-ec78-4777-8562-792e972ff9c1","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Quarterly of applied mathematics , volume=","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":12,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:5f52a13981fcd787daf7d19ae0e1319c81ba01d19cccba9d1a6f7cd936db4f6f","observation_id":"470c7f17-d4ef-4d4d-8ed3-d084fdf87059","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Discrete mathematics , volume=","venue":null,"work_id":null,"year":1998},"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":13,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:12edde59587ac083a0b22d814ae90c0006cf0bf4c38d51d8653ab762b9b327d1","observation_id":"638b6ed9-0cdd-4dee-84d1-178aaf6b750d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Linear algebra and its applications , volume=","venue":null,"work_id":null,"year":2014},"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":14,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:ddd7e8adac9365bd4761e0f0f93a959890475ba927c571f63cff474112253da9","observation_id":"74d1e6dd-b6dc-44cd-a54b-49d73f95f621","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Algorithmica , volume=","venue":null,"work_id":null,"year":2023},"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":15,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:37df62ba98a6f2b5133a24cc11a2b6c384f517b2f68737b8c144f739b8bb6f3c","observation_id":"dace0f88-2f58-450d-abf0-f83c7cc2ae9d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Discrete mathematics , volume=","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":16,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:27376a4c845ea4090eb890378fae8399433039527089cb88af6aa8bd01f657d2","observation_id":"226b0745-3c38-4f0c-b157-fd4a161f54d8","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Linear Algebra and Its Applications , volume=","venue":null,"work_id":null,"year":1982},"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":17,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:e4a1d2d146b33370c7c3c72b8c8b5a88dfed8428b4b5ec9abb21001d31631e69","observation_id":"031e517c-12b8-4641-9b28-dc273151a753","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"SIAM Journal on Discrete Mathematics , volume=","venue":null,"work_id":null,"year":1990},"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":18,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:847fab20370034252deffd3d65a952979b922266344831c7507588f86ac7194e","observation_id":"3a5eacaf-2182-4fac-b9f7-d329778f3c00","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) , year=","venue":null,"work_id":null,"year":2022},"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":19,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:0d22fde4ff4344d52073db53b1651ec9745725d6a20437f8c3f1d4adcd2026ce","observation_id":"7caccc2e-3c2d-4d14-be28-7eb200ed76b5","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Information Processing Letters , volume=","venue":null,"work_id":null,"year":1989},"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":20,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:839302bd8d60a8dcecdb5104309094030069fa993f1d710db6a71548814ac944","observation_id":"8a190add-87ad-4e7a-b7c7-6a49caadaf1d","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"}},{"citation":{"cited_paper":{"arxiv_id":"2202.05127","last_updated":"2022-02-10T16:23:31Z","snapshot_observed_at":"2026-08-16T17:22:13.413983Z","submitted_at":"2022-02-10T16:23:31Z","title":"Improved Compression of the Okamura-Seymour Metric","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.05127","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:2202.05127 , 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":21,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/2202.05127","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:c61bf466be5e070c8ed0fb80d82753fdfdc4db85109ee51c0e18e322556a26f9","observation_id":"de8d0db4-c9ef-4ffa-a820-c0beb0ed4a68","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2019},"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":22,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:22c83f0b1865e24ee0f337e850b4810bbac04733861c3816ff3bfe3e4d994230","observation_id":"843d8dcd-45f1-4b1b-b1f4-9d7a8fa348a9","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Journal of Graph Theory , volume=","venue":null,"work_id":null,"year":2023},"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":23,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:42e5fb91ec69fa83dda378e31a096a94cb4f4c4ea97b60be0ef1c2bc232c4184","observation_id":"0ef8d718-5dcf-4e02-82d1-d40e4c9b8762","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Discrete & Computational Geometry , volume=","venue":null,"work_id":null,"year":2022},"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":24,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:f4ff0a713573bf82c90badbb11b67de8c07f8c156e524b328e4bbd8c2b35cd80","observation_id":"82e6c0b0-651b-42e3-8815-167e4097710a","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"}},{"citation":{"cited_paper":{"arxiv_id":"2211.07042","last_updated":"2023-06-27T23:32:38Z","snapshot_observed_at":"2026-08-16T16:16:32.038475Z","submitted_at":"2022-11-13T23:08:27Z","title":"A Local-to-Global Theorem for Congested Shortest Paths","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.07042","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:2211.07042 , 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":25,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/2211.07042","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:5a0219441513722354660ac403b8404e72c71b1b20385bff7964f97d476751ae","observation_id":"07c0a3cc-e84a-48ea-ae4f-bf7b8f9960b9","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Combinatorica , volume=","venue":null,"work_id":null,"year":1995},"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":26,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:58b1e05031701bdb99948e59d0ac597d608965fb1221d9dba95b85c99b0aae4e","observation_id":"9c3b3e55-f466-4ea4-b67c-7d1a6ab597cb","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2009},"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":27,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:442f6c6bf1929357eda39c12c633505bd6f7877bf215b17fba3e4d2e57350844","observation_id":"153eab8b-2530-41e4-8bce-7afc2c8e038c","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Advances in Mathematics , volume=","venue":null,"work_id":null,"year":1984},"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":28,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:dbf443bcfcda9adc71fb0e88c609671bc3a6578d4f6a4af80a0a3b7c5b15d4a5","observation_id":"d343a4fc-08e6-4e6e-929b-73cad09ade88","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Journal of combinatorial theory , volume=","venue":null,"work_id":null,"year":1969},"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":29,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:c7d98d003fe16a27491019f8c2fa6e748aff271774c81098c0f354ca5b37dd5e","observation_id":"5dfdc412-66fc-4643-8f13-ca09dc6bea7d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":null,"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":30,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:bcdc2759824bec47778c1272db4ad58996db40ccd02f47bee65c9baf552ebb91","observation_id":"67c6181f-f7da-4738-8b8c-726cf5428770","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Information Processing Letters , volume=","venue":null,"work_id":null,"year":2020},"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":31,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:137a542ffac05bdb2b7a021f379e6ba44d075a4b6d17e2374f8badead7baab7a","observation_id":"3a600feb-a2c5-48bc-8fde-e0e63a5d04c3","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"2015 , publisher=","venue":null,"work_id":null,"year":2015},"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":32,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:cb67f17d3e2e1821632fc15a48f36e625ea65ffaf01d424157f200758e8c42ca","observation_id":"2579bab6-37dc-4102-801a-903c750bcb0e","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Journal of the Royal Statistical Society: Series A (General) , volume=","venue":null,"work_id":null,"year":1987},"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":33,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:beb3889ab4aa534693fe2988680f5b6663982d11d2c85ba87faea018a89d29f5","observation_id":"163a315c-6dee-4548-8be0-021a7eaee9dc","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Journal of Computer and System Sciences , volume=","venue":null,"work_id":null,"year":2001},"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":34,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:45c5d67cd2b47382d6db9a4d2772cccbe83c9fafd078bcf08ab7b45348ee24ce","observation_id":"664015de-9b58-4ef9-b2a4-e06dd7d86305","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"2012 , publisher=","venue":null,"work_id":null,"year":2012},"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":35,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:8a5e307997c67e3af5467bff8c8ba873c783b2c3d8f0a1c01a8dabaa5f71dc44","observation_id":"8d097b3b-83d9-4a98-a837-11bc683a6db0","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Quarterly of applied mathematics , volume=","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":36,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:275bd5d6933ac8d6a3d5aef4fbef42d0b425d13cf52757c00838ccba910b3037","observation_id":"ec813b0b-41df-4a96-8f72-39ca126af1ff","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of Colloquia Mathematica Societatis Janos Bolyai , volume=","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":37,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:5b39ea09b57b9cfc45edcc1e58241c8537027a756e553528d1f631043c93572b","observation_id":"340183a6-bb04-44a6-aef2-1e754caa5c7e","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"A Fourier-f","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":38,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:466204f5ea17f58e78b3dd4187cdcad0daf397dc41e8b8ee468d78ca6df2968c","observation_id":"38bdecae-8499-44d9-ae06-ecc38c317d62","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"}},{"citation":{"cited_paper":{"arxiv_id":"1711.01370","last_updated":"2017-11-04T00:38:57Z","snapshot_observed_at":"2026-08-14T20:17:06.585804Z","submitted_at":"2017-11-04T00:38:57Z","title":"On constant multi-commodity flow-cut gaps for directed minor-free graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.01370","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1711.01370 , 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":39,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1711.01370","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:27cb64237d99fe9712791b8191734b1bc3b85db2bdf0dea4610f5d2433c36595","observation_id":"a7dde994-1905-42b0-9dc8-c0075f14b250","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"2003 , publisher=","venue":null,"work_id":null,"year":2003},"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":40,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:8d2b214904f305e8f7d87516aa875608049588bb2098d53410cd1242e4e70832","observation_id":"cccab5d3-a728-4abc-bc7c-d8dbed5f5a27","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Planar Emulators for Monge Matrices , booktitle =","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":41,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:16e47eff8f9496a06445e03e5b291b4cedb7b9cb7cbffac66e2872348d23ada5","observation_id":"1ba3d573-82ed-42a6-abe3-0af9ea1f1272","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"2020 , url =","venue":null,"work_id":null,"year":2020},"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":42,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:6792b40caf683fd5ebacb364739f76c53aace900ed0a9241f173a33c25e84c35","observation_id":"207d5422-3bad-41f7-ba73-a6734b07207f","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"SIAM Journal on Discrete Mathematics , volume=","venue":null,"work_id":null,"year":2014},"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":43,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:376d8a46b7a13b32d8793d0d9957c7ac57214b0c453f5403ece50997ac78bbfd","observation_id":"7e473f12-db43-4e28-96b4-ccc105366964","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=","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":44,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:3debb50ca29c1923dc73eff86424fa68e9e1ccd8ff5ce8d3337b634caa428343","observation_id":"657466c7-f918-4f08-8587-2910705d6454","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"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07857","last_updated":"2023-10-11T19:59:44Z","snapshot_observed_at":"2026-08-17T16:13:11.424927Z","submitted_at":"2023-10-11T19:59:44Z","title":"On $(1+\\varepsilon)$-Approximate Flow Sparsifiers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07857","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:2310.07857 , 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":45,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/2310.07857","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:83a4fc415f3a33a0cf9f3af93066c42491b87faae96db595ae2cea690f9131d6","observation_id":"e26f7f56-d497-4ffd-bb3c-14dd90542433","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Discrete Mathematics , volume=","venue":null,"work_id":null,"year":2016},"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":46,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:445198006f208c9b4eae8c73efec05562107ca2727cdf3ddae73f70540b8a4ef","observation_id":"0ebc097d-a69c-459a-8a4a-b6ec1ffb7dc4","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Discrete Mathematics , volume=","venue":null,"work_id":null,"year":2001},"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":47,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:4966a951ccdd6765977a57b2536990cad5f8701810fa05ba668bfccb6756038f","observation_id":"346d8e60-5a2e-4bd1-89e7-5fac656e8ff4","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":", author=","venue":null,"work_id":null,"year":1993},"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":48,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:57d493364915d6b357e499f5fff651341e87c51d78c7b58305f3ab6edbf02d3f","observation_id":"ec137d02-b5b9-49e8-bcfb-475a58cf5b87","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":null,"venue":null,"work_id":null,"year":2000},"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":49,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:f53b215caf9dece1947df8fb2a16f49532cff52aa963ca26fe9b9b1c9c4d20ea","observation_id":"5fd02555-00fc-4974-8c76-936ae12cfef5","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Combinatorica , volume=","venue":null,"work_id":null,"year":2001},"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":50,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:793383fa4549e64aa7730f34d8c85a95d722510d3870a01f7028a8bf2d10e4e6","observation_id":"61c9e1db-ade3-4edf-a9b3-47f162256865","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2012},"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":51,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:cc620cc36763d8ff4d865695d062b9b2cdc9f91fcded274ba41e38e65b21bf79","observation_id":"e7d808b9-6f9e-4fb0-872e-ca65b46a1483","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2021},"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":52,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:d94f2b26b229d84d1a7b36426e0f07e6d2fdb6ce8778e7500f28e6d89edf9869","observation_id":"5caf384e-ea89-4044-8628-508d733eb7cb","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"}},{"citation":{"cited_paper":{"arxiv_id":"2011.15101","last_updated":"2021-01-14T05:53:50Z","snapshot_observed_at":"2026-08-16T19:02:07.957320Z","submitted_at":"2020-11-30T18:33:16Z","title":"Vertex Sparsification for Edge Connectivity in Polynomial Time","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.15101","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:2011.15101 , year=","venue":null,"work_id":null,"year":2011},"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":53,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/2011.15101","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:4cdd20d013db174ca46eb6736fbf7da244a126181d2e086909063f27025348d4","observation_id":"d0e4f9d6-ab91-4add-bbef-bc1a642d4d50","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"2001 , publisher=","venue":null,"work_id":null,"year":2001},"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":54,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:c986cbc66bf5ca53349efae9fda234a25d11c8a573191875f03e90ec35627bcf","observation_id":"4e397ecb-d334-42b9-a493-02da7803aca1","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Annals of Combinatorics , volume=","venue":null,"work_id":null,"year":2006},"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":55,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:8914fab5e226480c811dc5d8c72a4194232f710c3ba78b273530b89b7eb7938a","observation_id":"9ed94d90-dd43-49f9-8252-9779e732c7b9","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Discrete & Computational Geometry , volume=","venue":null,"work_id":null,"year":2007},"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":56,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:fdf5dc58f953b5403332575c25b3b983358f9e24324162620010699a3c56f3c4","observation_id":"b926cb0c-f16b-46d3-af9d-40b83b076d95","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"the electronic journal of combinatorics , volume=","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":57,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:56e529f365ddc3eb5ce7666ba8ebae01dbbbe8fa306e0c5301505dd6e15b9b1f","observation_id":"ecbcf9a9-0c76-4259-9a23-0451c841ec07","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Discrete Applied Mathematics , volume=","venue":null,"work_id":null,"year":2021},"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":58,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:f5a8b4a9b8d19b07b5f68cdd0985c0d3cf2ef6ddf03c917761ac64a1a5999c31","observation_id":"7b27bab7-08d2-4f55-8404-de075ce0e22f","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"European Journal of Combinatorics , volume=","venue":null,"work_id":null,"year":1996},"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":59,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:3e0d39fb5ecb02210598c6e05a4824c7f38eceeeb4284f61f453995737103d0e","observation_id":"7dc56e76-3ba0-4e1b-8d1d-f1155869d71a","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Computer Science Review , volume=","venue":null,"work_id":null,"year":2020},"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":60,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:2ec3dd7b5b760a022ac4b9515ec72531afc542e07dc3afb875db7c74c49b9e99","observation_id":"e82234d3-3acd-4915-8d2b-8d386f2dc732","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2021},"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":61,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:d218ca1709f10e0f260e07b177e35bc1da7041f53d34efc171d501f7b4b57a24","observation_id":"887032be-3980-4dac-8e90-9ad52bbf1a64","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"under submission , 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":62,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:7d660df75dfb8a6af924693c5bcb084c5c0d8f3ff4534e422911b6591e331798","observation_id":"0753ae83-8774-4593-89fa-b1c2a3b87c59","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2020},"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":63,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:944af6380ac1d35f1c383dddd5f3018e0e9024d022e2a4d059055489abe487dd","observation_id":"97bf3e3b-6086-4407-9a30-90afb25ceb8f","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages=","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":64,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:e88f4ce0a9e4c842043c62debb458deb8540e10cfc2870fbd9dc02d5303b2d87","observation_id":"7f04138b-e34a-4702-bd5a-3112b549d242","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Approximation and Online Algorithms: 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25--26, 2016, Revised Selected Papers , pages=","venue":null,"work_id":null,"year":2016},"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":65,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:5dca7442a33e803d9db19ab70006a9deea3384dc114ec2f5e2419f4a2b24ccb8","observation_id":"3bce7c0f-0246-426d-be57-51110d955287","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"European Journal of Combinatorics , volume=","venue":null,"work_id":null,"year":2009},"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":66,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:cf8e8167905632c6843bfa09a9fbf3bba48ba251dd9d94c83d75ad0344b4fbdc","observation_id":"fa218882-9177-4d15-bb98-69ef0606b111","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"}},{"citation":{"cited_paper":{"arxiv_id":"2102.05077","last_updated":"2025-01-04T16:18:17Z","snapshot_observed_at":"2026-08-16T18:46:40.519108Z","submitted_at":"2021-02-09T19:06:35Z","title":"The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.05077","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:2102.05077 , 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":67,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/2102.05077","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:342a24f6aa6fa112c17e31288104353ec81b92c89ad61702f1a3b5bf5518e711","observation_id":"feba7eae-9def-4ecd-a1aa-c25ad7f2a40a","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Journal of Computer and System Sciences , volume=","venue":null,"work_id":null,"year":1998},"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":68,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:24000a4d8c790d93769b49356050c483ce9bde7bf5309b22029fbfa29cf50163","observation_id":"ce6316d5-81bc-49a2-9e68-d77efb4acc53","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":null,"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":69,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:5ec9c7e88466c70331ca3440c95ae979a3620db450553686214aa2859269a419","observation_id":"df426f72-117b-4db1-b005-d7fc6d94eaef","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Information Processing Letters , volume=","venue":null,"work_id":null,"year":2014},"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":70,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:f4c1fd62fe353b19d1b5bb7b98cc40fe69712e5ca6cc35a452bb3aa9d67c6497","observation_id":"2c1f2c6f-9d90-48c5-855d-36cfda19d500","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"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06086","last_updated":"2017-12-30T17:44:15Z","snapshot_observed_at":"2026-08-14T20:53:05.036444Z","submitted_at":"2017-06-19T17:57:08Z","title":"An exponential lower bound for cut sparsifiers in planar graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06086","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1706.06086 , 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":71,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1706.06086","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:8df009926f4d8da98d7622749d9ced48af2dbaab3323587ba2fa1aea8f18c420","observation_id":"f08ffda2-fbb6-4ccf-9028-c3b9ca2c8618","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages=","venue":null,"work_id":null,"year":2013},"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":72,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:f7303584161435ce047e12dfb7b89a9ff0b49f18689431ba0806b649888f94ba","observation_id":"e80c278e-f107-452e-83eb-cbe9b89ff3cd","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"}},{"citation":{"cited_paper":{"arxiv_id":"1702.01136","last_updated":"2017-12-27T15:46:50Z","snapshot_observed_at":"2026-08-14T21:18:04.299818Z","submitted_at":"2017-02-03T19:35:00Z","title":"Improved Guarantees for Vertex Sparsification in Planar Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.01136","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1702.01136 , 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":73,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1702.01136","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:a60f1d4ee3871d65057d996af2a2e4767274b33d7cf0cffa8a62a495f184cc0c","observation_id":"cb4b2fc5-ae63-4bdc-ad11-3e22d38c1afc","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"}},{"citation":{"cited_paper":{"arxiv_id":"1702.05951","last_updated":"2019-10-04T19:01:22Z","snapshot_observed_at":"2026-08-14T21:15:43.753435Z","submitted_at":"2017-02-20T12:42:07Z","title":"Refined Vertex Sparsifiers of Planar Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.05951","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1702.05951 , 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":74,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1702.05951","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:eec9dc8c4717b382b3ed5387a9a6e3408961b7cc88a1ee8281e46d1c304e480c","observation_id":"e3244c3e-1b06-400c-92eb-612ab72fef12","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":", author=","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":75,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:ec4a056801c2c48f656aadde9981fa8fa1791f4888fc278c5cbbde4dbbdc8f66","observation_id":"a67891c0-0896-45b2-8ac8-10cf576f71a4","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Foundations of Computer Science, 2009","venue":null,"work_id":null,"year":2009},"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":76,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:e61c04be08fe442076a46cf62d86c5f0a13e5a11f7f09d21b128557fd50e48c2","observation_id":"4cd4e49e-3455-437b-8b46-516398909a2d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2013},"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":77,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:069fad9cdbb9b746eff8c0a0ba0186f768f055a2dfdd260bfe8be03eb9bdff6c","observation_id":"cf47a415-7b8b-403a-ab74-553074e2b7dc","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms , pages=","venue":null,"work_id":null,"year":2003},"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":78,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:49419f985cdd7f5ff0919621ed12972c1fc3eb0beda30ea2fb61be8f2126b764","observation_id":"410177d2-3fb0-4896-ba8f-461236cde812","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":1999},"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":79,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:6f0ec1631a92d08efcf95ac9392f2d9dcaab00a75015d7d9f35017db9ec5bef3","observation_id":"be80c96b-a317-42d7-a94c-d6db3d1a76f3","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":null,"venue":null,"work_id":null,"year":2016},"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":80,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:8ab1aea90f73a76c5a63910ab13ef765e3ba2504039384821940842a8ca23fc7","observation_id":"24ebea77-5aed-4100-86c4-0941f9d43aca","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Foundations of Computer Science, 2002","venue":null,"work_id":null,"year":2002},"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":81,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:042ae82b7edca3857461c2316709ecd2eedac0285170e902dad0b294b00627c9","observation_id":"4da938c4-c417-445a-bbc1-67dee4d5a6ec","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the forty-second ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":2010},"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":82,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:47470bcb51c6ea20f1a0c6dad34ef107a3a9b9fce143d7f93d4e02ebe91550d6","observation_id":"e60eb28c-32cf-4530-9726-885385b1925a","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2009},"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":83,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:ada6900fd5d57bd1f548251c520fc2508421d0eecd32b58c278a4d4548ba374b","observation_id":"cbeb2b2d-1f34-4d34-bc18-24604db2aa1f","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on , pages=","venue":null,"work_id":null,"year":2010},"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":84,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:51f9b56393448ee4a67a2533fa967d030481f068c74b86573a8db49de03d4382","observation_id":"1684fa64-0ded-43e8-8efa-075444bcbdd0","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on , pages=","venue":null,"work_id":null,"year":2010},"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":85,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:e70bf722369759925c37321d4f446abf43148df03064384833b672b194957b98","observation_id":"53f59c9d-5f44-442e-b4da-f5aa9d3af917","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2014},"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":86,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:efdec852a23af759a017b0a38fa194061f6fe99668a11438ff8684dcf18bc2af","observation_id":"3154c57a-e47d-4f12-87b5-32903bc86a5c","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"}},{"citation":{"cited_paper":{"arxiv_id":"0907.3631","last_updated":"2009-07-21T12:33:36Z","snapshot_observed_at":"2026-08-15T05:43:13.454234Z","submitted_at":"2009-07-21T12:33:36Z","title":"Interchanging distance and capacity in probabilistic mappings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0907.3631","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:0907.3631 , 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":87,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/0907.3631","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:dc6c6a6b67060dc8466192bfa4e65673757382f4daa56ca54301847ecec12d40","observation_id":"434d62f8-87de-45f7-a15d-c408180cb5e0","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms , pages=","venue":null,"work_id":null,"year":2001},"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":88,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:1d10661005683128405a62882f06b8b4918f1308273d7d53ae0e70a0378e64ee","observation_id":"59948371-5633-4784-94d3-9787663f346f","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":null,"year":2006},"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":89,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:3aa7248891ddf7c5e327371075dfed891aa55ea170ea4afb018cb21e6f7cf5e8","observation_id":"b293ab14-9b97-4ae7-85a1-60e5904bd7a3","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Unpublished Manuscript, available from http://www","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":90,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:f039a84582944ab4fdb1a709929ba3def6d60c40d109f43a485eddd9b7434be9","observation_id":"71f0cced-1f4c-4d44-bb18-e3e3ac7f6c92","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"SIAM Journal on Discrete Mathematics , volume=","venue":null,"work_id":null,"year":2006},"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":91,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:bd9ead1c69a3f3b10d506eb0b2adffdd33b16e1035022b14b6e764dfc96fb78a","observation_id":"dbc403e3-02d5-48b5-bcbf-5319c1950ff5","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2000},"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":92,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:711ef21d2cb07ef3e157090bfb6881cd5aa10b727a3c84f141c230ea1078dc8e","observation_id":"858a339a-7914-4310-bdb1-895e8bb16c92","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Foundations of Computer Science, 2006","venue":null,"work_id":null,"year":2006},"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":93,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:91c69dce66e972f7289f116e189125cca528417d3e2da7328c5d1b4b5b465b0e","observation_id":"721d336a-e2e7-454e-acce-ad036b9c1979","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2015},"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":94,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:ee21bcd2036aa2bb1ac0718e83853811a4ac61ecc7d6a05a0cbda3fd4e55609e","observation_id":"f1148cb6-afa4-420d-a55a-e3d71a3dc165","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2018},"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":95,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:1f3eb404ecdbc79bf9e79b08a441cfafd9b0a78b7b7dfc82efd2a4464daaf81e","observation_id":"1d1d83aa-f0c1-44df-9245-a3332e81c0c3","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2018},"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":96,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:abe76693f3fabc65f52a2a56cd5ecd0b49a71c64620c97312d7ded98cf69c108","observation_id":"c98f6e4c-9ead-4950-ac5b-0be40ee520e0","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"}},{"citation":{"cited_paper":{"arxiv_id":"1809.00942","last_updated":"2018-11-06T14:17:20Z","snapshot_observed_at":"2026-08-14T18:33:17.868144Z","submitted_at":"2018-09-04T13:29:28Z","title":"Relaxed Voronoi: a Simple Framework for Terminal-Clustering Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.00942","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1809.00942 , 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":97,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1809.00942","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:9ca890a0f3ce14220e624557fcfb573cd50d9742c5cd552a13c3a1ecd0360ae0","observation_id":"e3c68bff-21ee-40fd-92c5-5c4c22e4d6c2","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Preprint , 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":98,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:1752d0ad3cfbb93a7b5436e7ce8f2ffa005e98388eb89299da16fb156ed9693c","observation_id":"1150f5fd-f20b-408e-9408-d898eca2eda1","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"}},{"citation":{"cited_paper":{"arxiv_id":"1604.08342","last_updated":"2016-04-28T08:31:45Z","snapshot_observed_at":"2026-08-14T21:59:44.830688Z","submitted_at":"2016-04-28T08:31:45Z","title":"Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.08342","snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"arXiv preprint arXiv:1604.08342 , 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":99,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"cited_paper":"/paper/1604.08342","citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:ce437475802f82c0e5088e24f04e03cf92aad35e6a428c203636154fbd8f9be1","observation_id":"e52f38ab-4a01-464a-813b-32817e6f4c1c","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T06:25:09.946876Z","title":"Discrete & Computational Geometry , volume=","venue":null,"work_id":null,"year":1993},"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":100,"source":"arxiv_source","source_observed_at":"2026-07-12T06:25:09.946876Z"},"links":{"citing_paper":"/paper/2607.02883"},"observation_digest":"sha256:65113557506a89f43ca5065a74ea937a1b5b0c52e9f815eb1f196ac7e09309c6","observation_id":"ccb90a55-aca2-46b4-8c10-a36b1334a1a3","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"}}],"paper":{"arxiv_id":"2607.02883","last_updated":"2026-07-03T02:29:36Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":159},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 100 of 159 outbound references and 0 inbound Pith citation observations for arXiv:2607.02883."}