Pith. sign in

Paper Citation Record · LEDGER

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2311.03327 v4

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-24T05:50:19.219527Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-06T06:34:29.942622+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

17 of 17 outbound references displayed

  • verified exact0
  • verified fuzzy17
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4a327f62-3aa2-4db1-8404-5c5ecaf49e14 · outbound

This paper cites Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.823398Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:f434fb21d37d721e4ffb0e4933195f319f0316278da29bc3ec888934c12365f2

Observation bfbe8a4d-ef12-4ec8-aec8-0fea36503941 · outbound

This paper cites Data-driven transit network design at scale.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Data-driven transit network design at scale

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.819705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:71c9855461e512df5d35364dfa5f4f313400f4433e5d8994b7c54abc3abc4e51

Observation ff888d44-98fa-4e56-b0ab-926fffc12121 · outbound

This paper cites Submodular function maximization via the multilinear relaxation and contention resolution schemes.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Submodular function maximization via the multilinear relaxation and contention resolution schemes

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.815638Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:e0d08a648129cc5236686ae9230207ac311dc26f1a807b29464c3dc50cfdb998

Observation 49780e18-d48f-4655-88a8-843a38ec6da4 · outbound

This paper cites Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.809585Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:29648f0e08609e0f0b6d2933adf6d1b355198dfe4a721f4d7c6dacfd4c9fabf2

Observation 2507202c-92a8-4331-a757-b62c9f3fedf4 · outbound

This paper cites A threshold of (n) for approximating set cover.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints A threshold of (n) for approximating set cover

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.812403Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:d863f930c8180d46eb3bbbaa17e757749980f3345017602ca2f7a3c00cb2d9c6

Observation bd64ea98-169d-4afc-84d1-51269ab1c6f9 · outbound

This paper cites A unified continuous greedy algorithm for submodular maximization.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints A unified continuous greedy algorithm for submodular maximization

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.830952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:82d27715c7479c8c43f9e372c9308c0fd43540602dcebc5ac232d3ac489ff707

Observation 3ccf5666-8605-4841-98b5-0a7440ad2544 · outbound

This paper cites Tight approximation algorithms for maximum separable assignment problems.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Tight approximation algorithms for maximum separable assignment problems

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.827109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:040b86b12f973c3879b4eff8f58d4c1342c72838e4f2ed44ef7058ab2baba296

Observation fd6da1d9-a440-493f-aa22-6597851cd0db · outbound

This paper cites Incidence matrices and interval graphs.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Incidence matrices and interval graphs

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.806401Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:3338135e65ee48c45900f2b563a2d260ed18a071da68deb64145f13c62aa35d8

Observation f2289e1e-d539-4a08-83fd-02f8b062b64e · outbound

This paper cites Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.855593Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:befff7c504de7548087bf9a9f710054db0504d12d5b5d33f3fcdd573b9e343df

Observation 2d20965e-bdd5-4244-8a12-2a666e98b0eb · outbound

This paper cites Maximizing submodular set functions subject to multiple linear constraints.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Maximizing submodular set functions subject to multiple linear constraints

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.859113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:8250b7ab99c6c959504f1214f8a3fd52bee70089f77ce157f475d6e92c94adfb

Observation 27161626-2666-4496-9dde-e2d5f51e1fb0 · outbound

This paper cites Approximations for monotone and nonmonotone submodular maximization with knapsack constraints.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Approximations for monotone and nonmonotone submodular maximization with knapsack constraints

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.863006Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:f02403d396224088a7059b92631626255300793d646fbde4cd31b3b56bb0e8d1

Observation 343aef44-d31c-4de6-b927-f4aaf3dd43a5 · outbound

This paper cites Non-monotone submodular maximization under matroid and knapsack constraints.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Non-monotone submodular maximization under matroid and knapsack constraints

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.845449Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:603fb43948ceb34215a72d73bc4f9cff5cb4a065a2cab63603a380d57942e06c

Observation 7797f562-925d-4bf5-8e8f-b82e528bf246 · outbound

This paper cites GTFS developers.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints GTFS developers

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.848272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:1107ba51d4990be959af75a859125923c922b88168fff56f0305ff357aba9e1d

Observation c8223b03-7ad6-4def-b7f2-03f6c3f267f1 · outbound

This paper cites Randomized algorithms.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Randomized algorithms

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.851545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:e2cf363185a1a664db3bed02d4e825707f0a697a503b0efcba86980975493b7e

Observation 73613c02-1c5b-4fba-95fd-3a86ca8f37e4 · outbound

This paper cites Real-time approximate routing for smart transit systems.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Real-time approximate routing for smart transit systems

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.838091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:c55ea1a0b87ba37ec90ef398b5c89416d3f9eb88ad2f439107a0ade5e348f814

Observation c953a8bb-cecc-46d6-88dd-f7660a54f9a0 · outbound

This paper cites Line planning in public transportation: models and methods.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Line planning in public transportation: models and methods

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.834540Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:34e873b345b1bf72dd37012a1001631cb53e00abcc41c10eede1f05687f3eb98

Observation 775659e8-2124-4472-8c29-9d546f31c1bd · outbound

This paper cites Planning the route system for urban buses.

Approximation Algorithms for Line Planning with Heterogeneous Fleets and Multiple Resource Constraints Planning the route system for urban buses

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T05:56:02.841147Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

source=arxiv_source observed=2026-05-24T05:50:19.219527Z digest=sha256:731bfb94a6c4a0a8765222f2c335ebc139a9374d1329e4dfb9be2f3b40c2dcff

Pith citing papers

No inbound Pith citation observations are available.