{"as_of":"2026-08-11T07:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0b41c68ba27a98dd51e552e30a89f359349c10cf57d60979498ef0edb27e7bbc","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T10:27:06.228815Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2604.26882/citation-record","integrity":"/paper/2604.26882/integrity","json":"/paper/2604.26882/citation-record.json","paper":"/paper/2604.26882"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0191-2615(79","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8549578d-d91e-4892-a8e0-77f239c7d910","year":1979},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:92e03d44662c909fd2e7eac20ba01571c637b3eb29e509badcada992e950ad25","observation_id":"314559c6-2771-4f22-81d0-8fbb789409c7","resolution":{"observed_at":"2026-05-09T04:10:06.936561Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-93112-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Börner, M","venue":"Lecture notes in computer science","work_id":"dad4c8ad-caa2-45aa-af23-3f8753e5c4ae","year":2025},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:7ab89eb32dc612b74152accf792ec880e6de4174044a9d7a6e60296c13eef942","observation_id":"fef61601-e3ae-420b-a781-fcff3fade582","resolution":{"observed_at":"2026-05-09T04:10:06.929689Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-21527-8_2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"f5b91cab-28a5-4a64-b4fa-dce14c8b3eb3","year":2022},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:1fbfc427d901f4174440446ed04b62cb1d7c05588bd0e2c921ebc7939a2d105b","observation_id":"287c532f-d5e9-47d7-aaf0-c2fdd6cbfc6c","resolution":{"observed_at":"2026-05-09T04:10:06.958783Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tct.1970.1083100","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Chou and H","venue":"IEEE Transactions on Circuit Theory","work_id":"47d18de7-d118-47a3-a5ba-409502006d5f","year":1970},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:1cbe41b8f6d3a91ccee84f7b29dff986a51fb88c562d9b80d077b45385927db8","observation_id":"3d6ec7c4-c4b3-428d-a54f-93371dc503c4","resolution":{"observed_at":"2026-05-09T04:10:06.910334Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/15m1016461","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Optimization","work_id":"3bfa5d4c-b7c9-4b96-8d49-9bfe0a4297b3","year":null},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:166afbab7aaefe0a8f13d738797157eb6b4cac6b63f9cc1729e78e95aa2e0f4e","observation_id":"2e0e8d64-8825-4537-8304-7290036484a2","resolution":{"observed_at":"2026-05-09T04:10:06.949245Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/050645452","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Minimizing Effective Resistance of a Graph , Volume =","venue":"SIAM Review","work_id":"202dd99a-7ca8-45c0-9c27-415257e6a9a1","year":2008},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:fa05edb7e00b97b8b6440e47020119c86adeaba3fb0cbecee5c9cf7a9b5bfc65","observation_id":"d815328e-cd61-4e5f-b248-2c8e7fb3ac6b","resolution":{"observed_at":"2026-05-09T04:10:06.923935Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s101070050077","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Mathematical Programming","work_id":"fa361ab3-58d6-4c8d-9117-3069e28d9434","year":2019},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:c9cd9a06ad25910d211eac566388e400f94a55ed162369393eddc40ea5735a0d","observation_id":"3685c4fb-6fb2-4570-acc0-5ff3695c64d7","resolution":{"observed_at":"2026-05-09T04:10:06.946771Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00284","last_updated":"2019-11-02T11:11:19Z","snapshot_observed_at":"2026-07-06T06:07:12.295602Z","submitted_at":"2017-11-01T10:55:17Z","title":"Improved Approximation Schemes for the Restricted Shortest Path Problem","version":2},"cited_work":{"arxiv_id":"1711.00284","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1711.00284","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Holzmüller","venue":null,"work_id":"6afd83c4-2bcb-494c-be3b-bdc147797f79","year":2019},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"cited_paper":"/paper/1711.00284","citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:cc8033aaaa4fe75523d320fa0fba7aa6effbe6542e052913f373eb18e1377b73","observation_id":"68f75a01-a793-4f15-94db-b64baec7802a","resolution":{"observed_at":"2026-05-12T09:36:26.233658Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10589-015-9756-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Computational Optimization and Applications","work_id":"f2b43f06-bf09-4d5f-a42a-3c3cb6f852f1","year":null},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:aaff71dac3524fb1343638e53c53d94c304600f8e85bde7c49d01fa83506db22","observation_id":"192874e6-56f8-43f9-91fc-850d4f36afd9","resolution":{"observed_at":"2026-05-09T04:10:06.916008Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/050641776","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Discrete Mathematics","work_id":"c4bd2b0f-ad7e-4d8e-ac02-8a292024479b","year":2008},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:01afb8175300be5fbaf569c82ef8d0b0295efd778245ac1edf200d4bce86e0a5","observation_id":"3cdd8783-6a68-4d4d-a516-b9d4d56e2316","resolution":{"observed_at":"2026-05-09T04:10:06.939516Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01580580","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Mathematical Programming","work_id":"c12e0e1e-efea-4699-8d22-77e953a1bc2b","year":1986},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:bd38e5cbaf32ecac6bac17d0e5a6887f68ba4edc418adb4839d1306831fdfd55","observation_id":"87b78380-77bd-461a-bca6-690e1ae703a1","resolution":{"observed_at":"2026-05-09T04:10:06.942680Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/net.10068","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"24 Network Design for Potential-Based Flows 35 M","venue":"Networks","work_id":"698f6373-c27d-4b38-8b13-749173f27bb5","year":null},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:cc5c40594e47c74f6779629def850e8c34f135752f5685771eb5001a3784238a","observation_id":"896a1760-baa5-4b14-b6c6-2cc6ab4b532a","resolution":{"observed_at":"2026-05-09T04:10:06.913323Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/110827387","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Optimization","work_id":"000e448a-0ba5-4b35-97b0-2388daa6ca5c","year":2013},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:5304d5cbe097daa17c4896adfa97334d56820c62446f911770b3bd67c7cbc4cd","observation_id":"070367d5-1c83-4a05-9a48-fe39852e78ff","resolution":{"observed_at":"2026-05-09T04:10:06.926850Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/moor.17.3.581","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sridhar and R","venue":"Mathematics of Operations Research","work_id":"0d18805d-3f59-4966-9964-fdf03f2a3f66","year":1992},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:4baa5674734668e44b692767654429bba8714b7dd5e28b19d9a23d4668f42295","observation_id":"7330434d-ec75-459f-beff-edc22f13255a","resolution":{"observed_at":"2026-05-09T04:10:06.952135Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":14,"verified_fuzzy":0},"total_outbound_references":14},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2604.26882."}