Pith. sign in

Paper Citation Record · LEDGER

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

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.

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-07T06:34:17.273281+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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:12:06.808197Z digest=sha256:9c337d4b60366d04a1a840bc3e5522b36f63fddb689f0478b3d85f633a385486

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-07T06:34:17.273281+00:00.

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

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:3c61db99e0da097bd48cfe6ecb5814058e3c1b13263306a5b5846ba53e81c27e

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:12:07.114391Z digest=sha256:9df855029cfdf724a6af58572c7e6c1608dd8ac9c56068ef8674e203b326bb00

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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:8e31febb2c239726623f7ecc453d4b3d37700b627baa68b24255d29f45eacb67

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:202e83f595deb5ad68dd68a59c5ca8af5d0377f2aa7f46f447bd6c7cafebb059

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:4314a753891901781f1da5bd84684d5f5de5aefd9002a93546ba7254583564ae

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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:6bb5f981de035b8a9d2fae88bc69621bf261b9c557305a09c59f59547074667c

Pith citing papers

No inbound Pith citation observations are available.