{"as_of":"2026-08-08T03:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e9494415b81b6259785dcbb927e0d9a0087854ebcc6a3bf95cf3df038c256c6","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:12:08.486007Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.03326/citation-record","integrity":"/paper/2506.03326/integrity","json":"/paper/2506.03326/citation-record.json","paper":"/paper/2506.03326"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:12:10.800551Z","title":"Mehlhorn and P","venue":null,"work_id":"403193ea-8d45-4a35-ae8f-5e3f3daebee1","year":2008},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:06.808197Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:9c337d4b60366d04a1a840bc3e5522b36f63fddb689f0478b3d85f633a385486","observation_id":"92a39c64-f8a3-4bb7-b02a-ebd3639f07bd","resolution":{"observed_at":"2026-08-07T11:12:10.846440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:10.609168Z","title":"A note on two problems in connexion with graphs,","venue":null,"work_id":"3d3e2cc9-8939-48d8-8081-98affd19fe3a","year":1959},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:06.866111Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:036c984694424be971eb725279e858501d7dc13ed553f3664f9a7c6608b14526","observation_id":"0d39edeb-2ae9-4776-8fec-970360d94d63","resolution":{"observed_at":"2026-08-07T11:12:10.684009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:12:06.932291Z","title":"Shortest paths with exclusive-disjunction arc pairs conflicts,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:06.932291Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:3c61db99e0da097bd48cfe6ecb5814058e3c1b13263306a5b5846ba53e81c27e","observation_id":"9afc7fb8-5923-4272-a6ae-9f0f9cebb1d2","resolution":{"observed_at":"2026-08-07T11:12:06.932291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:12:10.413913Z","title":"On two problems in the generation of program test paths,","venue":null,"work_id":"35a8947b-64dd-441f-92ce-368e471d3ac9","year":1976},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.002266Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:e67215f2f5c2c2ab4edd2f4744561630286f3d26662e9fb4f437d22377acaaa7","observation_id":"652924e4-3d2a-4e9e-8696-625484885774","resolution":{"observed_at":"2026-08-07T11:12:10.498248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:10.254037Z","title":"Optimal software test planning through automated network analysis,","venue":null,"work_id":"007c5c8b-2c02-4e5f-83ff-eac608dbbe93","year":1973},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.114391Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:9df855029cfdf724a6af58572c7e6c1608dd8ac9c56068ef8674e203b326bb00","observation_id":"da5ad3b0-44b8-478c-8f59-8aa607b40d79","resolution":{"observed_at":"2026-08-07T11:12:10.332117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:10.095614Z","title":"Impossible pair constrained test path generation in a program,","venue":null,"work_id":"e362da40-c737-4b4e-8e1a-d13b8d5a7925","year":1982},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.210243Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:155e4e15ad47c86e8307213b48e3f7d55c30c25e29cdc483007272a25ee33244","observation_id":"601e1339-de5b-4ab1-82d1-d7023762cdb1","resolution":{"observed_at":"2026-08-07T11:12:10.163233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:09.949363Z","title":"On the path avoiding forbidden pairs polytope,","venue":null,"work_id":"6fc2b434-6c3c-4e37-9038-fe11c3e26705","year":2015},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.306152Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:d53f3108eb38da697b43573f4ae886321e03cfe1b678755177bf4533e783f724","observation_id":"38755d2d-09de-4651-bdaa-718a25e4fda1","resolution":{"observed_at":"2026-08-07T11:12:09.997548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:09.804778Z","title":"Ferone, P","venue":null,"work_id":"0fa03806-adb1-4a3d-8c7c-83642d253e9d","year":2021},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.382114Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:dd92d19c56d7c047b142b721d07b2f000c23ebdf79e80ac904099b72810d7e7c","observation_id":"b246a892-0237-4754-b988-34f0537493c7","resolution":{"observed_at":"2026-08-07T11:12:09.859458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:09.617524Z","title":"Google OR-Tools - CP-SAT,","venue":null,"work_id":"a816cbd2-a671-4fa0-aeb6-73eb7dbbb646","year":2025},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.485604Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:1db27fd8d38137d16b1a1969aa1c1422f805c69bcde143aeb7da0dc65870d047","observation_id":"90c3a207-29be-4d68-ac1e-8d159822af57","resolution":{"observed_at":"2026-08-07T11:12:09.724691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:12:07.570404Z","title":"Solving the parallel drone schedul- ing traveling salesman problem via constraint programming,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.570404Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:8e31febb2c239726623f7ecc453d4b3d37700b627baa68b24255d29f45eacb67","observation_id":"6d2aa855-26ee-4ebd-9e29-a962babb48e2","resolution":{"observed_at":"2026-08-07T11:12:07.570404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:12:07.663052Z","title":"Parallel drone scheduling vehicle routing problems with collective drones,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.663052Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:202e83f595deb5ad68dd68a59c5ca8af5d0377f2aa7f46f447bd6c7cafebb059","observation_id":"e7791cf9-bd9e-4d2d-9b33-2350f0f767d7","resolution":{"observed_at":"2026-08-07T11:12:07.663052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:12:07.731280Z","title":"Solving a home healthcare routing and scheduling problem with real-world features,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.731280Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:4314a753891901781f1da5bd84684d5f5de5aefd9002a93546ba7254583564ae","observation_id":"881b9b3b-3ac3-471d-a31b-d69ffdddd8ff","resolution":{"observed_at":"2026-08-07T11:12:07.731280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:12:09.454230Z","title":"Converting the 0-1 polynomial programming problem to a 0-1 linear program,","venue":null,"work_id":"76d66981-a5ae-46b7-9047-0b280fbc2010","year":1974},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.806990Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:bbb3b57c34c7532be2f8c11b662d3e62f37114a1fb6e61d7f9461dcf64979ed2","observation_id":"b35058f4-1f75-42cb-9e2e-a0ea41396372","resolution":{"observed_at":"2026-08-07T11:12:09.495444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:09.273455Z","title":"Solution of a large- scale traveling-salesman problem,","venue":null,"work_id":"2f713bdc-e939-49b6-80d1-692e48bd0caf","year":1954},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.890376Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:3710d508298f114aa48c33166324d3a617cdaf611ffc84e43920d5ca939c6655","observation_id":"c0ce96aa-a117-442c-85f9-54b90bd29caa","resolution":{"observed_at":"2026-08-07T11:12:09.348055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:09.133988Z","title":"Ant colony systems for large sequential ordering problems,","venue":null,"work_id":"f553783c-8e9a-4b6a-a511-a536b3af048a","year":2007},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:07.997541Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:00795729b328deb34f117924db1529a70cf780996f670835d1cae18a4eca37f4","observation_id":"3b2ff6bd-a1e8-4ee7-89d1-9e050e32c9c8","resolution":{"observed_at":"2026-08-07T11:12:09.190452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:08.973845Z","title":"Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi- parallel Monte Carlo sampling,","venue":null,"work_id":"0a646b0b-3ca2-499d-a843-ae3428b7f69c","year":2013},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:08.134653Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:4da0859c2fa1230b9e72990aac8fca5fe6ed91a4d1ee1027f6b87659ce48e493","observation_id":"37e674cf-06de-40eb-88c9-5f9959bf5075","resolution":{"observed_at":"2026-08-07T11:12:09.050104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:08.852596Z","title":"Collective dynamics of ‘small-world’ net- works,","venue":null,"work_id":"1f965f18-6496-4d27-9bc5-171193340b71","year":1998},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:08.228266Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:c867faf63329e96f7fe0dcb1d9cff1797808b6d32f3efe50c371b3f6f0f1f891","observation_id":"32507d9f-42be-4b0f-8cfc-a09ed0d597e4","resolution":{"observed_at":"2026-08-07T11:12:08.910262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:12:08.668547Z","title":"Renormalization group analysis of the small- world network model,","venue":null,"work_id":"1c3e542a-8444-4f70-8406-4698ace91b1e","year":1999},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:08.339763Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:985330795f4eda253f407a3e7a619c252c9746121ddffb687c40fe58501498cd","observation_id":"70b29a7a-587c-44ba-8387-877a96865685","resolution":{"observed_at":"2026-08-07T11:12:08.730726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:12:08.486007Z","title":"IBM CPLEX Optimizer,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:12:08.486007Z"},"links":{"citing_paper":"/paper/2506.03326"},"observation_digest":"sha256:6bb5f981de035b8a9d2fae88bc69621bf261b9c557305a09c59f59547074667c","observation_id":"100643f3-b29e-4989-9d30-b9d7d6eaaa6d","resolution":{"observed_at":"2026-08-07T11:12:08.486007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.03326","last_updated":"2025-06-03T19:16:32Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T11:03:39.450711Z","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":19},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"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."}