{"as_of":"2026-08-06T12:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e5b00ee55db525e0ea1b3d8ae75b74b743f5aeaadfb8bd783cd484f114f8375","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T05:50:19.219527Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2311.03327/citation-record","integrity":"/paper/2311.03327/integrity","json":"/paper/2311.03327/citation-record.json","paper":"/paper/2311.03327"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms","venue":null,"work_id":"53a18803-1001-455a-874c-a170022a2770","year":1994},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:f434fb21d37d721e4ffb0e4933195f319f0316278da29bc3ec888934c12365f2","observation_id":"4a327f62-3aa2-4db1-8404-5c5ecaf49e14","resolution":{"observed_at":"2026-05-24T05:56:02.823398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Data-driven transit network design at scale","venue":null,"work_id":"23f3cf25-932a-43e3-9b90-620fe0168ea8","year":2021},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:71c9855461e512df5d35364dfa5f4f313400f4433e5d8994b7c54abc3abc4e51","observation_id":"bfbe8a4d-ef12-4ec8-aec8-0fea36503941","resolution":{"observed_at":"2026-05-24T05:56:02.819705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Submodular function maximization via the multilinear relaxation and contention resolution schemes","venue":null,"work_id":"7276b5f6-5cd7-46ba-8ca3-786d56929f75","year":2014},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:e0d08a648129cc5236686ae9230207ac311dc26f1a807b29464c3dc50cfdb998","observation_id":"ff888d44-98fa-4e56-b0ab-926fffc12121","resolution":{"observed_at":"2026-05-24T05:56:02.815638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms","venue":null,"work_id":"33c751f4-2a4f-46e0-816e-01bb507d199e","year":2011},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:29648f0e08609e0f0b6d2933adf6d1b355198dfe4a721f4d7c6dacfd4c9fabf2","observation_id":"49780e18-d48f-4655-88a8-843a38ec6da4","resolution":{"observed_at":"2026-05-24T05:56:02.809585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A threshold of (n) for approximating set cover","venue":null,"work_id":"8252249d-bfeb-4e37-a804-c4e8e4dc077b","year":1998},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:d863f930c8180d46eb3bbbaa17e757749980f3345017602ca2f7a3c00cb2d9c6","observation_id":"2507202c-92a8-4331-a757-b62c9f3fedf4","resolution":{"observed_at":"2026-05-24T05:56:02.812403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A unified continuous greedy algorithm for submodular maximization","venue":null,"work_id":"c1c963e2-0001-4acd-bdd7-da0300c70dae","year":2011},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:82d27715c7479c8c43f9e372c9308c0fd43540602dcebc5ac232d3ac489ff707","observation_id":"bd64ea98-169d-4afc-84d1-51269ab1c6f9","resolution":{"observed_at":"2026-05-24T05:56:02.830952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Tight approximation algorithms for maximum separable assignment problems","venue":null,"work_id":"96ac7c43-a8f2-4611-b984-412c33e5d42d","year":2011},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:040b86b12f973c3879b4eff8f58d4c1342c72838e4f2ed44ef7058ab2baba296","observation_id":"3ccf5666-8605-4841-98b5-0a7440ad2544","resolution":{"observed_at":"2026-05-24T05:56:02.827109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Incidence matrices and interval graphs","venue":null,"work_id":"e5c54e04-12cd-40a7-844e-29b08d4a9540","year":1965},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:3338135e65ee48c45900f2b563a2d260ed18a071da68deb64145f13c62aa35d8","observation_id":"fd6da1d9-a440-493f-aa22-6597851cd0db","resolution":{"observed_at":"2026-05-24T05:56:02.806401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems","venue":null,"work_id":"abeb8438-6860-4edf-98a1-83ef62754ff5","year":2022},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:befff7c504de7548087bf9a9f710054db0504d12d5b5d33f3fcdd573b9e343df","observation_id":"f2289e1e-d539-4a08-83fd-02f8b062b64e","resolution":{"observed_at":"2026-05-24T05:56:02.855593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Maximizing submodular set functions subject to multiple linear constraints","venue":null,"work_id":"6d6b8bde-88de-44db-bd89-6701fe4ca4d7","year":2009},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:8250b7ab99c6c959504f1214f8a3fd52bee70089f77ce157f475d6e92c94adfb","observation_id":"2d20965e-bdd5-4244-8a12-2a666e98b0eb","resolution":{"observed_at":"2026-05-24T05:56:02.859113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Approximations for monotone and nonmonotone submodular maximization with knapsack constraints","venue":null,"work_id":"b110df9b-a52a-41d5-9473-bd03b353806e","year":2013},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:f02403d396224088a7059b92631626255300793d646fbde4cd31b3b56bb0e8d1","observation_id":"27161626-2666-4496-9dde-e2d5f51e1fb0","resolution":{"observed_at":"2026-05-24T05:56:02.863006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Non-monotone submodular maximization under matroid and knapsack constraints","venue":null,"work_id":"c4337a5e-2119-466d-8187-a1fb07c0bd50","year":2009},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:603fb43948ceb34215a72d73bc4f9cff5cb4a065a2cab63603a380d57942e06c","observation_id":"343aef44-d31c-4de6-b927-f4aaf3dd43a5","resolution":{"observed_at":"2026-05-24T05:56:02.845449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"GTFS developers","venue":null,"work_id":"9d30b460-cd45-4cc1-8d17-9ed5ae5e01a3","year":2018},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:1107ba51d4990be959af75a859125923c922b88168fff56f0305ff357aba9e1d","observation_id":"7797f562-925d-4bf5-8e8f-b82e528bf246","resolution":{"observed_at":"2026-05-24T05:56:02.848272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Randomized algorithms","venue":null,"work_id":"87af297d-a462-4564-9f7a-e93c00d05a47","year":1995},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:e2cf363185a1a664db3bed02d4e825707f0a697a503b0efcba86980975493b7e","observation_id":"c8223b03-7ad6-4def-b7f2-03f6c3f267f1","resolution":{"observed_at":"2026-05-24T05:56:02.851545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Real-time approximate routing for smart transit systems","venue":null,"work_id":"5f3e2b1f-0a34-4854-b63d-974e8c02f3a9","year":2021},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:c55ea1a0b87ba37ec90ef398b5c89416d3f9eb88ad2f439107a0ade5e348f814","observation_id":"73613c02-1c5b-4fba-95fd-3a86ca8f37e4","resolution":{"observed_at":"2026-05-24T05:56:02.838091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Line planning in public transportation: models and methods","venue":null,"work_id":"1e9585e1-7244-4bbd-9289-7f277bc079a1","year":2012},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:34e873b345b1bf72dd37012a1001631cb53e00abcc41c10eede1f05687f3eb98","observation_id":"c953a8bb-cecc-46d6-88dd-f7660a54f9a0","resolution":{"observed_at":"2026-05-24T05:56:02.834540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Planning the route system for urban buses","venue":null,"work_id":"3ad7b97d-4140-40c3-9769-e197f252d5b4","year":1974},"citing_paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints","version":4},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-24T05:50:19.219527Z"},"links":{"citing_paper":"/paper/2311.03327"},"observation_digest":"sha256:731bfb94a6c4a0a8765222f2c335ebc139a9374d1329e4dfb9be2f3b40c2dcff","observation_id":"775659e8-2124-4472-8c29-9d546f31c1bd","resolution":{"observed_at":"2026-05-24T05:56:02.841147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2311.03327","last_updated":"2026-04-06T12:52:30Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T16:43:42.741094Z","submitted_at":"2023-11-06T18:24:53Z","title":"Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":17},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2311.03327."}