{"as_of":"2026-08-16T16:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3724a074f56628ae8c7ebb6431648412e9f78e3323173cdc5300e98bcaab9b07","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:51:15.842574Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.08494/citation-record","integrity":"/paper/1908.08494/integrity","json":"/paper/1908.08494/citation-record.json","paper":"/paper/1908.08494"},"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-14T11:51:16.673777Z","title":null,"venue":null,"work_id":"d545e8d0-907a-4e44-89ee-42b7b560120c","year":2013},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.598271Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:b20f3032eb7116f570c1173a42ef032322c4ca08a420bcfe3b1767d6c536f796","observation_id":"2849f321-0f5d-4cd2-b230-327d0fb342c6","resolution":{"observed_at":"2026-08-14T11:51:16.679963Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.654984Z","title":null,"venue":null,"work_id":"9f91cb5b-b1e5-42a0-9e95-cff4d09b038f","year":2006},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.605457Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:d9793bf986f1a5ec7e650b13dd9f071b197336372c0770b2b67141d556fbbf60","observation_id":"38081003-59eb-4ae3-92f8-c3d9e1948eef","resolution":{"observed_at":"2026-08-14T11:51:16.661054Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.631553Z","title":"Barbato, R","venue":null,"work_id":"865b37bf-4f52-4354-8653-292223f9630a","year":2016},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.611536Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:8d1a45f15c22fd24a0a6f9a494fa573494c11fed714de3dbfbdf70d6769b295c","observation_id":"6d2dafec-2146-4aac-a108-99b58ea0980d","resolution":{"observed_at":"2026-08-14T11:51:16.637650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.611880Z","title":"Battarra, J.-F","venue":null,"work_id":"c3095e3f-88c9-41fd-a258-b5e700492f4b","year":2014},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.617107Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:18c14c4c4aa30d2cc5804833c03af1c001847763bbef52ea38ced9a1885ad1b6","observation_id":"d232009b-10f2-4f21-ba10-290a2ad5ce2b","resolution":{"observed_at":"2026-08-14T11:51:16.619150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.590969Z","title":"Birattari, Z","venue":null,"work_id":"39a6d457-1b99-4c3f-975b-192c2f8d233d","year":2010},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.623545Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:dd52f6f19946cd3e23155e99b682325da2ee8f2ec540c4665e40c38e408da5ff","observation_id":"b0c06c68-9b00-4216-b29b-f7f8f6394f5e","resolution":{"observed_at":"2026-08-14T11:51:16.598886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.572877Z","title":"Bruck and M","venue":null,"work_id":"a0060587-5969-45bc-a1f1-28d375424fc5","year":2017},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.631847Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:2c17859b9429d16114362840a12dc4242c4afba457c70c8ed259247251e9b5c7","observation_id":"7c745268-4e27-4434-aead-930b0d3c86fc","resolution":{"observed_at":"2026-08-14T11:51:16.578742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.555286Z","title":"Carrabs, R","venue":null,"work_id":"37442a50-4064-4e75-921d-8b30d7881ae0","year":2007},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.638299Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:86d08a786ebb2f7adb68b387b3e449ed19149b0b47dc3c23c2e596df066e3d98","observation_id":"408a9e75-ad40-40b1-8dd2-3377b76edb24","resolution":{"observed_at":"2026-08-14T11:51:16.560487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.537393Z","title":"Carrabs, J.-F","venue":null,"work_id":"22b85c46-4e06-4f65-84cd-472af060c9cb","year":2007},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.643428Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:7096da3d792f8a5cb952cfe2cb6650ed7f7fd2ef3aa2475fcbfa5aa332c0c4b1","observation_id":"d7f9521a-7fed-4c52-a94b-63284271e39b","resolution":{"observed_at":"2026-08-14T11:51:16.543137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.519171Z","title":"Carrabs, R","venue":null,"work_id":"a07d604f-0e36-4345-880b-efb99ee9d2b2","year":2010},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.649681Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:9b5739b69422ea560764b2cf87812f75f5cd74f89e70b22c28e6b787976f6f49","observation_id":"bb5da186-ed8e-4e9a-9553-a27cfcf152fa","resolution":{"observed_at":"2026-08-14T11:51:16.525030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.499871Z","title":"Casazza, A","venue":null,"work_id":"b1973a8b-3b23-400f-b852-9dc1926fd69b","year":2012},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.654783Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:089267254a0ac2cd8b52079d9cf7469685c386708a31bcd20f20ae043ff32e82","observation_id":"1c68598b-1cdb-4516-9851-399e62eea63e","resolution":{"observed_at":"2026-08-14T11:51:16.504874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.481256Z","title":null,"venue":null,"work_id":"61704b68-f2ff-4abb-b63b-4a0b4933cecc","year":2016},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.660244Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:7633f6cce24d75e87ae8f35d9c4cebf4526556c50a26c612c7404ae02137cea6","observation_id":"f8ad69c8-23b0-4473-987b-1068e5322f5d","resolution":{"observed_at":"2026-08-14T11:51:16.487387Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.462523Z","title":null,"venue":null,"work_id":"b4fd15c4-468d-45c4-bd0f-7b0874daf889","year":2020},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.665736Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:4b1f6462cc0fe887b2811a170f70f76dc20f29974a0ff7eea465c69488d84b68","observation_id":"419ad180-ca0d-4dfb-9d8f-d271dc43e380","resolution":{"observed_at":"2026-08-14T11:51:16.468225Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.444606Z","title":"Cordeau, M","venue":null,"work_id":"b721de52-3198-49e8-a742-05090974da80","year":2010},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.671605Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:0be3f1f861fe88a715d74e49e19484f312f542229267b1ba90c53ab9109c207c","observation_id":"7c7eab33-217d-46d9-8ef1-a5148e613c35","resolution":{"observed_at":"2026-08-14T11:51:16.450607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.426434Z","title":"C \\^o t \\'e , C","venue":null,"work_id":"84e035b1-e36c-40a7-bc12-808ef17bb448","year":2009},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.677341Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:204f78021b2759260b79b7fb9180cf919c2c9bf077afcf4a7bc8eec916e63082","observation_id":"fa0bf820-5735-4043-ac2b-4cad0dd023e5","resolution":{"observed_at":"2026-08-14T11:51:16.431656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.408340Z","title":"Doerner and J.-J","venue":null,"work_id":"e26277ff-3a1d-4fe7-8ae1-3a20e1131182","year":2014},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.683459Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:b7ed71d9651bb474579cbec0db45c64422e5a9e6a0c8c922b8f59d28beda6db5","observation_id":"2493d976-2a61-4f9c-9160-178b74d53e95","resolution":{"observed_at":"2026-08-14T11:51:16.413867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.388483Z","title":"Felipe, M","venue":null,"work_id":"15a0d1d5-f836-487b-8c15-9ea32f6ddefd","year":2009},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.690295Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:ecc05345f8fcfc87d90330eda7337ef6e8d4905117016e97c7f404980d672959","observation_id":"17d3e410-aa22-460f-aaa6-c40b8e677497","resolution":{"observed_at":"2026-08-14T11:51:16.394514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:15.695909Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.695909Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:38e6043e7ecad9142c3d899fa9ab3d561117c48c517a27004460344d2624f12c","observation_id":"432c7405-bd91-47e4-a34d-a99c4beaf694","resolution":{"observed_at":"2026-08-14T11:51:15.695909Z","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-14T11:51:16.356169Z","title":null,"venue":null,"work_id":"c065b6ee-8889-40bc-ba78-fe10c33eb406","year":2012},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.701657Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:14530b3a486b7d22f66fdd4a25703b9aa7f1db538cf5fa6c3b4effe6281be5b4","observation_id":"dde301f7-f4a1-4242-ba82-841672fc49f7","resolution":{"observed_at":"2026-08-14T11:51:16.361730Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.338799Z","title":null,"venue":null,"work_id":"194dda11-a184-4455-974f-a282fe3d2f36","year":2013},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.707541Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:654e7ebbe9aa6c8c5414e38671908154480e54d5ec0a32374bd2483d55310b4b","observation_id":"ab643abe-550f-4d4f-8904-700d1d57c2c9","resolution":{"observed_at":"2026-08-14T11:51:16.344229Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.320281Z","title":null,"venue":null,"work_id":"d8bc2d58-bfc0-4984-8fcf-1f1a18e31988","year":2015},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.712865Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:dcb45fa766c38253d5c58cb7fa23d6c63004516420d57a9ba9b81d8ec77eaf37","observation_id":"dae0c8d7-0afe-4d9d-ae85-8c08be7d3bca","resolution":{"observed_at":"2026-08-14T11:51:16.325943Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.300228Z","title":"Gutin and A","venue":null,"work_id":"41ca9cf7-1aed-443a-b4d7-5406b1cd99f9","year":2006},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.719932Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:838e2d0f486ead69a7ff127c865cb6426311bc5f3b81f8b307d2ae85a2c4742f","observation_id":"323d9614-52c9-4eb6-89bb-9bd993ea3149","resolution":{"observed_at":"2026-08-14T11:51:16.306269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.279871Z","title":"Iori and S","venue":null,"work_id":"1a80d500-28f3-434a-8852-d9bd8c72d25c","year":2010},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.726789Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:a5eadf01f373ae4a0743b09257af19f313a6adcf596ea1d878a606dfb03222a4","observation_id":"bbb5d884-e852-453e-8d81-9f5b93fc77c3","resolution":{"observed_at":"2026-08-14T11:51:16.285941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.258790Z","title":"Iori and J","venue":null,"work_id":"e8ee4d9e-45a9-4a5a-8201-ebb933e5fe0d","year":2015},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.731798Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:4928bfb5d97a883979ebbd96c6d1215c44e317ef826418ad38654202f64bdd3b","observation_id":"6f63863f-f760-45b3-b2b2-acf3b01d2b9c","resolution":{"observed_at":"2026-08-14T11:51:16.264530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.241391Z","title":"Kherbash and M","venue":null,"work_id":"6a36a5d1-1a28-4714-9032-c21fb33f0e1e","year":2015},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.736844Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:11447fc750d63c453d9bfa159bc7a589b20d9152a279d2faf4ed116b4a03f3c0","observation_id":"a0237d72-f110-49f4-bf4c-3149fccca8d9","resolution":{"observed_at":"2026-08-14T11:51:16.246629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.223652Z","title":null,"venue":null,"work_id":"a1594444-2e8f-4c8f-8913-33c55ad7343f","year":1984},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.742206Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:f96cfbbb632f8e0b6d3c13bdd24edb6688c59bcbf7abb4dc132e38e12bbdb24c","observation_id":"735c8d20-93a6-4f82-8892-e505a501622d","resolution":{"observed_at":"2026-08-14T11:51:16.228895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.206277Z","title":"Lalla-Ruiz, J","venue":null,"work_id":"a1b6cace-50c7-4102-8381-0f1920d35392","year":2014},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.747822Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:f5c30eeca0597e4169594438bb2ae7205e0c4b136a9fa62f7d898ae558e017b3","observation_id":"d91455e2-89c9-440c-96e9-0072a8785b2d","resolution":{"observed_at":"2026-08-14T11:51:16.211417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.188035Z","title":null,"venue":null,"work_id":"bc3b8b6a-0aec-45ee-bc5f-c0d6e73b5da3","year":2011},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.753054Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:0db51eac25a34ccb637315a48619b198a893b7f1d3d518e65a40b1acc47a1e27","observation_id":"c56e83ea-c4db-4fc5-ace5-bba73352b590","resolution":{"observed_at":"2026-08-14T11:51:16.193951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.170043Z","title":"L \\'o pez-Ib \\'a \\ n ez, L","venue":null,"work_id":"57e18f5c-daf2-4a5a-9539-0b44a3323b98","year":2016},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.758279Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:f136e75e7967929c281e6c49fc09abba69a05979a131fc93a510953f57355ebe","observation_id":"ed301778-4af7-4fb0-88e5-81b57d1691a3","resolution":{"observed_at":"2026-08-14T11:51:16.175869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.152742Z","title":"L \\'o pez-Ib \\'a \\ n ez, J","venue":null,"work_id":"e7a236ea-8cdf-487f-a3cd-ae621dfd5e32","year":2016},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.763657Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:a5d8211dde41d6aa2a42f9587428e7f2d871837cb69779aced50544c7bc831df","observation_id":"2b682488-f120-4d1c-8c02-edc04ba51b46","resolution":{"observed_at":"2026-08-14T11:51:16.158215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.133845Z","title":null,"venue":null,"work_id":"eef86e4a-c3d6-4d26-a6e2-dc310e403a5d","year":2010},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.769000Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:b1147c662729d0ffa5c3dd24a50dd77517b1187bb32ec5c9af00106d9c3c4dc4","observation_id":"19c34062-df57-44c7-8ec5-3b464a6b78ff","resolution":{"observed_at":"2026-08-14T11:51:16.140684Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.114959Z","title":"Mitchell","venue":null,"work_id":"9172750a-87b8-4338-b6ff-e00fcad48916","year":1998},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.774357Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:00b874999e3f707af8461ac1c705efe64d9a2d2b3e3df30ef66a43bf39d28ec2","observation_id":"de520d75-3ce5-4537-9912-d60a0866c258","resolution":{"observed_at":"2026-08-14T11:51:16.120154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.097208Z","title":null,"venue":null,"work_id":"fa9441e6-f867-462d-8107-2bde7a573bc1","year":2018},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.780881Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:81b0a6ef4bd58bdd60295ffce392f564b096a0866e6ff53c3dc01a42cd4a31ab","observation_id":"6d3c7f9c-9cfa-4e84-aca1-3bd6bdb256b1","resolution":{"observed_at":"2026-08-14T11:51:16.102623Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.074421Z","title":null,"venue":null,"work_id":"10e68697-2337-4be1-8b65-ed367a198e85","year":2009},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.786506Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:c298e9e4a3c2d0ed5c469ffd1497efcf6bbb9620508cf4a768d308113cf958ef","observation_id":"0d48a7de-fc5f-4c1c-8c71-0b47b4eb690f","resolution":{"observed_at":"2026-08-14T11:51:16.080897Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.054059Z","title":null,"venue":null,"work_id":"9eb5321c-71b3-407b-a308-23562d830ddd","year":2009},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.792102Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:78ff5133d313672493b1989d71c5bfd7b340574b876b14011b972dc2cdca5614","observation_id":"6724b68b-57c9-451a-8307-5a3e0c456535","resolution":{"observed_at":"2026-08-14T11:51:16.060083Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.033058Z","title":null,"venue":null,"work_id":"217f7e59-c2e5-4fee-8830-fd0be529ea38","year":2010},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.797489Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:6247104fcabef91e4375c5a0a34dd6dcf33baeaea80a58b31fef10447f1d4b96","observation_id":"5b37ecf3-9929-48da-9dc9-d72012704fc7","resolution":{"observed_at":"2026-08-14T11:51:16.039251Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:16.011402Z","title":null,"venue":null,"work_id":"03622180-4133-4d9e-81bf-8c987428aa18","year":2012},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.804358Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:fabd701a558c73341302eb495d43b5c2d7172f7642c14825b541220e093e73e0","observation_id":"608aaf41-f9c1-410f-8b72-c92f13322757","resolution":{"observed_at":"2026-08-14T11:51:16.018992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:15.991381Z","title":null,"venue":null,"work_id":"d85e9e40-45cf-4991-82e8-427b564c38a1","year":2016},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.811411Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:24bd0d1ce422a13ed8db10be11ffa26087ff8fe536749828a5b85fab8a7428d4","observation_id":"ba82f94f-3875-43b8-a797-a2b84fa1bcc2","resolution":{"observed_at":"2026-08-14T11:51:15.997645Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:15.972441Z","title":null,"venue":null,"work_id":"26945a15-554c-4474-9de2-6833e1d00080","year":2018},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.816628Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:1444d7a00e9a193376d872817d5e2b6d3520ad7903aaa0062cdbe4a57d7aaa0c","observation_id":"cb2f3024-4729-4ce0-9363-b7feac3b2a41","resolution":{"observed_at":"2026-08-14T11:51:15.978770Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:15.953343Z","title":null,"venue":null,"work_id":"bd7a740e-e589-4e9e-8831-1aebfc0bfbff","year":2015},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.821880Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:ae3c4f9b311e9fbb1fa79d441f89f2ff5fa8fe6d15a5fa6e8f7b8ce2931b377f","observation_id":"0d5cfb8c-28fa-47e9-99da-fae7f499280e","resolution":{"observed_at":"2026-08-14T11:51:15.959171Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:15.932906Z","title":null,"venue":null,"work_id":"5b60cbb4-0d5f-4a70-a9df-bffce7e51858","year":2009},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.827561Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:715880b4020757de4c46d31a5282ef2b6b3bb9aa0aa8acde59aa7cc3af40cb04","observation_id":"ca672c15-f994-4db7-8ad9-290d641fdbc9","resolution":{"observed_at":"2026-08-14T11:51:15.938326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:15.832440Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.832440Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:0193f21b4fc13083a6010d0f68218e8242f123917a1802ee76eb8010d9182101","observation_id":"20c1f6a0-a470-481a-8dda-61b176022733","resolution":{"observed_at":"2026-08-14T11:51:15.832440Z","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-14T11:51:15.901560Z","title":"Urrutia, A","venue":null,"work_id":"fb02f25e-efe5-4ffb-a91c-74dcdf8d76a2","year":2015},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.837420Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:8144d1b35778e1742d8bdfef69f0fa833063a26e8f4e22619d266d8ebd085b24","observation_id":"34b8f5a3-cee3-4bb9-a672-6b19ce9ab2ef","resolution":{"observed_at":"2026-08-14T11:51:15.906987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:51:15.882315Z","title":"Veenstra, K","venue":null,"work_id":"98241c37-ff06-4be2-ac95-645d5e7d3bad","year":2017},"citing_paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T11:51:15.842574Z"},"links":{"citing_paper":"/paper/1908.08494"},"observation_digest":"sha256:c658b76586502f0c3c12c0f54dada090a08c955beba2b4aed12f09828a1df60e","observation_id":"2599fa6a-06c5-4084-b39a-ca76f2d5345d","resolution":{"observed_at":"2026-08-14T11:51:15.889122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08494","last_updated":"2020-09-05T15:10:39Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T07:36:59.378198Z","submitted_at":"2019-08-22T17:02:13Z","title":"The double traveling salesman problem with partial last-in-first-out loading constraints"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":43},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:1908.08494."}