Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T11:12:08.486007Z
Paper Citation Record · LEDGER
As of 8 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2506.03326.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T11:12:08.486007Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
19 of 19 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 92a39c64-f8a3-4bb7-b02a-ebd3639f07bd · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Mehlhorn and P
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0d39edeb-2ae9-4776-8fec-970360d94d63 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts A note on two problems in connexion with graphs,
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 9afc7fb8-5923-4272-a6ae-9f0f9cebb1d2 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Shortest paths with exclusive-disjunction arc pairs conflicts,
Reference 3
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 652924e4-3d2a-4e9e-8696-625484885774 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts On two problems in the generation of program test paths,
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation da5ad3b0-44b8-478c-8f59-8aa607b40d79 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Optimal software test planning through automated network analysis,
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 601e1339-de5b-4ab1-82d1-d7023762cdb1 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Impossible pair constrained test path generation in a program,
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 38755d2d-09de-4651-bdaa-718a25e4fda1 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts On the path avoiding forbidden pairs polytope,
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b246a892-0237-4754-b988-34f0537493c7 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Ferone, P
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 90c3a207-29be-4d68-ac1e-8d159822af57 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Google OR-Tools - CP-SAT,
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6d2aa855-26ee-4ebd-9e29-a962babb48e2 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Solving the parallel drone schedul- ing traveling salesman problem via constraint programming,
Reference 10
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e7791cf9-bd9e-4d2d-9b33-2350f0f767d7 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Parallel drone scheduling vehicle routing problems with collective drones,
Reference 11
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 881b9b3b-3ac3-471d-a31b-d69ffdddd8ff · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Solving a home healthcare routing and scheduling problem with real-world features,
Reference 12
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b35058f4-1f75-42cb-9e2e-a0ea41396372 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Converting the 0-1 polynomial programming problem to a 0-1 linear program,
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation c0ce96aa-a117-442c-85f9-54b90bd29caa · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Solution of a large- scale traveling-salesman problem,
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 3b2ff6bd-a1e8-4ee7-89d1-9e050e32c9c8 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Ant colony systems for large sequential ordering problems,
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 37e674cf-06de-40eb-88c9-5f9959bf5075 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi- parallel Monte Carlo sampling,
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 32507d9f-42be-4b0f-8cfc-a09ed0d597e4 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Collective dynamics of ‘small-world’ net- works,
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 70b29a7a-587c-44ba-8387-877a96865685 · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Renormalization group analysis of the small- world network model,
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 100643f3-b29e-4989-9d30-b9d7d6eaaa6d · outbound
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts IBM CPLEX Optimizer,
Reference 19
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
No inbound Pith citation observations are available.