{"as_of":"2026-08-24T03:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:81a2cb5756f940ef787b5ba2b80b39cb32ddc5f235cb15ce25578dae3f73d2cd","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-25T19:00:38.704198Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"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/2606.25970/citation-record","integrity":"/paper/2606.25970/integrity","json":"/paper/2606.25970/citation-record.json","paper":"/paper/2606.25970"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T19:00:38.704198Z","title":"Computers & Operations Research , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:fe6cd69cc90f932ad5eacda416068fae0dbe318159a6bff227d577906c40c9ac","observation_id":"508dcd49-174b-4294-9609-b43559789eb2","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:9376287365b5c77dd8970568ec271dfa05d0aab12fa920b9c34e2cb5785c7d2f","observation_id":"30bcb914-dcab-4094-8bc2-cd1bd91206fe","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14868","last_updated":"2024-02-21T11:58:26Z","snapshot_observed_at":"2026-08-23T16:16:10.099180Z","submitted_at":"2024-02-21T11:58:26Z","title":"A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints","version":1},"cited_work":{"arxiv_id":"2402.14868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.14868","snapshot_observed_at":"2026-07-04T21:10:09.628746Z","title":"arXiv preprint arXiv:2402.14868 , year=","venue":null,"work_id":"118f0e8f-688a-4e1a-b0c7-d180834dc8b5","year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"cited_paper":"/paper/2402.14868","citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:25b64ae2578c89c2fd9bf79657dc159717ad1542c6b05575b107e83e5569f81b","observation_id":"0bda89b8-9059-45b3-98b9-dbd4010c2ed3","resolution":{"observed_at":"2026-07-04T21:10:09.630730Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T19:00:38.704198Z","title":"Expert Systems with Applications , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:77ed3a919bf514fa01ab5475fdc054bd1d736b514317bc7a1630fc1837c19ff8","observation_id":"09991914-2425-49cc-abb6-20b126b88bdd","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Transportation Science , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:2e3b77916ddfef4a5454dbc28fb1c487f32b2cf435c1799d08b71b61510441c6","observation_id":"58e3f8ec-2d45-4090-b620-a3b1b2e6ee34","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"International Transactions in Operational Research , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:28e4e13e1a8b781e9c6b824ace62a89262da37cf8c20acf16a1798a6572a7411","observation_id":"38df1489-a522-477b-ab1d-614934d7dbea","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"International Journal of Production Research , volume=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:dc65c3a07b86dfd4de423ef2f550edc0ecf04cbb97daee4f5b583cb675204b43","observation_id":"4ae678c1-f15c-4ad2-a07c-412ef65f1720","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:cc120d328c15588e3a5a85586072245a7526c7c951562ee032e7878ecddd5ca9","observation_id":"6c46c704-0874-4e4f-83d4-591d6069a7b7","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Mathematics , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:0c7052ae6fda22bfe748a78703d732242c9f0a6e6629ac04670df3e442a8906e","observation_id":"80f7386a-540c-490e-89f5-cdfacd50430d","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Applied Soft Computing , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:e783058904e7d45186050a819d6207900ff7760ec99d64f7daa297e90c2b1453","observation_id":"2f94180c-5604-494c-a8d2-48865d8f73c1","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Transportation Science , volume=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:b8bbaa31fa26701c4e931d712b212f6872e309cd49ec3c5e9e0d09cb33ba6ee7","observation_id":"d018a897-0d3b-42ee-b187-de8fb036d8e0","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Transportation Research Part E: Logistics and Transportation Review , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:adb44439960555659a1828eb83939f37b5d7723f19098b332a71e2864783a8b2","observation_id":"6c4ea34c-7f59-477b-a53a-549bebc4835e","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Computers & Industrial Engineering , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:025bdd058f16978e56917b8ac68745d380f07cec3ff07c5e86c54c2badc016e7","observation_id":"297acef3-8b8a-4ba7-a0fd-d52cd726d92a","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Computers & Operations Research , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:48b45478f4e8be8cc2535cc2d3f35a15eb2779bdf6562032c9c30d23e57223d7","observation_id":"a547f2f1-d045-4c5f-8706-db1bbcde59c4","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:8c574fa3ad1f7e689444cd68b55fe8377cfc0bccc081b83fa380c1f98a33045c","observation_id":"590b3cd5-d9c9-498a-8203-10740dc04b77","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Transportation Research Part E: Logistics and Transportation Review , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:95d40be24efa02044d2a5440aa700e4ba7e61ba99a79abe1895043f5d37dc80f","observation_id":"c3d2934a-1c41-464b-b112-f429fe716901","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Computers & Operations Research , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:40531aa23d7709352cf71a878b335b75dc59e246ce70473020d21f72e84a39da","observation_id":"065916cf-77a2-42a3-bf4a-cb922eea315f","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:ddd73136086c4eef7e335d48da393f8ce43fa4de4a39c54a2c371f3cbfb1a22b","observation_id":"bda66d76-1937-42e4-ac1d-b70a52029315","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Transportation Science , volume=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:5d033f5e8761a2453242ee6f3f3bad5e14fac5d3166403070d69fb023512b20b","observation_id":"470a92a1-71f2-4789-9344-081be29edb00","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:2b8f6100b3cdc51df860bc74247f209674764cece51f4b47e4f86210ab645b64","observation_id":"37b93e85-bf08-4433-9b6b-5fb88119c504","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:2f4bb0ef13498422a29135d0b93278615789f758e9f0c4533f1453e5ddf99a25","observation_id":"434fdd5e-41bb-433d-ae6e-9719828fdbb3","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:45095e576f0222b05ae1bcd7f06e74479cde75c1e246295a31078aea456136cb","observation_id":"c1cb1265-3ba6-49e1-afe9-614171ee663b","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Computers & Operations Research , volume=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:5e25b2d7b4342dbcb9dba646e95f55ebca800073a93bfef3d1d6c23d525cd5ff","observation_id":"9f7d9501-b2fc-451c-b934-b98cbf814d35","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Informs Journal on computing , volume=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:f3f3be97881dc822b5d02502c2ba8039bdd02afbe8abbb28553c71d03b63a518","observation_id":"192e3fdd-5e65-42f9-b346-c1f57995f1c1","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"International Transactions in Operational Research , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:c4781d185edabf5d0a3ce2d490b882656f1308f2e806ec82b9004a4c1aad7765","observation_id":"1df97360-072e-4f8d-b0e7-982e51a6837d","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:1c0eac7b9346a14c953f45180a24e8480875d3f637e180967ff225826b555db0","observation_id":"ce7f71bd-94fb-4976-a625-b69856688a58","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"International Conference on Computational Logistics , pages=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:7eec30ac4cb4fb7f78c8f2a950d9c0f042399cbcec4bf6a9e39102c6f7f354eb","observation_id":"fbcbdc9b-7e88-4333-b030-f201425380e9","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"1988 , institution =","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:865e6ea46a3046055b2d7031590a5bdba9f1185d075b24ead0f9dba8fb0dc65f","observation_id":"b8b444f6-4871-4729-8acb-7654ef430801","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Networks: An International Journal , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:caeef05131981c551082d7bb12ce938e07f3d6f4f689ec1a25b852d4592b0ec6","observation_id":"a0de18dd-9cd7-447e-9c79-0c0d59a3edc4","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Operations Research , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:9a0546007a7f2325c0bcb986c8b2aa6087ab49b53a6673a6470cacbf196ac95b","observation_id":"2db59b1c-56bb-4af7-a9d3-d1066bfa2828","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Networks , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:4089ed4974891d000378846aabd173d64349fbf3fa970ece602a1d8fbba9bfe7","observation_id":"e86ced6b-1d37-4b1c-be3f-5957e76fa10c","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12454","last_updated":"2024-06-18T09:58:29Z","snapshot_observed_at":"2026-08-16T13:41:54.012766Z","submitted_at":"2024-06-18T09:58:29Z","title":"A Neural Column Generation Approach to the Vehicle Routing Problem with Two-Dimensional Loading and Last-In-First-Out Constraints","version":1},"cited_work":{"arxiv_id":"2406.12454","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.12454","snapshot_observed_at":"2026-07-04T21:10:09.632236Z","title":"arXiv preprint arXiv:2406.12454 , year=","venue":null,"work_id":"c00f8e7c-7d7f-46f8-bacd-64c10fcd615f","year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"cited_paper":"/paper/2406.12454","citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:f6f56c2e2d0f7d942ab9e0f7fcf00beeefe301f4ec1b3078d53b8e0eb547814f","observation_id":"b6a6bb51-0f88-425a-bc4a-b19afb1e353a","resolution":{"observed_at":"2026-07-04T21:10:09.634207Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T19:00:38.704198Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:cc8413de95859909214eaba5eb764ca975d93e21cb5c285cfa9299e27244a74a","observation_id":"649fa7b6-d00e-4d64-b45b-a77e47b13381","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Computers & Operations Research , volume=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:2fd0a0ab589cfb154018561b51c8bdaf8cdaa723527a44b012bdbc2f63f70acb","observation_id":"24acba27-b74a-4fbd-9459-bfdf1ce0f2cd","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Operations Research , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:339538ad6ca88e06c6dc97e11154ad93f68bdbf37cec9d1ba2f83295bee263af","observation_id":"2fbd0bca-4f48-4a08-974d-c1f3a3fcae09","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Applied Mathematical Modelling , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:7c7507d663e47494255ddd1ca00ce564bda5e86f03e41605608cfd145f27a947","observation_id":"50a4371c-22b2-4dba-8778-314523485635","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Computers & Industrial Engineering , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:719b8af819f94d247687cb7ca80d2d9e3061da9cbffd9ceb02325fd511ace258","observation_id":"86ec88e5-1223-4ce9-ae7b-63f52ec06ff5","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European journal of operational research , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:e8cf050408f4bd7a77155fb3e1971b8d4b608274aff9c95b319222fbba48ffde","observation_id":"0500eacd-a27c-4191-b79b-7b3cf0a26177","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:428116cfa32707d6ef568e7e254202f6a3278873bc40e8462863e5858c101b42","observation_id":"eede4f6a-83f3-4067-89c5-3609e865d4e0","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:fdea0c7751467ab7246e96d371d408b967ed85b3ecbccb9626c90ab50b7e4be4","observation_id":"5b2b82d1-f5cc-45c9-891d-d9ea1855315a","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Computers & Operations Research , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:b934153726d4991fda18635b81740c66596be682475a7be783eb5bbd9aa13023","observation_id":"46390253-571b-4aa3-9b13-9ab4cae65624","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Computers & Operations Research , volume=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:eda19543527e3a773794b86ef08f202b063d84fabce7941b47718ba0981506fb","observation_id":"69347fad-ce88-43c2-b2e5-f926a3dbd3ae","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"INFORMS Journal on Computing , volume=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:809b362054bb99e81724a02ec738f87a8832765b900d5b683d20be4c0155f9d7","observation_id":"7a0d77ff-f0ed-4cfb-82b6-3f056d420053","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Transportation science , volume=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:f65ab48404ee3deb0bc235036c7475223f36fc6704e5ad8a6f90bc62ff16569a","observation_id":"4c16ec55-8ceb-4b99-8fbb-ef26d750ac1e","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Working Paper Series , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:48f01781f7b63944a05a40adae9da87943d76e615d3801641768538e7e6bb25e","observation_id":"bf15a4d4-ae18-4c16-bb61-0b97730151d3","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:8d924b434624042a26575e6a5380ebe2119ab1fbb28b3c54fa5368c738d20fe7","observation_id":"338fe526-3113-4fdc-a5c3-3e91dfb0d0bf","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","resolver_source":null,"status":"parse_uncertain"},"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-06-25T19:00:38.704198Z","title":"2L-PDP-instances: Benchmark instances for the Vehicle Routing Problem with Pickup and Delivery and Two-dimensional Loading Constraints , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:990a88e7b4bbb74cc06867bc47076f9bc91d7c226570a1cb1f54729c1fe05f45","observation_id":"1923cd14-a84e-4751-a8b0-cc794b0477d4","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":"Biometrics Bulletin , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:7253077e72d47d47fdea39112c84c87b5d48de5e235ec8b897c1ab3bc6966b68","observation_id":"4c20872c-4a06-4053-825a-e5471993bbb4","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","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-06-25T19:00:38.704198Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:6e6480d2e35c9fb52abaae0d79c0dad46f7f4674e6d6cdecf74f7dd3069cafec","observation_id":"f816d7cf-b70f-4fe6-b58d-579c0217b13a","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","resolver_source":null,"status":"parse_uncertain"},"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-06-25T19:00:38.704198Z","title":"A Tabu Search Algorithm for a Routing and Container Loading Problem , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-25T19:00:38.704198Z"},"links":{"citing_paper":"/paper/2606.25970"},"observation_digest":"sha256:936899cbb6298eceb6b1a16f24e5efe598beee2ff537df2c31b0d0250f7f6d82","observation_id":"31410068-85ac-4f20-ab2e-c6dbe15c84dc","resolution":{"observed_at":"2026-06-25T19:00:38.704198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.25970","last_updated":"2026-06-24T15:39:38Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-03T23:06:18.541072Z","submitted_at":"2026-06-24T15:39:38Z","title":"Dominance-Based Feasibility Inference for Packing-Constrained Pickup and Delivery Problems"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":2,"unresolved":46,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":50},"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 24 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2606.25970."}