{"as_of":"2026-08-15T19:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0b352dda6e2758c83877c6195d53385b32aa43658415b6c1d92bc56a7e283052","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T01:40:40.019678Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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.25811/citation-record","integrity":"/paper/2607.25811/integrity","json":"/paper/2607.25811/citation-record.json","paper":"/paper/2607.25811"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.878479Z","title":"Reachability preservers: New extremal bounds and approxi- mation algorithms.SIAM Journal on Computing, 53(2):221–246, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.878479Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:f315129919cf7ca0f82d597607afd6db1421f5aa3c5f006c7a77610f306108bc","observation_id":"ddd825da-471c-4f09-8d71-f5b9ef9c06bf","resolution":{"observed_at":"2026-08-01T01:40:39.878479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.881481Z","title":"New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints.European Journal of Operational Research, 212(2):263–276, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.881481Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:a3ea19827f0e8044df23445addf3637375766e81d1966441031d13e5f9bf11d3","observation_id":"1de1c36c-18e4-4966-9281-72e8ddfa277e","resolution":{"observed_at":"2026-08-01T01:40:39.881481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.883823Z","title":"Ramos, and Mar- tin Skutella","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.883823Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:e262b484bee13a48f64eb40db098f063353f3982583c7cf103eb01ff38b6d5dd","observation_id":"9fb4f927-350d-46c1-b630-dbc73c9e40c0","resolution":{"observed_at":"2026-08-01T01:40:39.883823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1110.0484","last_updated":"2013-07-15T14:34:54Z","snapshot_observed_at":"2026-08-15T12:36:43.704264Z","submitted_at":"2011-10-03T20:16:18Z","title":"Structure and Dynamics of the Globular Cluster Palomar 13","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1110.0484","snapshot_observed_at":"2026-08-01T01:40:39.886318Z","title":"Buy-at-bulk network design with protection.Mathematics of Operations Research, 36(1):71–87, 2011.doi: 10.1287/moor.1110.0484","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.886318Z"},"links":{"cited_paper":"/paper/1110.0484","citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:bf0dc15310dc8aa2bea8a0450f69885390d25667e10d9743e62ebc7934843efc","observation_id":"6092f559-4e73-400d-b5ef-1a4e1d7b6a02","resolution":{"observed_at":"2026-08-01T01:40:39.886318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.888971Z","title":"Using a hop-constrained model to generate alternative communication network design.ORSA Journal on Computing, 4(2):192–205, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.888971Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:6074672430b3b25b6539cbdebe0608750d08039687e1c40d496537579ae2aac9","observation_id":"56e4bab3-2682-4351-acb9-b8262f8cd4af","resolution":{"observed_at":"2026-08-01T01:40:39.888971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.891281Z","title":"Bateni, M","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.891281Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:fbc8c9057021c94b00a36a85542c1d4a0140bd960c2e96168ee21f78822edd0f","observation_id":"02821886-a2be-43ff-80ef-7dab3c9d8193","resolution":{"observed_at":"2026-08-01T01:40:39.891281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ic.2012.10.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approximation algorithms for spanner problems and directed Steiner forest","venue":"Information and Computation","work_id":"1dabd274-2953-4713-b908-4dc974e5ad9f","year":2013},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.893960Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:45879c746ae9714a4d4286748ee875f451c5169b17846584b707e3073d47293e","observation_id":"1502bda0-bead-45ef-895b-f5d735f03445","resolution":{"observed_at":"2026-08-01T01:41:33.183160Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.896180Z","title":"Near linear time(1 +ϵ)-approximation for restricted shortest paths in undi- rected graphs","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.896180Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:4eb868265bf5db8394487ad9d0369e7815976e0d8850de7af63139aafffc5607","observation_id":"2fe32cb3-f086-450b-92ad-abc6968d3adf","resolution":{"observed_at":"2026-08-01T01:40:39.896180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.898165Z","title":"AnO(nlogn)approximation scheme for Steiner tree in planar graphs.ACM Transactions on Algorithms (TALG), 5(3):1–31, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.898165Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:614c75fb046fc62e4f729d896798c13fd5ee78c93f7c338f7f35afdcc096fb78","observation_id":"454453a4-bb50-453b-a53b-fcb097fe2523","resolution":{"observed_at":"2026-08-01T01:40:39.898165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.900368Z","title":"Approximation algorithms for directed Steiner problems.Journal of Algorithms, 33(1):73–91, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.900368Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:000f2793dddfcc56c006ae0ba49412475a11b0838217e30c8ba0483f70a9d5e1","observation_id":"a32466c1-df2f-4141-aa29-553847cc918c","resolution":{"observed_at":"2026-08-01T01:40:39.900368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/090750317","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Chekuri, M","venue":"SIAM Journal on Computing","work_id":"95f2dee3-35af-4557-b425-89e7cd5286b0","year":2010},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.902612Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:7ab4fa2fe6414f7a89bcaa389900e585b2da24aafa84e05fa5f7e5c95f8c218c","observation_id":"ec4daf32-1780-4214-914c-f81dd84d30f5","resolution":{"observed_at":"2026-08-01T01:41:33.042106Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.905068Z","title":"Set connectivity problems in undirected graphs and the directed steiner network problem.ACM Transactions on Algorithms (TALG), 7(2):1–17, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.905068Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:4dcbbc9fbc7f02302879187d7295e309e1c1e2f4e1f32c4260186f6671646196","observation_id":"c20c7f91-a5eb-4941-95fe-1a8367d58afc","resolution":{"observed_at":"2026-08-01T01:40:39.905068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2024.41","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approximation algorithms for hop constrained and buy-at- bulk network design via hop constrained oblivious routing","venue":"arXiv (Cornell University)","work_id":"f971d55a-7190-4705-85d8-ca1236ca0a21","year":2024},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.907012Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:90f23365be2bbe0bdaf770be39c35826f55af11c453ced6676e889f8217544ad","observation_id":"be251b21-6e6b-4ce0-8124-79cb656ffadc","resolution":{"observed_at":"2026-08-01T01:41:32.756283Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.67","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A polylogarithmic approximation for Directed Steiner Forest in planar digraphs","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"277c4ca5-ee8a-4bc8-a232-29c267ae047c","year":2025},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.909088Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:3bbc1758b2c2d5ffcba474211ba555adcf14434db3b1c52e58bb44e90011eb2d","observation_id":"92b3bbb0-9b54-4a9e-b5be-ab5ec638d0d4","resolution":{"observed_at":"2026-08-01T01:41:32.549456Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.911069Z","title":"Node-weighted multicut in planar digraphs.arXiv preprint arXiv:2601.20038, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.911069Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:acc32650944b364f48fb942986079ed998f2646804a1ae1409e04a7eff63e6f0","observation_id":"1b7b41aa-1bf1-4c0c-94bf-0831e46a05ff","resolution":{"observed_at":"2026-08-01T01:40:39.911069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.913002Z","title":"A polylogarithmic approximation for buy-at-bulk network design with protection","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.913002Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:4c831d14fcf3acb96e7ee66aa08cbe407eab672ebb2e81bb8cf883122b1a3a56","observation_id":"470adc11-98d1-4a68-b095-00d65facba35","resolution":{"observed_at":"2026-08-01T01:40:39.913002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.914901Z","title":"From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.914901Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:67dfd95603a7d6cb7e392ec56c12aa530710eaa71f12c87423f396f58d127cce","observation_id":"bff0f303-b08d-45ea-9700-77bea249070b","resolution":{"observed_at":"2026-08-01T01:40:39.914901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.916884Z","title":"A recursive greedy algorithm for walks in directed graphs","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.916884Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:bcfe193b5a4a93b04ef1f8b45e58fb024ed0c98bd20c2f07f5912378abee7991","observation_id":"516f0af1-af64-4369-9d47-9602b0730322","resolution":{"observed_at":"2026-08-01T01:40:39.916884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.918835Z","title":"Approximating span- ners and directed steiner forest: Upper and lower bounds.ACM Transactions on Algorithms (TALG), 16(3):1–31, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.918835Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:53c2b5df7918799bccf8d733ea575f204c2bdf31eda1e1ea6b9bc08097e59dac","observation_id":"9c3c4c17-2212-42e8-bf31-28935ac1b25a","resolution":{"observed_at":"2026-08-01T01:40:39.918835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.920875Z","title":"Bypassing the surface embedding: approximation schemes for network design in minor-free graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.920875Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:097719b8eb365a917a9ff5aa968f0b209162d474701a601a14f52c408c647020","observation_id":"a2d25338-b88d-4414-9c84-a514be0f0a20","resolution":{"observed_at":"2026-08-01T01:40:39.920875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0167-6377(98)00029-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The 2-hop spanning tree problem.Operations Research Letters, 23(1):21–26, 1998","venue":"Operations Research Letters","work_id":"52279603-a87c-442a-a53e-2793e0d6e77f","year":1998},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.922874Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:72bcb87289db08f8c283a2ccba6e7d8e1649728700483070918f6365fa8f9878","observation_id":"cab2a914-eec0-467c-b40f-16df317d66cc","resolution":{"observed_at":"2026-08-01T01:41:32.434793Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.924854Z","title":"Node-weighted Steiner tree and group Steiner tree in planar graphs.ACM Transactions on Algorithms (TALG), 10(3):1–20,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.924854Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:5dd895829fd007cd3112f392fab9d8c380e7744246ea88ca3166b7b8a565756c","observation_id":"48f45ba0-cb2e-44d9-9848-ae338625603f","resolution":{"observed_at":"2026-08-01T01:40:39.924854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2818375","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Label cover instances with large girth and the hardness of approximating basic k-spanner.ACM Trans","venue":"ACM Transactions on Algorithms","work_id":"01f723ae-3dc2-4767-a61a-490740499ffd","year":2016},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.926957Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:5618c440dbb45fed6ed162a05ac0b4838a5fb08d4d0d4092a8ed2d6d957aa9cc","observation_id":"aaf7fce1-84dd-4244-8e90-96293e30e57f","resolution":{"observed_at":"2026-08-01T01:41:32.304284Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.929090Z","title":"Design networks with bounded pairwise distance","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.929090Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:1f5450e4dccebc21936cda85c1124c60ca58700a22da5430ef2b507c683bf29b","observation_id":"9bd8349a-b97f-49a0-b454-4b959b4db0f0","resolution":{"observed_at":"2026-08-01T01:40:39.929090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.931172Z","title":"Improved approximation algorithms for Directed Steiner Forest.Journal of Computer and System Sciences, 78(1):279–292, January","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.931172Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:f82f6b5235d85889cea89d05ca37b5ac33cd622d31f63fd7dc35c0fff9ed35f3","observation_id":"f627391c-8872-49df-b10b-403549cac584","resolution":{"observed_at":"2026-08-01T01:40:39.931172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.937463Z","title":"Linear programming hierarchies suffice for directed Steiner tree","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.937463Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:627ca5e86ef2b0ecf59b2e8dc1b3dfd78e4a3169926f3be08389ca029c00f0e9","observation_id":"5aa23133-d852-48c6-b026-2871aeebb34f","resolution":{"observed_at":"2026-08-01T01:40:39.937463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.939656Z","title":"A constant-factor approximation for quasi-bipartite directed Steiner tree on minor-free graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.939656Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:82ec51f064a68ab8bb3fc055f915d828ca836839537cd0a3e28f07ec32d26a63","observation_id":"65a12122-9e1e-4214-9332-9525cc3da0ae","resolution":{"observed_at":"2026-08-01T01:40:39.939656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.944357Z","title":"AO(logk)-Approximation for Directed Steiner Tree in Planar Graphs.ACM Transactions on Algorithms, 21(4):1–14, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.944357Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:48881649853fc3ceffd04ea5d80e943c00c2a6cce6d5de66f672ab6ce155cd70","observation_id":"d17f3ae3-f68c-47e8-a275-bbd9d3b1278d","resolution":{"observed_at":"2026-08-01T01:40:39.944357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.948623Z","title":"Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems.Mathematics of Operations Research, 47(2):1612–1630, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.948623Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:97a0f3fe430c11c8d57694eea686eea5718f830cd49a7f97c3d1c60abb179dc4","observation_id":"aba20104-9a8b-4c55-9cb3-3cecff31a9d9","resolution":{"observed_at":"2026-08-01T01:40:39.948623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.950667Z","title":"Efficient computation of delay-sensitive routes from one source to all destinations","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.950667Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:f7bc996311951805a2f3b6e37d6f807565c032612c9c2316246ed1ce1a1bc782","observation_id":"b7ba2ce0-f8ec-4ab5-8a95-a4296ad81b32","resolution":{"observed_at":"2026-08-01T01:40:39.950667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.952680Z","title":"Preliminary version in Proc","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.952680Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:0fec1aca226c3bf0d54f4ff2bd4f0e29043b92e0d3da7e0c9b5ec3edb811de0b","observation_id":"260adb78-cda6-482a-8d93-7639f96fd855","resolution":{"observed_at":"2026-08-01T01:40:39.952680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.954823Z","title":"Directed buy-at-bulk spanners","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.954823Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:f016189b75736b14ac090d34cc27cd74cbabe8e1be0a704b99d21e98113b4481","observation_id":"c2ac51a1-180f-41a7-8dc0-c178f24e29d0","resolution":{"observed_at":"2026-08-01T01:40:39.954823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.956867Z","title":"Ellis Hershkowitz, and Goran Zuzic","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.956867Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:f37217424bed345f37f3db439049c26e25d3fd669dc5f0380a68faa0740362ea","observation_id":"300dbe15-e16b-47b8-8aad-69ba2ffbab15","resolution":{"observed_at":"2026-08-01T01:40:39.956867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.958900Z","title":"Approximating buy-at-bulk and shallow-lightk-steiner trees.Algorithmica, 53:89–103, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.958900Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:078ded373677f5074ab45899bfb046c685739cd69ed0e54588e684c1b13fe248","observation_id":"0ff56e21-8021-47ec-bc3f-78b2a6d3be69","resolution":{"observed_at":"2026-08-01T01:40:39.958900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.960974Z","title":"Polylogarithmic inapproximability","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.960974Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:49ce6ac775a2848c9bbab5227b60d0a21d03ee58aef8b2f8949b21861cd7d772","observation_id":"3d25f582-cabf-408a-8875-feaf84a074e6","resolution":{"observed_at":"2026-08-01T01:40:39.960974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.962869Z","title":"Approximation schemes for the restricted shortest path problem.Mathematics of Operations research, 17(1):36–42, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.962869Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:8637478a1971cdefcbab521b08086273c802850f92256771fbc1e7e7a5a40036","observation_id":"1862b7a2-0c3d-4eae-8a68-6e5f02e52093","resolution":{"observed_at":"2026-08-01T01:40:39.962869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.965060Z","title":"Planar length-constrained minimum spanning trees","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.965060Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:3a815365cbffcd5a8b4760077dc32114e375b0d71e760d7d89aed44171e48954","observation_id":"df1c27e5-1871-4be0-b8a7-af271c9f03f5","resolution":{"observed_at":"2026-08-01T01:40:39.965060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978315.25","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simple length-constrained minimum spanning trees","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"f245b645-5561-42b9-b5a9-370e342664e8","year":2025},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.967089Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:089c6226e1b580f69c6d1d42885b8e05c842f603db20aaf1fb4cdfe7987fa138","observation_id":"30a5866b-ace5-435e-98c8-5e221136c903","resolution":{"observed_at":"2026-08-01T01:41:32.030589Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.968980Z","title":"University of Illinois at Urbana-Champaign, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.968980Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:c460c428af9bc69c746e7596f27ca625b43f35f3be727e99b1e2a1f1b17b49ff","observation_id":"895cac8f-69ae-4cad-9d0f-71ba77eb7270","resolution":{"observed_at":"2026-08-01T01:40:39.968980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.971153Z","title":"WH Freeman, 1979","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.971153Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:5d07c01269d693ac500d9221793e66eb558e31a6deeb65a16cabe3a8cc1be6b1","observation_id":"6a4a3211-e361-42b2-a0f2-0d23d9b39189","resolution":{"observed_at":"2026-08-01T01:40:39.971153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.973407Z","title":"The shortest route problem with constraints.Journal of Mathematical analysis and applications, 14(2):191–197, 1966","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.973407Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:0a8b2dca3932cc14e5d24b4db9db3f39107dc6c8b841fe763852a822650a2eb3","observation_id":"902ad9be-44c0-466a-8e0e-72bc1d71122a","resolution":{"observed_at":"2026-08-01T01:40:39.973407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.975599Z","title":"Approximate hierarchical facility location and applications to the shallow steiner tree and range assignment problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.975599Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:a596cd2700e9e8a92b4cb3ab53ccb3378702bc09d6c6b78f4d1658766f5d2a49","observation_id":"07ecaada-45bb-4051-9458-6900ac4b8ffd","resolution":{"observed_at":"2026-08-01T01:40:39.975599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.980068Z","title":"Embeddings of planar quasimetrics into directedℓ 1 and polylogarithmic approximation for directed sparsest-cut","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.980068Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:76f95c21fd510cb241664113d5e8284b59f83233092e36fb9f24967cef31ff3f","observation_id":"bf51c75f-741b-4b71-b23b-3b6e85976737","resolution":{"observed_at":"2026-08-01T01:40:39.980068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10878-014-9774-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reza Khani and Mohammad R","venue":"Journal of Combinatorial Optimization","work_id":"57f43948-f7ce-4483-b1c9-ea05b20d8ca6","year":2016},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.981877Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:fd065fb3e12a34706f06f78ae60cf16612e505bcdbe256fbe99d5be9c87e5925","observation_id":"a7b34a5a-542f-4253-adc3-580b563137c3","resolution":{"observed_at":"2026-08-01T01:41:31.942990Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.983977Z","title":"Approximating the degree-bounded min- imum diameter spanning tree problem.Algorithmica, 41:117–129, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.983977Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:d753a31073db4bc056b5d0cd3f172a8367b3a8effda61be62d68f673cb2b7b05","observation_id":"6363a07d-c3e1-4255-9610-84eea15e6212","resolution":{"observed_at":"2026-08-01T01:40:39.983977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2011.04.013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approximating some network design problems with node costs","venue":"Theoretical Computer Science","work_id":"404a6038-f4d3-464a-bc1b-e7b2b61ab80d","year":2011},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.985958Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:a3fb44df2789924f804b7db4e4c2ed6c90829b47222c7c488712f5015f907496","observation_id":"d38e1fd6-bb65-4839-82d1-721af0076d70","resolution":{"observed_at":"2026-08-01T01:41:31.840930Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.988116Z","title":"Approximating shallow-light trees","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.988116Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:395dd2f9767fce572d29ac3652c242f9410328c2f2312f62133d69c438f3e985","observation_id":"8269fe50-43fd-48ca-bca1-7b8a6f6e622c","resolution":{"observed_at":"2026-08-01T01:40:39.988116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.990123Z","title":"On the integrality gap of directed Steiner tree LPs with relatively integral solutions.arXiv preprint arXiv:2412.10744, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.990123Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:70b7c786cafb2eabc26a6a400b7818f245454f62aac305404a239ef923d257be","observation_id":"262e6be1-2617-46a5-88ff-bc7bb19f22c4","resolution":{"observed_at":"2026-08-01T01:40:39.990123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.992051Z","title":"Polynomial integrality gap of flow LP for directed Steiner tree","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.992051Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:cb22aae1f33405e6cc4dde35b6fb46a818d9597fbf1b8088343d0372ee89f948","observation_id":"ba82cad3-9015-4afe-9f14-3a5150231f7b","resolution":{"observed_at":"2026-08-01T01:40:39.992051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.994004Z","title":"Lipton and Robert Endre Tarjan","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.994004Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:7d905220f337a2bcba39b5874db9b0beaebbfafb5738a92a3fc3627f4956b788","observation_id":"e37bc868-1adb-4099-91ff-e7d6d601c8f5","resolution":{"observed_at":"2026-08-01T01:40:39.994004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.996267Z","title":"A simple efficient approximation scheme for the restricted shortest path problem.Operations Research Letters, 28(5):213–219, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.996267Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:487f8a25d85add8f4218984fccdd05e444e26980f142e90ae1734b25298c5cee","observation_id":"1c2c1da1-a808-4421-8501-1a161f09fc36","resolution":{"observed_at":"2026-08-01T01:40:39.996267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.998287Z","title":"Bicriteria network design problems.Journal of Algorithms, 28(1):142–171,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.998287Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:e1ac91e8ef746f8b6fb2757ed5b8c8293fc3f8265a527f6e9d002e5c3aa79935","observation_id":"1b0902a6-6324-4591-8b51-3c40503b9d16","resolution":{"observed_at":"2026-08-01T01:40:39.998287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:40.002589Z","title":"New formulations and solution procedures for the hop con- strained network design problem.European Journal of Operational Research, 148(1):126–140,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.002589Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:a55fa392cae43ec2172ee68de881ee4d0aeb0e9de2a3a9cdfef7c413e14dff51","observation_id":"138935d0-dadb-455e-b9db-51629e654c99","resolution":{"observed_at":"2026-08-01T01:40:40.002589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:40.007058Z","title":"Rapidrumorramification: approximatingtheminimumbroadcasttime","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.007058Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:ac8f8eb6d2fe79f28227dec0326cbb8f3fb3cc444a0f7d67dcf5908b93629910","observation_id":"c39a7505-7098-4750-887c-e3dd098f5390","resolution":{"observed_at":"2026-08-01T01:40:40.007058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:40.013511Z","title":"Compact oracles for reachability and approximate distances in planar digraphs","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.013511Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:cc55e812d4821935332cefee7c4adc541d316918456b75b5a1f73d03da1fa458","observation_id":"54053264-daed-407c-ae14-3b547fe20184","resolution":{"observed_at":"2026-08-01T01:40:40.013511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:40.015530Z","title":"Approximation of pareto optima in multiple-objective, shortest-path prob- lems.Operations research, 35(1):70–79, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.015530Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:16643640459c1d431049f9cc2cabeaf80ed894ac16c5330a7df7098668f7c049","observation_id":"e8062331-15e9-41a4-a8f3-98cd894bd236","resolution":{"observed_at":"2026-08-01T01:40:40.015530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:40.017635Z","title":"A series of approximation algorithms for the acyclic directed Steiner tree problem.Algorithmica, 18(1):99–110, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.017635Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:708ab7ceda791b6204dd841e8d47e8a0037898a371de2959ea366decb7ce3c18","observation_id":"89ebb591-af68-4496-bcf7-ada8f4796e3d","resolution":{"observed_at":"2026-08-01T01:40:40.017635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:40.019678Z","title":"On directed Steiner trees","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.019678Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:99452784b2dfe9f7a6a276b9254458e2ea526968429cb98871e9c3f0e5701f51","observation_id":"2422aa36-b192-452b-a8dd-0bf9552ff22e","resolution":{"observed_at":"2026-08-01T01:40:40.019678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:40.000491Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.000491Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:dc2237570960635b25d6b93c8bd301ca26185609c9424312303043dbfa690eef","observation_id":"a9e3d2c5-e300-4b73-9548-339a5b448f36","resolution":{"observed_at":"2026-08-01T01:40:40.000491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0377-2217(02)00366-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"European Journal of Operational Research","work_id":"b83d9cb9-a977-43a6-8124-de389b6b0979","year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.004826Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:99fe68a39d0f929814f1a04d8f63ef53d278e8b92a8e798f414f3983359bc733","observation_id":"cbbc4594-2623-4431-b808-8897602f6d72","resolution":{"observed_at":"2026-08-01T01:41:31.756269Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.977820Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.977820Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:c8b5f9e98152490d481ef20fe494acdf10e37f9ffa1692b749609d0aea948a4c","observation_id":"ebd59fbb-4ba5-4425-a8a8-748b07f756cf","resolution":{"observed_at":"2026-08-01T01:40:39.977820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1111.5473","last_updated":"2012-06-11T22:50:52Z","snapshot_observed_at":"2026-08-15T04:28:02.604739Z","submitted_at":"2011-11-23T12:21:33Z","title":"Directed Steiner Tree and the Lasserre Hierarchy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1111.5473","snapshot_observed_at":"2026-08-01T01:40:40.011512Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:40.011512Z"},"links":{"cited_paper":"/paper/1111.5473","citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:a4963a0b27042f9eec15677b10a326860ab7fe3909da9dbf21e0de31f447b282","observation_id":"6c89ce21-7394-4009-b5e2-ed23c14d15f0","resolution":{"observed_at":"2026-08-01T01:40:40.011512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2011.05.009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Computer and System Sciences","work_id":"760b7f3b-08f0-4ded-8289-ad7ed505c661","year":2011},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.933354Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:877ea1c3d4f7f376018b4a6d27daf70c0cdab0a9a6e6c4a5e3ddf731f8fdecdd","observation_id":"56926f9e-4061-4b2e-834f-b835a571e8cc","resolution":{"observed_at":"2026-08-01T01:41:32.237453Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:40:39.941971Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T01:40:39.941971Z"},"links":{"citing_paper":"/paper/2607.25811"},"observation_digest":"sha256:aae60f6d26b74a0ef74a9c030bfab868f3392c9201d2b1462f807d2ce2f3f02a","observation_id":"fbc5e486-5d82-4bff-af77-0ef71644765b","resolution":{"observed_at":"2026-08-01T01:40:39.941971Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.25811","last_updated":"2026-07-28T14:57:36Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T17:41:42.098162Z","submitted_at":"2026-07-28T14:57:36Z","title":"Length-Constrained Network Design in Planar Digraphs"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":64},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2607.25811."}