{"as_of":"2026-08-20T09:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d946cca9b832bd080623e6cfcef5df7adbd0c659af3f2003b7580b553252e73","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T21:48:59.349796Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:44:28.905413Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T15:44:33.756622Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"cited_work":{"arxiv_id":"2501.18987","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.18987","snapshot_observed_at":"2026-08-07T15:44:33.756622Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","venue":"cs.DS","work_id":"631645c3-e386-48ba-b4dd-f4da2934b8dd","year":2025},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:28.905413Z"},"links":{"cited_paper":"/paper/2501.18987","citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:5a7de18e7f94f90bdffb7f8ba343a01923e56c19ae11d814857c6ee303793a9f","observation_id":"a79fa560-860b-401c-83a8-02a586e91ccd","resolution":{"observed_at":"2026-08-07T15:44:33.888599Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.18987/citation-record","integrity":"/paper/2501.18987/integrity","json":"/paper/2501.18987/citation-record.json","paper":"/paper/2501.18987"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:48:59.222528Z","title":"The multi-objective railway timetable rescheduling problem","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.222528Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:8c63d8f0ee6728f4a85a9241be1bfcf4ca41ed2c7210eb0180446cf64f71ba19","observation_id":"07385451-f10b-4ee5-9f61-bbc41d10fd09","resolution":{"observed_at":"2026-08-09T21:48:59.222528Z","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.trb.2014.01.009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"An overview of recovery models and algorithms for real-time railway rescheduling","venue":"Transportation Research Part B Methodological","work_id":"dcfb5a7c-1cb9-4ac9-89ad-c70882b083ca","year":2014},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.227207Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:87ba569e02183c0605b6c3799c83d2ef95f45efaa8bb6e396b09549b9ea78b52","observation_id":"cf4b3bd4-b046-470e-a9e3-30178c569ad8","resolution":{"observed_at":"2026-08-09T21:48:59.518433Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.trpro.2015.09.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Carosi, S","venue":"Transportation research procedia","work_id":"7f293cac-8d11-4ad9-96ce-b0f383da8b28","year":2015},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.231445Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:f835969221141bcb5f8c847ac44fc888a13606ad9c2bef653b1f9abbc81ed47b","observation_id":"7ca4c705-a791-4377-bbc8-f62736351600","resolution":{"observed_at":"2026-08-09T21:48:59.507933Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.01720","last_updated":"2024-08-30T14:18:45Z","snapshot_observed_at":"2026-08-16T16:41:36.328864Z","submitted_at":"2022-08-02T20:07:38Z","title":"Simple, strict, proper, happy: A study of reachability in temporal graphs","version":4},"cited_work":{"arxiv_id":"2208.01720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.01720","snapshot_observed_at":"2026-08-09T21:49:00.175391Z","title":"Simple, strict, proper, happy: A study of reachability in temporal graphs","venue":"cs.DM","work_id":"88368e38-a6bb-45e5-afbc-6a36719aeca8","year":2022},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.236659Z"},"links":{"cited_paper":"/paper/2208.01720","citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:297029ec801b4501b96e9c76acef138eb0ab7b1747763484c37be6c995cae52f","observation_id":"6414a389-ff14-4f5a-8430-c502ab0697b0","resolution":{"observed_at":"2026-08-09T21:49:00.179115Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T21:48:59.241035Z","title":"Minimizing Reachability Times on Temporal Graphs via Shifting Labels","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.241035Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:272106f78202963f8fd914006f30af4b3ea4bda3defaf0b0450e3df0b3c79825","observation_id":"3a447473-63c0-4791-b9e2-ef8a049824c0","resolution":{"observed_at":"2026-08-09T21:48:59.241035Z","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-09T21:48:59.245363Z","title":"Optimizing reachability sets in temporal graphs by delaying","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.245363Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:6b62e2d4d34d09af147c2f2a16578f8afd9d246fe28089dd4992a0248d901388","observation_id":"dded939a-7605-4026-8daa-e3c2df7eae2d","resolution":{"observed_at":"2026-08-09T21:48:59.245363Z","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-09T21:49:00.219268Z","title":"https://zbir.deutschebahn.com/2024/en/interim-group-management-report-unaudited/product-quality-and-digitalization/punctuality/","venue":null,"work_id":"8dfb443e-dcd7-4dc5-bad2-be06306d4030","year":2024},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.249433Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:000ea981003fd62343a3186d1351ef94165a954e310aed571a5aaad7bacd7183","observation_id":"82abf2a1-28e2-4616-87a4-616d08bd9c42","resolution":{"observed_at":"2026-08-09T21:49:00.223309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1110.0375","last_updated":"2011-10-07T08:49:29Z","snapshot_observed_at":"2026-08-15T04:33:25.620392Z","submitted_at":"2011-10-03T15:09:59Z","title":"$J/\\psi \\rightarrow p\\bar{p}\\phi$ decay in the isobar resonance model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1110.0375","snapshot_observed_at":"2026-08-09T21:48:59.253378Z","title":"Delay Management with Rerouting of Passengers","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.253378Z"},"links":{"cited_paper":"/paper/1110.0375","citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:21f088dc279117d07a16416a82d1eeeb72030a56dc82a7871c71e5a869afc719","observation_id":"2d901ef7-98ba-4dbe-9179-65a9cdfb6675","resolution":{"observed_at":"2026-08-09T21:48:59.253378Z","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-09T21:49:00.208763Z","title":"Reachability in temporal graphs under perturbation","venue":null,"work_id":"62a8797f-9eba-4fef-ad1f-461562c4aaa3","year":2025},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.257320Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:5b98462b66139aa501e2de3a3bfa6144b9e75a0011739ad4700f1e89eae47264","observation_id":"b3894b6c-899d-4c3c-a446-3823d914a59c","resolution":{"observed_at":"2026-08-09T21:49:00.212315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T21:49:00.198466Z","title":"Characterizing Boolean satisfiability variants","venue":null,"work_id":"1ed519bb-d9ce-4a05-887b-82ad8cd48835","year":2019},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.261195Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:f1476bbcfa8e4e1194c3a025a1bc88ce6a9154b5dc327b984b60cca6affbaffb","observation_id":"c466c053-0fd9-401f-9615-ae78ef8d9432","resolution":{"observed_at":"2026-08-09T21:49:00.201961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.05390","last_updated":"2022-01-14T11:03:24Z","snapshot_observed_at":"2026-08-17T08:51:57.023871Z","submitted_at":"2022-01-14T11:03:24Z","title":"Delay-Robust Routes in Temporal Graphs","version":1},"cited_work":{"arxiv_id":"2201.05390","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.05390","snapshot_observed_at":"2026-08-09T21:49:00.089623Z","title":"Delay-Robust Routes in Temporal Graphs","venue":"cs.DS","work_id":"7390050f-7058-4a45-a5c7-99c6ac2240e3","year":2022},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.265484Z"},"links":{"cited_paper":"/paper/2201.05390","citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:1274264727ca70281171850065e372b1d60659316ee00ef8c1a4eec09a933a3c","observation_id":"c3684bc6-a8ab-4bb7-ad02-b8ca8d09d829","resolution":{"observed_at":"2026-08-09T21:49:00.093163Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.05011","last_updated":"2022-01-13T14:54:36Z","snapshot_observed_at":"2026-08-16T17:28:33.061188Z","submitted_at":"2022-01-13T14:54:36Z","title":"Temporal Connectivity: Coping with Foreseen and Unforeseen Delays","version":1},"cited_work":{"arxiv_id":"2201.05011","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.05011","snapshot_observed_at":"2026-08-09T21:49:00.075007Z","title":"Temporal Connectivity: Coping with Foreseen and Unforeseen Delays","venue":"cs.DS","work_id":"73bde137-a4b0-44a4-b414-f2df1458c77a","year":2022},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.269345Z"},"links":{"cited_paper":"/paper/2201.05011","citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:f7457b1d1f2d100db3f69bf3e62a1170d45689146ed196be693b79ddf1024ac9","observation_id":"dd2b2d8e-90c6-4661-8472-4a73e7eefa22","resolution":{"observed_at":"2026-08-09T21:49:00.078715Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-27810-8_18","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Railway Delay Management : Exploring Its Algorithmic Complexity","venue":"Lecture notes in computer science","work_id":"7e949732-b279-428d-ab58-acb6376c53bc","year":2004},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.273720Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:254e4be4ee66bc3b38d83820087c7756256d1126c089fe6b8ae8e49fc8dfa2b4","observation_id":"40a9652f-43a9-4fe5-9575-4842e9f74da9","resolution":{"observed_at":"2026-08-09T21:48:59.490289Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11604686_20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The Computational Complexity of Delay Management","venue":"Lecture notes in computer science","work_id":"08a4e0d6-cf3c-4938-94ab-6df2ba8d5334","year":2005},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.278008Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:4ad448f53515f0193b920e8ab81c9ce50ee9da933076ef84b3f389209652e29c","observation_id":"b971b32e-c732-410f-8fea-1da57bef9cd2","resolution":{"observed_at":"2026-08-09T21:48:59.478462Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1070.0212","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:49:00.057796Z","title":"To Wait or Not to Wait ? The Bicriteria Delay Management Problem in Public Transportation","venue":null,"work_id":"88abdb12-290a-48af-8e6c-cf3f00ad6357","year":2007},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.282030Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:149eb5c5dfc70622b1789bbc1bc02df9b80a12ae437fd392f8066b105781fd8f","observation_id":"ad2d9555-b28f-4171-9f4c-4ca8d0fcf013","resolution":{"observed_at":"2026-08-09T21:49:00.063420Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2006.10.065","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Optimization models for the single delay management problem in public transportation","venue":"European Journal of Operational Research","work_id":"2bc6eab0-1800-4dbd-b448-a299e7acebc9","year":2008},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.286343Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:cf62cbbc1aa73559eff78f49ce20328cb405380cf95b48c9eead625dbb3fb003","observation_id":"97e6f6bc-99b8-4388-b8a4-67281a90c29b","resolution":{"observed_at":"2026-08-09T21:48:59.467204Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T21:48:59.290202Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.290202Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:ef39b0e79b18dce8b77b824a0b9e4eea89a0d6378fea69ee1b1a85fbc057d295","observation_id":"9ee1a353-9f47-4ed8-8471-244f34260546","resolution":{"observed_at":"2026-08-09T21:48:59.290202Z","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":"0057.80869","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:48:59.934961Z","title":"Karmarkar","venue":null,"work_id":"1f490fb6-bc38-4488-b9f3-e9090c847a40","year":1984},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.293718Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:7d8f7443b3b8897c7c16718ec42f6616d7922a9bbbe072d44a2e43fd3efdc73c","observation_id":"e74d1a19-334a-4aae-a3ff-c3ec6c179e73","resolution":{"observed_at":"2026-08-09T21:48:59.940032Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-74247-0_2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Kroon, Rommert Dekker, and Michiel J","venue":"Lecture notes in computer science","work_id":"ac83ae6a-a4a3-4c9d-84d9-f625dfa6d039","year":2007},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.296997Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:12ec549df0f3cf57a5e8e5b9d25ed28c84094c29b975dd4ceb9bf7fcc086b616","observation_id":"5303b5bb-2b59-4f1c-94fb-9eadabd20810","resolution":{"observed_at":"2026-08-09T21:48:59.455928Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.06999","last_updated":"2024-05-03T14:29:48Z","snapshot_observed_at":"2026-08-16T15:24:39.406320Z","submitted_at":"2023-06-12T10:09:13Z","title":"Temporal Reachability Dominating Sets: contagion in temporal graphs","version":2},"cited_work":{"arxiv_id":"2306.06999","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.06999","snapshot_observed_at":"2026-08-09T21:48:59.874574Z","title":"Temporal Reachability Dominating Sets: contagion in temporal graphs","venue":"cs.DM","work_id":"5e2a0586-0534-40e0-ab8a-681565bb74bb","year":2023},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.300573Z"},"links":{"cited_paper":"/paper/2306.06999","citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:a38e29d6a3b88c16f52603182f33e0874999be1cc178dbcdbb83bccbee96ea6a","observation_id":"81b7328a-f065-4128-a39d-ba35351e1c78","resolution":{"observed_at":"2026-08-09T21:48:59.878449Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s12469-020-00233-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A review on railway delay management","venue":"Public Transport","work_id":"ccddd5f2-2cf9-493d-a91d-444215e69cf6","year":2020},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.305001Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:35cd86fe96fee88b7ccddc69959aac7cd5e7a0e74b6659335e42960d31ea5694","observation_id":"801d6516-688d-41fd-81ec-3d80e49ffd3d","resolution":{"observed_at":"2026-08-09T21:48:59.444020Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s12469-019-00196-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study","venue":"Public Transport","work_id":"83e7cdbb-f83a-4477-88e1-152d094ffd98","year":2019},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.308587Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:aaf27ae965860974cfaacd6d953fdb58479e087f8d5f4789f978d8e6fa52701c","observation_id":"4d69c43b-f9d7-4d10-ae9c-30929b88e5f9","resolution":{"observed_at":"2026-08-09T21:48:59.433333Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/jgt.20085","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"NP -completeness of list coloring and precoloring extension on the edges of planar graphs","venue":"Journal of Graph Theory","work_id":"621f1f97-d6ad-49b8-9dd7-da2da6cf684e","year":2005},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.311990Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:84403e9fb8db8c323d5ab304fa5624933bbeb1493618335675bc07c5b0c3f787","observation_id":"41e83da1-8191-43e9-af37-ea34feb8e8ec","resolution":{"observed_at":"2026-08-09T21:48:59.420283Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T21:48:59.316122Z","title":"Temporal reachability minimization: Delaying vs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.316122Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:599e2a9782ac22d75b7bd51643b03fddf2dbe6dc6bf5b878efe81d6b172c10b9","observation_id":"7430588a-77b6-4f93-9b6c-1c4007fc525f","resolution":{"observed_at":"2026-08-09T21:48:59.316122Z","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":"9097.49099","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:48:59.801860Z","title":null,"venue":null,"work_id":"06b69eca-811c-45fc-9528-6e5cbbc96870","year":1988},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.319524Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:1842e70600a218b171c016cedb5888951bd2b164f00e9e4b18cccfa2ef838118","observation_id":"5974a1b0-91dc-4352-97fa-b12110a44bd9","resolution":{"observed_at":"2026-08-09T21:48:59.806836Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.53846/goediss-2538","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Delay Management in Public Transportation : Capacities , Robustness , and Integration","venue":null,"work_id":"8eab823d-7f6e-42a9-a86a-fe4d14f1fde1","year":2010},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.323719Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:42e920a1d52e5c58380dfc7fabcaf455e5dd3067dffa12b2ad501eac10910dd5","observation_id":"249542b2-818c-4a19-bc07-ee79769fe9a6","resolution":{"observed_at":"2026-08-09T21:48:59.409511Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s1571-0661(04)00160-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A Model for the Delay Management Problem based on Mixed - Integer - Programming","venue":"Electronic Notes in Theoretical Computer Science","work_id":"94e12d1e-7533-4960-b871-3427c1f4231d","year":2001},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.327896Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:2396a9ad1e09d2f18cc0b86d3a30238bf947921a0d5818ce5b934ed7eeadb939","observation_id":"7acff287-db66-4268-8276-32d70137ea8e","resolution":{"observed_at":"2026-08-09T21:48:59.398334Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-0-387-36643-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Optimization in Public Transportation , volume 3 of Springer Optimization and Its Applications","venue":null,"work_id":"40673e3e-3937-4bf4-878e-2f3882e9fe0e","year":2006},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.331819Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:3ae319a4bdd20aa15f4db76f06d440611777ebe86d2460e4bcaeeb9bb0f0bed3","observation_id":"d5794467-cf33-4604-84dc-e41fa67da392","resolution":{"observed_at":"2026-08-09T21:48:59.387746Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T21:49:00.188384Z","title":"Optimizing air-rail travel connections: A data-driven delay management strategy for seamless passenger journeys","venue":null,"work_id":"d2eced4e-befa-48ec-b643-661fd06f972c","year":2023},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.335908Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:ef8d2f2e9322be09987d75c770a57fcb52bc258c83a58081b81b8883fbfcad59","observation_id":"742975da-636c-4a92-bb31-126ef017cb33","resolution":{"observed_at":"2026-08-09T21:49:00.191946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.0618","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:48:59.725017Z","title":"Veelenturf, Martin P","venue":null,"work_id":"88e36d47-1ea6-4831-9ff5-18a8fa4ce468","year":2016},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.339337Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:8abd78bc855b89e5fed8dd526d805fe5375303394138bf4b7e53d752035f7f95","observation_id":"66ea4380-57ee-4261-bf84-ec67762d253b","resolution":{"observed_at":"2026-08-09T21:48:59.732804Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T21:48:59.343296Z","title":"Path problems in temporal graphs","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.343296Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:1c1f2a1e93446756cfeeadf31f8b2a14d3911ee508c13c989cc1e7b96d17f1e4","observation_id":"b464b1ee-0995-4ea7-a2c5-1f4a19c5f1f1","resolution":{"observed_at":"2026-08-09T21:48:59.343296Z","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-09T21:48:59.346673Z","title":"Train rescheduling for large-scale disruptions in a large-scale railway network","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.346673Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:8cc72192522d19e6ac4313f80951493b3d485ecbaf819395110899c55f22761a","observation_id":"ca25d06b-a5c0-4d26-b8da-6fd4ec7341da","resolution":{"observed_at":"2026-08-09T21:48:59.346673Z","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.trb.2020.09.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Transportation Research Part B Methodological","work_id":"daaae9f9-4a96-4f47-849e-56b224d02ed9","year":2020},"citing_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T21:48:59.349796Z"},"links":{"citing_paper":"/paper/2501.18987"},"observation_digest":"sha256:bdc8fdc9d91ee4fb0f4bcc2337690468f2e607ca313af313876594b8a4c36929","observation_id":"1db4c5c0-049f-473a-8730-c4acb31ac57a","resolution":{"observed_at":"2026-08-09T21:48:59.375139Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":8,"verified_exact":19,"verified_fuzzy":4},"total_outbound_references":33},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 1 inbound Pith citation observation for arXiv:2501.18987."}