Pith. sign in

Paper Citation Record · LEDGER

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts

As of 18 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.

pith.paper-citation-record.v1
2506.03326 v1

Coverage vector

measured 19 of 19 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:12:08.486007Z

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+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

19 of 19 outbound references displayed

  • verified exact0
  • verified fuzzy14
  • unresolved5
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 92a39c64-f8a3-4bb7-b02a-ebd3639f07bd · outbound

This paper cites Mehlhorn and P.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Mehlhorn and P

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:10.846440Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:06.808197Z digest=sha256:09fab36fb943598741427155412ccc667328c3d2c982585049bdbd21d2af8703

Observation 0d39edeb-2ae9-4776-8fec-970360d94d63 · outbound

This paper cites A note on two problems in connexion with graphs,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts A note on two problems in connexion with graphs,

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:10.684009Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:06.866111Z digest=sha256:bd8c86c0ee07046765831d810430fbbeafb630a888a2e53a9bf7cd360e1cf6c7

Observation 9afc7fb8-5923-4272-a6ae-9f0f9cebb1d2 · outbound

This paper cites Shortest paths with exclusive-disjunction arc pairs conflicts,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Shortest paths with exclusive-disjunction arc pairs conflicts,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-07T11:12:06.932291Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:12:06.932291Z digest=sha256:59a4cb5ab3df372d9a60d4103668a5e2c35631427b3c23475e299acf55f8c047

Observation 652924e4-3d2a-4e9e-8696-625484885774 · outbound

This paper cites On two problems in the generation of program test paths,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts On two problems in the generation of program test paths,

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:10.498248Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.002266Z digest=sha256:0190590ed5e8c8bbac61719a361e6abe77954c56b2fe33093392aa09d7fe7fd9

Observation da5ad3b0-44b8-478c-8f59-8aa607b40d79 · outbound

This paper cites Optimal software test planning through automated network analysis,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Optimal software test planning through automated network analysis,

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:10.332117Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.114391Z digest=sha256:4aef5d92d941ed7dbb6d08407f70549d433a2039070c403628a8f9f156782f44

Observation 601e1339-de5b-4ab1-82d1-d7023762cdb1 · outbound

This paper cites Impossible pair constrained test path generation in a program,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Impossible pair constrained test path generation in a program,

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:10.163233Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.210243Z digest=sha256:f1bfd6ae4405b849006a6e96086623b96f7a16748cf6117da007888db5bf2791

Observation 38755d2d-09de-4651-bdaa-718a25e4fda1 · outbound

This paper cites On the path avoiding forbidden pairs polytope,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts On the path avoiding forbidden pairs polytope,

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:09.997548Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.306152Z digest=sha256:7df89642041db4385907e7549e9156400c5f351de4229f2109927db01a5cb0df

Observation b246a892-0237-4754-b988-34f0537493c7 · outbound

This paper cites Ferone, P.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Ferone, P

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:09.859458Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.382114Z digest=sha256:2b6e0814dcf548ff63bfea1606020054c1aaaaef0f8cd407d77cf73d68803e7f

Observation 90c3a207-29be-4d68-ac1e-8d159822af57 · outbound

This paper cites Google OR-Tools - CP-SAT,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Google OR-Tools - CP-SAT,

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:09.724691Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.485604Z digest=sha256:d671aacd566e596816ce869c60149f051f4a7725d25b00446aecd46ba736ba67

Observation 6d2aa855-26ee-4ebd-9e29-a962babb48e2 · outbound

This paper cites Solving the parallel drone schedul- ing traveling salesman problem via constraint programming,.

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

Resolution
unresolved
no resolver link, observed 2026-08-07T11:12:07.570404Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:12:07.570404Z digest=sha256:fbe9db3299427d9cd4327cbafca64da9bb4cc7238b0c96dfb71a108dceb35e1e

Observation e7791cf9-bd9e-4d2d-9b33-2350f0f767d7 · outbound

This paper cites Parallel drone scheduling vehicle routing problems with collective drones,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Parallel drone scheduling vehicle routing problems with collective drones,

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-07T11:12:07.663052Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:12:07.663052Z digest=sha256:f1410ceeaf5c6cf72c04c72141f5d6925b96457d07cbd1257a16c1a713573ef7

Observation 881b9b3b-3ac3-471d-a31b-d69ffdddd8ff · outbound

This paper cites Solving a home healthcare routing and scheduling problem with real-world features,.

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

Resolution
unresolved
no resolver link, observed 2026-08-07T11:12:07.731280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:12:07.731280Z digest=sha256:18d649f21046842c21f4d7e78c37031f10994a21bd15d3004dad1bcf8ffb3a55

Observation b35058f4-1f75-42cb-9e2e-a0ea41396372 · outbound

This paper cites Converting the 0-1 polynomial programming problem to a 0-1 linear program,.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:09.495444Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.806990Z digest=sha256:f3263abbccd14b0671e6d8177e2b65a0ac91b64a49686a7b3b0f8022ac34c59c

Observation c0ce96aa-a117-442c-85f9-54b90bd29caa · outbound

This paper cites Solution of a large- scale traveling-salesman problem,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Solution of a large- scale traveling-salesman problem,

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:09.348055Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.890376Z digest=sha256:cc66bb2bd956e724cadbf273a04c1a51d80589842564c2ad0e8fd1f4957433b5

Observation 3b2ff6bd-a1e8-4ee7-89d1-9e050e32c9c8 · outbound

This paper cites Ant colony systems for large sequential ordering problems,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Ant colony systems for large sequential ordering problems,

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:09.190452Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:07.997541Z digest=sha256:d13faaaf5f2adbf4a8992f1683d4d2a0119d375e3b90e172937e260dae89d501

Observation 37e674cf-06de-40eb-88c9-5f9959bf5075 · outbound

This paper cites Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi- parallel Monte Carlo sampling,.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:09.050104Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:08.134653Z digest=sha256:f0f9d20ad97b9b4cc983731e568d8f578a1c2020fb7e4c7584596a107d87318b

Observation 32507d9f-42be-4b0f-8cfc-a09ed0d597e4 · outbound

This paper cites Collective dynamics of ‘small-world’ net- works,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Collective dynamics of ‘small-world’ net- works,

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:08.910262Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:08.228266Z digest=sha256:04023f19f8effed28c5e4073584c02bd4ca524967c7d056dd7713a71703c45eb

Observation 70b29a7a-587c-44ba-8387-877a96865685 · outbound

This paper cites Renormalization group analysis of the small- world network model,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Renormalization group analysis of the small- world network model,

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:12:08.730726Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:12:08.339763Z digest=sha256:07b591d54049cebecb9711db325a984ed00853ba72f81cfe6a8cbf86ba5f98d9

Observation 100643f3-b29e-4989-9d30-b9d7d6eaaa6d · outbound

This paper cites IBM CPLEX Optimizer,.

On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts IBM CPLEX Optimizer,

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-07T11:12:08.486007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:12:08.486007Z digest=sha256:9a6531cfd502ddde25eb403ad6adc1e0a9cac1a5a1c40471d6b79910dc916d86

Pith citing papers

No inbound Pith citation observations are available.