{"as_of":"2026-08-18T01:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:311c783a4bf6cf68322cbd7d6c8b4415f49ea7262ddd243085e5dc31b4d026e9","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:48:13.535589Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2507.07894/citation-record","integrity":"/paper/2507.07894/integrity","json":"/paper/2507.07894/citation-record.json","paper":"/paper/2507.07894"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:13.355676Z","title":"Network Design and Transport ation Planning: Models and Algorithms","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.355676Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:a98668aabfe144ddc61da88fc043bb936eedebcf8cf0519294d9744397118812","observation_id":"c0501edc-8060-4d16-8bba-45577ac69c2e","resolution":{"observed_at":"2026-08-06T18:48:13.355676Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.321209Z","title":null,"venue":null,"work_id":"181d74cf-d75d-49b9-ad2e-de9f76f81113","year":1976},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.362520Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:587e7007f874ebf87bc7008be92bec13ea74a12822c505d7d2f0a183614813cd","observation_id":"8ef898de-4cd6-4b52-8666-174b939377be","resolution":{"observed_at":"2026-08-06T18:48:14.327727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.301514Z","title":"Computational Complex ity of Discrete Optimization Problems","venue":null,"work_id":"22b0f228-5d47-4a77-9637-1f926d4c9de2","year":1979},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.372031Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:d9cafd3294d6003ec8506ad6b8c27aabc383f7ce3c6d4f8aacac6f42fbf3c33c","observation_id":"769b981d-1dea-40f4-83e7-8faa8cdf68f6","resolution":{"observed_at":"2026-08-06T18:48:14.308810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0601008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Worst-Case Analysis of Network Design Problem Heu ris- tics","venue":"SIAM Journal on Algebraic and Discrete Methods","work_id":"28b92d4e-93d7-46a7-92c9-c8cc9da14ce8","year":1980},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.377604Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:e8ba230d4c8c2cb6b0a1ee3803929861a1d2403698c00c1c9e5a4c1208607309","observation_id":"bfb81403-8b2f-48a5-aa27-9a69babba465","resolution":{"observed_at":"2026-08-06T18:48:13.729020Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.282155Z","title":null,"venue":null,"work_id":"0b38286f-4cf8-4564-953d-87c808cbe619","year":2021},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.383391Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:c9a3fd0176f246d99d55de7e3ec34b35159ffc7e0245c30e2597e85d658d0890","observation_id":"048a5604-f9b9-4048-95c8-bf4737b54a3c","resolution":{"observed_at":"2026-08-06T18:48:14.288720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:48:13.391358Z","title":"A review of urban transportation networ k design problems","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.391358Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:f97c04fc154b77849dbdb6f58ac0fb80f3560eef9d83c49c2948d899d9a46182","observation_id":"19fe0b23-cdea-4fbe-9016-daa39b157cb7","resolution":{"observed_at":"2026-08-06T18:48:13.391358Z","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/0377-2217(93)90143-b","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The multiobjective equilibrium network design pr ob- lem revisited: A simulated annealing approach","venue":"European Journal of Operational Research","work_id":"3d54e992-b597-4677-bd23-f9b7f17d95eb","year":1993},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.397780Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:0bd8565ce08ab4029ff7920fc29b4a9b3a882b616cda6a0750447cd4a1b115ec","observation_id":"6764fa00-37b3-4f5c-a846-12229689fc2b","resolution":{"observed_at":"2026-08-06T18:48:13.700646Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.cie.2019.02.025","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A multi-objective meta- heuristic approach for transit network design and frequency set ting problem in a bus transit system","venue":"Computers & Industrial Engineering","work_id":"d0b5a1aa-ca62-4c71-a4d4-71608de5670a","year":2019},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.404627Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:6feefe5024a046f3c5273c872c65a5430596c3ad391f14aaa35c17be659400c0","observation_id":"6be69711-24a7-4250-87bc-a73625321d18","resolution":{"observed_at":"2026-08-06T18:48:13.681007Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0377-2217(86)90180-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Multiobjective design of transportation net- works: Taxonomy and annotation","venue":"European Journal of Operational Research","work_id":"e009e6f5-f8c4-4477-bf9d-05b439e9699d","year":1986},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.409581Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:f765cf37146356d1994e01b7e81d87a41e419c948b7541e4494a85dd8585caae","observation_id":"7d967115-78de-49b2-8195-b3c161385416","resolution":{"observed_at":"2026-08-06T18:48:13.663746Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11116-006-7908-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The multi-criteria road network d e- sign problem in an urban area","venue":"Transportation","work_id":"11ff46aa-83e8-46d2-8402-f693e40e7905","year":2006},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.415173Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:3dbcfe23fa2aeeeb8a6e55281821fed8a91ac7f944cc22e92f18d7f30cedd124","observation_id":"6fd2c831-542e-49a9-a57b-1ab09cd4fce3","resolution":{"observed_at":"2026-08-06T18:48:13.643978Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:48:13.422868Z","title":"The Bus Rapid Transit investment proble m","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.422868Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:6ce517582e6f0e8bd8a7217cc5ba9fef61b8cec7426d486395002256303a2016","observation_id":"56f2a72e-8a57-45e5-ae9a-ca78c7f9d33e","resolution":{"observed_at":"2026-08-06T18:48:13.422868Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.262939Z","title":null,"venue":null,"work_id":"45795aae-e3a3-4d32-9d8d-51df579c7e00","year":2005},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.433021Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:6c33d22a89b5894f1aab37671317897d905a359ed11558726563c220c5ebabd4","observation_id":"4d1ab357-7164-4cb8-b200-2fd79bee7b97","resolution":{"observed_at":"2026-08-06T18:48:14.268955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.243063Z","title":"The c om- plexity of the network design problem","venue":null,"work_id":"72d904b3-076f-4839-8eb0-1ee92c16bc1d","year":1978},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.455892Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:ba9d6eb0e7cb48b0104e3bd0353c0b5ab40ffdec3e408e8c341ac926f6890ffd","observation_id":"21890abc-1cf8-4703-a864-8d9ac21fb516","resolution":{"observed_at":"2026-08-06T18:48:14.249924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:48:13.481901Z","title":"Reducibility among Combinatorial Problems","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.481901Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:39e5e14a2e51ad6d934f803e4d7d4bb4e7bc64d61d0f677610fab16628f18639","observation_id":"5ec15a59-cffb-44b8-91cb-2ed1b5231e5d","resolution":{"observed_at":"2026-08-06T18:48:13.481901Z","resolver_source":null,"status":"malformed_identifier"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.224946Z","title":null,"venue":null,"work_id":"fa1e74a0-e3ec-4ea7-8df9-369d959da8d0","year":1979},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.486863Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:4412b707d3935fddea89df011d814ea05fe0e916132f56d6dbdfab7f1127dd51","observation_id":"2a2b3db9-2ad3-4959-9dbb-230c32be193e","resolution":{"observed_at":"2026-08-06T18:48:14.230288Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:48:13.491935Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.491935Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:dbdaa39bcdc3d9c2f49fd5ac3f9a4919e5b65eef5776eb586c48a4f70563460d","observation_id":"60c111c2-873f-45f7-8ed2-9063256627c6","resolution":{"observed_at":"2026-08-06T18:48:13.491935Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.208607Z","title":"Efficient route planning on public transportation n et- works: A labelling approach","venue":null,"work_id":"1cbc1161-63ad-4ae2-9912-510d7f0eb572","year":2015},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.497223Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:4665e8d70291dbe45f760e8034b259de3c6ab6d44c60d257610b09adc0185117","observation_id":"0bf932a0-19a0-4296-b9ff-ebe492bbf007","resolution":{"observed_at":"2026-08-06T18:48:14.214108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1934.29833","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:13.924020Z","title":"Improved dynamic programming in con- nection with an FPTAS for the knapsack problem","venue":null,"work_id":"56f27142-79b1-498e-a2dc-d5bc76870522","year":2004},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.507921Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:0d2cad0741655f1b0401e446b7f8901048be7e65bbd53e60a393edeaa6635b4e","observation_id":"e46007a3-8c76-491b-ad0c-136747a32c9e","resolution":{"observed_at":"2026-08-06T18:48:13.933632Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.191561Z","title":"A fully polynomial approximation al- gorithm for the 0–1 knapsack problem","venue":null,"work_id":"42c10992-ca64-4050-a109-bc95d9a54cff","year":1981},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.513384Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:5445bf3e96b4e73938dcd9c5300119e1c7798fadb9d8528fe43c41c365e9f522","observation_id":"173e2065-ed3c-43b1-8d71-f2dc6437e340","resolution":{"observed_at":"2026-08-06T18:48:14.197239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/mnsc.48.12.1603.445","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Approximating Mult iobjec- tive Knapsack Problems","venue":"Management Science","work_id":"a8b52aeb-b7c7-405b-8421-0e280766fc1f","year":2002},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.518371Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:060465a06cf9b922864ccfaf3108a98c11c7b2bed65f0efb46b95dca1d45a0a6","observation_id":"8f12a08f-f9bc-4459-92b2-c9e55d628258","resolution":{"observed_at":"2026-08-06T18:48:13.590738Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:14.172236Z","title":"There is no EPTAS for two-dimensional knapsack","venue":null,"work_id":"d6ab1ab3-7dc1-44ab-8b8e-8d4ee03a4bbb","year":2010},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.523497Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:754c095d29c22c03a8fe8babe6e781782de35ea7a9c85376417c997af1b2de9d","observation_id":"e2f0b8ae-86f0-45eb-9840-2f6f0dd4cb3c","resolution":{"observed_at":"2026-08-06T18:48:14.178219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:48:13.535589Z","title":"Algorithm 97: Shortest path","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.535589Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:92fdece94a1210fac7d9db50b908bbdd6bdc632454da879065d57741694a5304","observation_id":"684fd4fc-2bc5-433a-bc7e-edce117396fa","resolution":{"observed_at":"2026-08-06T18:48:13.535589Z","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-06T18:48:13.476237Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":285,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.476237Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:82b64d67996b9f1e1b23dbadd5ae1cda7e203d7667ae731519b6154df0d3784c","observation_id":"b3c2f5bd-9fa1-43b7-8b96-3d803c1b2635","resolution":{"observed_at":"2026-08-06T18:48:13.476237Z","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-06T18:48:13.529124Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":710,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.529124Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:95517cbcdfd43616ef815574d63b87e5056dea3784ead3347d955de2e717bd42","observation_id":"ab7e777b-bbfb-4698-87e5-406012d511a2","resolution":{"observed_at":"2026-08-06T18:48:13.529124Z","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-06T18:48:13.501804Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem","version":2},"reference_index":982,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:13.501804Z"},"links":{"citing_paper":"/paper/2507.07894"},"observation_digest":"sha256:cd2fc1fb9d2918674e9cf7868b09b45bb8a94522d1a15074d57a8f3666e3f72e","observation_id":"65c994a1-1274-42bb-92bf-770b224a65bf","resolution":{"observed_at":"2026-08-06T18:48:13.501804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.07894","last_updated":"2025-08-07T14:24:55Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T06:14:38.321912Z","submitted_at":"2025-07-10T16:23:09Z","title":"Complexity Analysis of a Bicriteria Directed Multimodal Transportation Network Design Problem"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":7,"verified_fuzzy":5},"total_outbound_references":25},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2507.07894."}