{"as_of":"2026-08-22T15:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8059ca94944ebe9c9a440d49ff377993c7508f128a93284470110f85325a424f","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:14:42.654533Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2504.18749/citation-record","integrity":"/paper/2504.18749/integrity","json":"/paper/2504.18749/citation-record.json","paper":"/paper/2504.18749"},"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-16T10:14:43.009135Z","title":"Deshpande, P","venue":null,"work_id":"55889e9c-dd33-4e27-be3e-c2c64de5057a","year":2023},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.586467Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:84c86dcaa6e94f84819de67d09d35df0136d767cb721cd852b5334b87961f22d","observation_id":"dd5e2bc3-9760-419a-a45c-bc7d5baa08c1","resolution":{"observed_at":"2026-08-16T10:14:43.014487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18388","last_updated":"2025-04-18T19:12:19Z","snapshot_observed_at":"2026-08-16T14:48:19.768774Z","submitted_at":"2023-10-27T10:32:12Z","title":"Last Truck Scheduling for Middle-mile Next-day Delivery Coverage","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18388","snapshot_observed_at":"2026-08-16T10:14:42.592395Z","title":"Benidis, G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.592395Z"},"links":{"cited_paper":"/paper/2310.18388","citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:38eade55efcbf8656d110a9e83118cf17d793e7f602a79306ee9effa87389547","observation_id":"2f95c911-d697-491d-bbc6-87513be6394a","resolution":{"observed_at":"2026-08-16T10:14:42.592395Z","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-16T10:14:42.991395Z","title":"Rossi, P","venue":null,"work_id":"008645dd-40bd-491f-b647-e36461844fd4","year":2006},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.597726Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:ff3ea3e6f0d373e9d2465cd64048ecc45cc2939ff114a2b19574b36ec455e803","observation_id":"94612f2d-67cd-437a-b15f-d62f57addab4","resolution":{"observed_at":"2026-08-16T10:14:42.996947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.603178Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.603178Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:4f3bf5b5617b19892b5c140563571a7b1baad2b96d6b72c9e7465e7613ebe5f6","observation_id":"17d7ba63-437d-49f2-ac50-d2bcb14eb67b","resolution":{"observed_at":"2026-08-16T10:14:42.603178Z","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-16T10:14:42.973159Z","title":null,"venue":null,"work_id":"7ac3bd31-109b-438c-a3ef-a6966b81ae80","year":2024},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.608474Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:2fa5eeed363de5fac4cc848e417409d2c71f754327c9b7ec63c812511ec392a0","observation_id":"639fb1f4-9b93-4b71-a463-a2a4581028e0","resolution":{"observed_at":"2026-08-16T10:14:42.978564Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.954638Z","title":null,"venue":null,"work_id":"9eb8cae9-e054-4f17-9446-456b42aa957f","year":2025},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.613914Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:7ea3e8984d1dc3749bebc1ccc7ec518380b30b65471b29cc4aa7a110455fcde4","observation_id":"f7a34407-8262-43fd-ab05-8906a6b8248a","resolution":{"observed_at":"2026-08-16T10:14:42.959868Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.937188Z","title":null,"venue":null,"work_id":"9f823a0e-2cf1-49f3-b294-fc75cc3b9dc7","year":2024},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.619452Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:9f4e7096d284ab31433cdce83e436db3db77fbf7665ade379df8ab46a7ccffe8","observation_id":"a384c014-5161-48f5-a109-ffa88d6cb26b","resolution":{"observed_at":"2026-08-16T10:14:42.943039Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.920589Z","title":null,"venue":null,"work_id":"87fe87dd-b038-4174-a823-1473371391c7","year":2022},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.624573Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:00035dfcef1082175850d15e44e8736c241debc9685d80b046dd3fadb37158ac","observation_id":"65d35f1a-b9b1-4e77-8f6d-bdcb71a112ba","resolution":{"observed_at":"2026-08-16T10:14:42.925593Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.903792Z","title":"Baptiste, C","venue":null,"work_id":"8c03c66c-227d-40fa-9157-1fbe1ab3b5aa","year":2001},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.630170Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:fc5111de71876b3130e2cce4b5773662b836526a6ca599e1dafcfd131f166950","observation_id":"532f7b86-bbef-4012-9d2f-2b76c55b1129","resolution":{"observed_at":"2026-08-16T10:14:42.908652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.886551Z","title":null,"venue":null,"work_id":"7d15080a-4d14-489e-bb89-f722368ddc49","year":2019},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.634974Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:01ab9599e0b8a4c3208d3c023bd08d37a7de0ec35605947a68086d16a503a143","observation_id":"13d9b8d7-9005-40da-a66f-5a384f4e6510","resolution":{"observed_at":"2026-08-16T10:14:42.891355Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.870259Z","title":"Barra, L","venue":null,"work_id":"cefa8d87-47da-419b-8489-77b7793deace","year":2007},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.639737Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:4d3e763f1fee7a09387feaa7864db9623974c48219857bcee2aa3c5c17978437","observation_id":"a21e9035-294e-4079-91e3-a865bd00242e","resolution":{"observed_at":"2026-08-16T10:14:42.875239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.854238Z","title":"Perron, V","venue":null,"work_id":"ec2b474d-3bc2-45c7-a572-0612a7cad19b","year":null},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.644728Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:a449f3a1e288ca8f2519bf7bc2e5da4aa130dce4d37f7b25e1d4558eb1545ce2","observation_id":"0143f372-190f-43bd-a78d-e36d36f3fa24","resolution":{"observed_at":"2026-08-16T10:14:42.859108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.838407Z","title":"Junker, S","venue":null,"work_id":"4ccef1ef-7068-48d8-8928-499cb85bb4cc","year":1999},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.649928Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:e8f1b5ba15b22ac317dd310e6b9a1e28b738c20664eea2fc570fc176ba2a25b4","observation_id":"06eeb9a6-db06-49fb-b3f7-68a23f36a1a0","resolution":{"observed_at":"2026-08-16T10:14:42.843038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T10:14:42.820225Z","title":"warm starting","venue":null,"work_id":"4343e609-8c2b-4a94-b224-f7f0d81c9658","year":null},"citing_paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T10:14:42.654533Z"},"links":{"citing_paper":"/paper/2504.18749"},"observation_digest":"sha256:29bf8ebdbec6c8226b3c2e2e1cf3c3aa98035bab4bdca558938f992bcd3fd859","observation_id":"537fab61-c580-4ce6-b6d5-64be14168fcf","resolution":{"observed_at":"2026-08-16T10:14:42.826324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.18749","last_updated":"2025-04-26T00:10:15Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T16:06:51.748827Z","submitted_at":"2025-04-26T00:10:15Z","title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":14},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2504.18749."}