{"as_of":"2026-08-23T19:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2515a1b451d3733af1add25d392d561ce4f1db1b909ba547a948d546cf51e9ca","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T05:57:17.433996Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2604.23748/citation-record","integrity":"/paper/2604.23748/integrity","json":"/paper/2604.23748/citation-record.json","paper":"/paper/2604.23748"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Solutionalgorithms for a vehicle routing problem with route-cost equity constraints","venue":null,"work_id":"f60d34a9-43fa-4704-9b92-5b1c1e67f884","year":2026},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:a520287d97d8c2520127a7902c8ff4b9ed972eecd7e1a323a1d912a45ace56c5","observation_id":"ff6f3ffc-dc45-4473-a757-4769fceca466","resolution":{"observed_at":"2026-05-26T19:22:53.874458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"A polyhedral study of the asymmetric traveling salesman problem with time windows","venue":null,"work_id":"8e864f37-4649-45f4-8580-09090b108cd6","year":2000},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:5adef7815e5768a4e132844568883b27f3b12386f4e77389b75b52d217af32c8","observation_id":"8ea84232-2964-4f52-886c-7a2df666dfc1","resolution":{"observed_at":"2026-05-26T19:22:53.858111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Beyond efficiency: Exploringthecosteffectsofprioritizingdriversatisfactioninvehicle routing","venue":null,"work_id":"2b54dd3c-00a7-4c14-8f70-acf495048c33","year":2025},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:4a0b4137f9442e313628cd4b9dde02b73091117ee163e7443202d2bc59ce69e6","observation_id":"1dd47b38-f794-47a2-9a21-71b0ac8583f0","resolution":{"observed_at":"2026-05-26T19:22:53.884538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Exact branch-price- and-cut algorithms for vehicle routing","venue":null,"work_id":"bef621b8-5ff1-4d00-aad5-881254279cb5","year":2019},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:37580d572f8cbb4ef144c2331272b2797022cd6506528ac76426501a97b057f8","observation_id":"084874e3-df67-4632-9fd5-c06fb48c5c0d","resolution":{"observed_at":"2026-05-26T19:22:53.879177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"A dynamic programming approach to sequencing problems","venue":null,"work_id":"854b793f-166c-4749-ad2a-6298697c3862","year":1962},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:5fa3ad3ceefc554b315b3687f1bbc6d3d8a052e658ca68a26258e2117499ec27","observation_id":"6f075341-428e-4c45-9216-15aa7cac731d","resolution":{"observed_at":"2026-05-26T19:22:53.869478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Path inequalities for the vehicle routing problem with time windows","venue":null,"work_id":"3138b2d1-b01a-46bf-935e-7f9851eaa625","year":2007},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:36e543711867b1fedf273620eaff665af38060ac8405f8a02087966a56c4da9d","observation_id":"dc6dd3a1-c9ca-45c5-87a7-d5e0476a869c","resolution":{"observed_at":"2026-05-26T19:22:53.888984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Fair vehicle routing via bilevel optimization","venue":null,"work_id":"78c80500-1dfc-4dff-a0f7-f7bc82cd0e74","year":2026},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:691707fc430a97d38eac6d73d2f6181703c1514516d413bf726ffa23f6d654b4","observation_id":"76963434-a822-4370-a261-577ce3715b85","resolution":{"observed_at":"2026-05-26T19:22:53.893995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Anewbranch-and- cutalgorithmforthecapacitatedvehicleroutingproblem","venue":null,"work_id":"a56bbc16-91a1-4b8d-93fc-14ba900656be","year":2004},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:ed50d962ac7377fce69b3c0279d0304601e5a9ebc3271d50b14a10e2435cd28a","observation_id":"ee08e71b-752b-47bb-a63e-340cc24afcd5","resolution":{"observed_at":"2026-05-26T19:22:53.843572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"On the Asymmetric Travelling Salesman Problem with Replenishment Arcs","venue":null,"work_id":"6e683c3b-4866-4a08-b6b4-d6ec23380ab7","year":2001},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:3ba6af9319a2d6278d414ef8814082a726c6a5ce5b988f4397182ebf3b66598e","observation_id":"339df4d4-9c6f-4ff5-a6c8-1b0a0d9bebd8","resolution":{"observed_at":"2026-05-26T19:18:16.039368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Workload equity in vehicle routing problems: A survey and analysis","venue":null,"work_id":"349a424b-db86-45d6-9a86-c332805fca14","year":2018},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:62f7fba3246609b885de8e641b954c415f87bc73c6e3e4fcc622b24078235129","observation_id":"9b15a478-f5e4-4016-9638-7e6a32ee3898","resolution":{"observed_at":"2026-05-26T19:18:16.049617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"A new branching rule for rangeminimizationproblems,in:InternationalConferenceonInteger Programming and Combinatorial Optimization, Springer","venue":null,"work_id":"28c9e403-4459-4769-9e41-e68313b82ba8","year":2024},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:095c23b68b0733b4beef53e6ced8d37c6254e01945178c8da01649470396f409","observation_id":"8dd71ffc-a867-47dc-8e77-a9ca02c5524d","resolution":{"observed_at":"2026-05-26T19:18:16.053250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Efficient branching rules foroptimizingrangeandorder-basedobjectivefunctions","venue":null,"work_id":"8c46cdc8-a768-45d6-9ebd-49873d7d1bb6","year":2025},"citing_paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T05:57:17.433996Z"},"links":{"citing_paper":"/paper/2604.23748"},"observation_digest":"sha256:6a4b7f7b6855c6f467051e6b61ca47b16db599cfdd6840a1b76b09eb91a5b233","observation_id":"76c9da63-ea78-44b7-9623-05d7447e7c2f","resolution":{"observed_at":"2026-05-26T19:22:53.864292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.23748","last_updated":"2026-04-26T14:54:33Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T23:09:58.193241Z","submitted_at":"2026-04-26T14:54:33Z","title":"Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":12},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2604.23748."}