{"as_of":"2026-08-13T13:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4af89b65b5673f9696e212eb78248cffc80914a766ef7bb813d5a58cfcdc7bd7","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T18:35:21.050589Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2607.04497/citation-record","integrity":"/paper/2607.04497/integrity","json":"/paper/2607.04497/citation-record.json","paper":"/paper/2607.04497"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T18:35:21.050589Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:db1fc542dbad39ada27b3f3de92702a71bde696cd9ea6e10c1d223ca3516244d","observation_id":"e5603ea7-1377-49c8-9b0d-773eecfd10fc","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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":"10.1002/net.3230130212","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Networks","work_id":"0811633c-7b7c-4b76-8c4b-044ed5404edb","year":null},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:467437e246fb2ddad40902408c0c7a3a025f595611a2029869d13d4b04f3f852","observation_id":"1eedc248-bd8a-4214-8c6d-b8f22c335bb5","resolution":{"observed_at":"2026-07-11T18:38:10.702939Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:48.727038+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:48.727038+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6675.50719","doi":"10.1023/b:jmma.0000026675.50719.ce","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Resource constrained shortest path problems in path planning for fleet management.Journal of Mathematical Modelling and Algorithms, 3(1):1–17, 2004","venue":"Journal of Mathematical Modelling and Algorithms","work_id":"8a23f44f-4f6a-4e08-8b5b-87983827663a","year":2004},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:e11f1e94d6ed141ec3b6512731375749182b7f3389feb862d4e8e14d54f0b948","observation_id":"1aefa9fc-8f80-424f-a52b-7247e48ee184","resolution":{"observed_at":"2026-07-11T18:38:10.728834Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:49.023114+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:49.023114+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1110.0975","last_updated":"2011-10-05T13:14:56Z","snapshot_observed_at":"2026-07-06T02:35:13.380908Z","submitted_at":"2011-10-05T13:14:56Z","title":"Bisectors of the HARPS Cross-Correlation-Function. The dependence on stellar atmospheric parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1110.0975","snapshot_observed_at":"2026-07-11T18:35:21.050589Z","title":"New route relaxation and pricing strategies for the vehicle routing problem.Operations Research, 59(5):1269–1283, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"cited_paper":"/paper/1110.0975","citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:03be8211dc7654d385cdaaa11c09dffd7dff761affa228632efb2756b69923be","observation_id":"54d6fbfb-ff73-47f9-b579-8be139bcef18","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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":"10.1287/moor.22.1.110","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The circuit polytope: facets.Mathematics of Operations Research, 22(1):110–145, 1997","venue":"Mathematics of Operations Research","work_id":"ad84c89c-5fe2-4019-908c-d018f2625184","year":1997},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:82c3707f3caa5e07928ebad38d740e9a8e7d1c6bc9837d197cbd0b6c5137dd21","observation_id":"d8f7586e-8872-4558-8d24-b3b26e6ea93e","resolution":{"observed_at":"2026-07-11T18:38:10.739470Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:49.529887+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:49.529887+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-11T18:35:21.050589Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:e9a6de160477d3def5775f44ea8614efc72e2ab604b9bfc08692a5d11adf55f6","observation_id":"2be00616-3cb5-40e5-af7f-3206915658e0","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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-07-11T18:35:21.050589Z","title":"Exact branch-price-and-cut algorithms for vehicle routing.Transportation Science, 53(4):946–985, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:20a08c479aa92285e37855ca0f51b53e4acc2d43277d6c4fe74cf60cdf598098","observation_id":"cc9f320e-f5fd-4f43-8887-bb69ea171391","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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":"10.1007/s10479-012-1162-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A computational study of solution approaches for the resource constrained elementary shortest path problem.Annals of Operations Research, 201(1):131–157, 2012","venue":"Annals of Operations Research","work_id":"5c12f47f-3f5d-4a25-a594-f58414365450","year":2012},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:9a508e515ffc867006cfabe178ec4e99a4b5ad416238d0a16a49b3f26471f344","observation_id":"bf58a5f7-db1d-4dc9-bd18-e8a71cf9b22f","resolution":{"observed_at":"2026-07-11T18:38:10.727044Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:50.351871+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:50.351871+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-11T18:35:21.050589Z","title":null,"venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:1f3e7384131673acc954882d72677f8ea42ae6b3a0741daef6d8aff9a4dbde40","observation_id":"6387ae6f-575f-4210-b32a-0bbb50a46b32","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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":"10.1016/j.ejor.2013.03.009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A note on the separation of subtour elimination constraints in elementary shortest path problems","venue":"European Journal of Operational Research","work_id":"df2ec8ac-0717-4309-b70f-c51ea3e828ea","year":2013},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:ce52c4e341ded05a1e95af628d69e4a9b8da56b6c5a7b8ffbdd0b07c950d5587","observation_id":"265b057a-4aea-406b-923c-87ff499562a3","resolution":{"observed_at":"2026-07-11T18:38:10.707092Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:50.620484+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:50.620484+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00291-012-0302-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving elementary shortest-path problems as mixed-integer programs.OR Spectrum, 36(2):281–296, 2014","venue":"OR Spectrum","work_id":"62d1c69d-64a2-43ee-9252-6e3ca84d05c9","year":2014},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:0eacae2de1023b4f9947c435433a0c561c2561395deb779e716269e1dee8dc6a","observation_id":"8878a284-a866-4a18-9700-46aeadd78a0e","resolution":{"observed_at":"2026-07-11T18:38:10.721580Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:50.872639+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:50.872639+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/net.20033","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems.Networks, 44(3): 216–229, 2004","venue":"Networks","work_id":"ff66381a-addf-4159-94df-ca0a40b48caa","year":2004},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:86c80615640482f062a55bb3e99e412bd9c53107b1a34cc40495b44e1f49689f","observation_id":"1f4a714b-d75e-4eb5-908c-415b10313e21","resolution":{"observed_at":"2026-07-11T18:38:10.758201Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:51.101778+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:51.101778+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-11T18:35:21.050589Z","title":"PhD thesis, Georgia Institute of Technology, Atlanta, GA, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:7e03b31347614f7ca7a373f2f8cabeeb3506290d12c61467d4a37d527d6aaf1f","observation_id":"a5e3a433-23f5-49d2-9d63-f70ee900a169","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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":"10.1137/0219009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Very simple methods for all pairs network flow analysis.SIAM Journal on Computing, 19(1): 143–155, 1990","venue":"SIAM Journal on Computing","work_id":"210dee49-9c22-4a41-b692-057abf86ab18","year":1990},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:6ec85fe7cb7c3a4f66f20053cf88b6775749922b7043cf2fa3e633be362ac9ce","observation_id":"0ba69e88-4fba-4dca-9458-5eaf00661754","resolution":{"observed_at":"2026-07-11T18:38:10.734832Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:51.365606+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:51.365606+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-11T18:35:21.050589Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:395659fa52c9772502fb6dc917fa4c6977b1b0cd7c4e1a5e1e179b40887c8f08","observation_id":"260dd0b8-ae8d-4d95-b23a-3e6b3f7cff60","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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":"10.1016/j.cor.2016.04.013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving resource constrained shortest path problems with lp-based methods","venue":"Computers & Operations Research","work_id":"1390519f-431e-4503-83e7-3a2a3d11e78f","year":2016},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:d671fd506e214a24d21a681fc6f10c86659e37a0dd1a390e7b4ebed67bfa2b8a","observation_id":"c3281495-d28b-47a0-bfb3-7b99cf0440a4","resolution":{"observed_at":"2026-07-11T18:38:10.763232Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:51.863159+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:51.863159+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-11T18:35:21.050589Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:b22d72f6faa1894b6232061afc07938f2e827e2b5637381ec625ce4b60656300","observation_id":"d564a9d1-42f6-4883-aa34-b7e2bad347f8","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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-07-11T18:35:21.050589Z","title":"A branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:b6fd2737eefba2c8d3005cb1346987b04eb9fa1936440f50587fec6f23fa9b72","observation_id":"e0e62ba8-d2e7-4175-b067-3ddc8d53e05e","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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":"10.1016/j.disopt.2014.08.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jepsen, Bjørn Petersen, Simon Spoorendonk, and David Pisinger","venue":"Discrete Optimization","work_id":"2149be7f-b7eb-421f-87e4-dd85333aa114","year":2014},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:b99c673bc36d11e843e64dde0544c91bf8833b38db852694909e2458ff63be4b","observation_id":"d158c174-e3cf-47bd-b230-4378d8c3e395","resolution":{"observed_at":"2026-07-11T18:38:10.731972Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:52.153731+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:52.153731+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2019.07.014","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints.European Journal of Operational Research, 289(3):879–896, 2021","venue":"European Journal of Operational Research","work_id":"ac3a4215-7eb7-4c06-a2bd-afe2ef97783d","year":2021},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:ce7c2a59a3270c08f48f6663f88ffac196e8fbfb9084e75cf9f93740cb240665","observation_id":"98208703-5e00-4173-a610-2d55ecc6aafa","resolution":{"observed_at":"2026-07-11T18:38:10.752067Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:52.409668+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:52.409668+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-005-0652-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Letchford and Juan-José Salazar-González","venue":"Mathematical Programming","work_id":"60b04198-44b6-440f-a688-816f980786ed","year":2006},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:37b120b05e33297d6a52a359e252b64197b8345de6163c8fabf637c7f28d913a","observation_id":"a2c4549a-8443-4ece-94ba-13ac64824bf7","resolution":{"observed_at":"2026-07-11T18:38:10.743482Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:52.659492+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:52.659492+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-11T18:35:21.050589Z","title":"Medaglia","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:abf5805d498e7116cc0193df9e756bbcbef34bc60b4013d54181bfd8f3618f5e","observation_id":"3db9fff0-58fa-4c38-9ca5-8e9c948753c6","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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-07-11T18:35:21.050589Z","title":"A generic exact solver for ve- hicle routing and related problems.Mathematical Programming, 183(1–2):483–523, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:21fb93ede72f0bd85a7b63d302962aeedeeccb73f3662d3b1f2d4e79ff102612","observation_id":"3f22e296-9eb7-4ffe-9eca-8d773ff7ba44","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.disopt.2006.05.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints.Discrete Optimization, 3(3):255–273, 2006","venue":"Discrete Optimization","work_id":"9ba19e9f-eb41-4f03-a868-985e6eb9e9d6","year":2006},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:1050b1aeec3836d17d035c0f6ba8c0d717cfabe8b88cccac0112b69f4f281057","observation_id":"b90320fa-00c7-492a-90e7-dcdff5bba5b2","resolution":{"observed_at":"2026-07-11T18:38:10.717152Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:53.147336+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:53.147336+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.0985","doi":"10.1287/trsc.2020.0985","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A bucket graph-based labeling algorithm with application to vehicle routing.Transportation Science, 55(1):4–28, 2021","venue":"Transportation Science","work_id":"367e5f0a-9ce6-48c1-8df7-f9b92a5cf7a6","year":2021},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:3fcb8da844dbeec5910c91179f401558dd95a4fa75b84369dda250837cdf5136","observation_id":"7e066320-aaaa-43a8-b683-cb13b6884ce9","resolution":{"observed_at":"2026-07-11T18:38:10.739064Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:53.374498+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:53.374498+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-11T18:35:21.050589Z","title":"PathWyse: a flexible, open-source library for the resource constrained shortest path problem.Optimization Methods and Software, 39(2):298–320, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:e34caf70af1252c699d1d5c03fed69c9d615f5543bfe622b64427bcc62f245f1","observation_id":"0f0626db-b4b6-4f19-8a74-17b58e6b72d2","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.30847","last_updated":"2026-06-29T19:23:57Z","snapshot_observed_at":"2026-08-06T10:29:23.505463Z","submitted_at":"2026-06-29T19:23:57Z","title":"$\\texttt{bucket-graph-spprc}$: an extensible C++ library for the shortest path problem with resource constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.30847","snapshot_observed_at":"2026-07-11T18:35:21.050589Z","title":"bucket-graph-spprc: an extensible C++ library for the shortest path problem with resource constraints, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"cited_paper":"/paper/2606.30847","citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:c4f4f4d1571320fa448f9e426144f664df664ff483e70a101c6bcde4118e6968","observation_id":"cdabb821-f484-4c40-b830-1f184baeeb76","resolution":{"observed_at":"2026-07-11T18:35:21.050589Z","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":"10.5281/zenodo.21205088","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T18:38:10.706987Z","title":"cptp: a C++23 branch-and-cut solver for the capacitated profitable tour problem, 2026","venue":null,"work_id":"efe01868-a810-4963-85a5-73a29aec2cd5","year":2026},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:2b81527a7e03e668df2a2aae9e86231f6ebbdf49770355e7b8fe1a78567cc62c","observation_id":"7d4558da-c084-4ea2-9821-c5f4faf857f3","resolution":{"observed_at":"2026-07-11T18:38:10.709933Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:53.913559+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:53.913559+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2016.01.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Integer programming formulations for the elementary shortest path problem.European Journal of Operational Research, 252(1):122–130, 2016","venue":"European Journal of Operational Research","work_id":"7f3df9ce-ae31-484d-a9c3-3784e633d1af","year":2016},"citing_paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T18:35:21.050589Z"},"links":{"citing_paper":"/paper/2607.04497"},"observation_digest":"sha256:75ff869c6ca7c3e2dfff91f422260d6e91df27bf73a9ac673035d7b057f6334f","observation_id":"a799be79-4230-4fab-9b07-1d5cd22e5808","resolution":{"observed_at":"2026-07-11T18:38:10.780385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:54.164587+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:54.164587+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.04497","last_updated":"2026-07-05T20:47:08Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T02:50:23.320423Z","submitted_at":"2026-07-05T20:47:08Z","title":"An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":16,"verified_fuzzy":0},"total_outbound_references":29},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2607.04497."}