{"as_of":"2026-08-13T12:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:103e6f8a9e832851c20be2e540e7a06171490f4f3854bd79d244cfa0dad58681","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:04:39.049203Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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/2509.00448/citation-record","integrity":"/paper/2509.00448/integrity","json":"/paper/2509.00448/citation-record.json","paper":"/paper/2509.00448"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.14994","last_updated":"2024-11-22T15:09:30Z","snapshot_observed_at":"2026-08-13T05:26:10.094277Z","submitted_at":"2024-11-22T15:09:30Z","title":"Approximating Prize-Collecting Variants of TSP","version":1},"cited_work":{"arxiv_id":"2411.14994","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.14994","snapshot_observed_at":"2026-08-05T14:04:39.235605Z","title":"Approximating Prize-Collecting Variants of TSP","venue":"cs.DS","work_id":"36ffe32b-5792-4d5d-abdd-32f9ce93fa90","year":2024},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.000509Z"},"links":{"cited_paper":"/paper/2411.14994","citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:651e2b9beb721060876cc70b6acc720ffbfa01a6f463e42b15ef285e44f6d2db","observation_id":"86c0c080-7bd0-4af3-bebc-3ee17b1764dc","resolution":{"observed_at":"2026-08-05T14:04:39.240475Z","resolver_source":"local_arxiv","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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.507915Z","title":"A (3/2 + 1/ e)-approximation algorithm for ordered TSP","venue":null,"work_id":"9bec61c0-88a9-469d-b84e-4807ee12b8d6","year":2024},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.004204Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:45f65be636a5ce04de632e447808d1835e8be434632b0945c06455aa2cc0cccf","observation_id":"238c8a56-ae21-4d6b-b8e4-e9382f2c46a4","resolution":{"observed_at":"2026-08-05T14:04:39.519056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.482146Z","title":"Preserving and increasing local edge- connectivity in mixed graphs","venue":null,"work_id":"9c6a9d04-19a7-4dcc-9672-d82498c195a5","year":1995},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.006940Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:339c2ad2f39030d92fbaf60c6f8f7d3c1b901d649846bcc0f35de927fd801a3c","observation_id":"1df6756f-7707-46ca-9130-59b09473129f","resolution":{"observed_at":"2026-08-05T14:04:39.492112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.450036Z","title":"A better-than-1.6-approximation for prize- collecting TSP","venue":null,"work_id":"e2ca483f-830f-4ef5-a3d5-82a349e919a8","year":2024},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.009951Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:1d184acac539af25fda088bcbdda640293acd103b1a3c50181fbd54d63eed416","observation_id":"f2f7842f-2fff-406f-a125-8d57f6fd0210","resolution":{"observed_at":"2026-08-05T14:04:39.461589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.417371Z","title":"An improved approximation guarantee for prize-collecting TSP","venue":null,"work_id":"80f1bbf9-e957-4b4f-bc18-8b5feb053bac","year":2023},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.012862Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:1ce52dbfdc3840ef0ac1bd13497113abc32b0ba597f58c0d6d17f07d6e07c146","observation_id":"cdf688ba-77fe-4f4e-ba22-d84e342b4803","resolution":{"observed_at":"2026-08-05T14:04:39.431294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.376059Z","title":"Approximating traveling salesman problems using a bridge lemma","venue":null,"work_id":"7b637b78-0dd4-4a39-a0d9-f59060e3622d","year":2025},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.015670Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:096bb814127ec479dce8064d129f8950cc119e0e32f3dcbc75aabcc61517e69a","observation_id":"e3e3ef6e-0596-47c8-a29f-e2e2d2ccdd35","resolution":{"observed_at":"2026-08-05T14:04:39.392715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.354109Z","title":"Worst-case analysis of a new heuristic for the travelling salesman problem","venue":null,"work_id":"418cfa8f-29ff-4531-ad7f-9c3f026b2dd3","year":1976},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.018594Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:c84688443bbe379ba5c7dd2fd46bb841aba05480bf5c45ec24c99f1ab377f0d8","observation_id":"26dd0619-9089-496f-add2-fe09517f6d59","resolution":{"observed_at":"2026-08-05T14:04:39.357301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.346095Z","title":"Compact, provably-good LPs for orienteering and regret-bounded vehicle routing","venue":null,"work_id":"f7f0757d-55b3-4cf8-9420-0787fe6b7f41","year":2017},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.021439Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:0265ac44759e0ae7f8d6b321b9ff6f10d62a34cb7e08f221a6702c4d26434aa9","observation_id":"5ff6b77d-62f5-425c-9310-edaa03ddc489","resolution":{"observed_at":"2026-08-05T14:04:39.348909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.337876Z","title":"A randomized rounding approach to the traveling salesman problem","venue":null,"work_id":"122a3cdc-754b-4438-bd39-a146fa31c91e","year":2011},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.024019Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:6c3d85ce5983fd91ae39904bbb6927d7f1fa53eaf1a0c1f37a90251d4520b8a6","observation_id":"837ee45e-2367-4f6d-bcc6-8aaf651fec23","resolution":{"observed_at":"2026-08-05T14:04:39.340683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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-08-05T14:04:39.026393Z","title":"Karlin, Nathan Klein, and Shayan Oveis Gharan","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.026393Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:1f68cd4afd6a6da43f30a91511f38b65786c05d3dcdfde3feace7ba5151c2a91","observation_id":"cc080eee-7d07-421e-aafc-cfd5de8a908f","resolution":{"observed_at":"2026-08-05T14:04:39.026393Z","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-05T14:04:39.320778Z","title":"Approximating graphic TSP by matchings","venue":null,"work_id":"aef63714-5a25-4109-88ec-57c0ac119afe","year":2011},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.028959Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:63de49dfddaf5db25ca41fde40333c3fa1b6334ff1ff32dd85cb3e1a9436063a","observation_id":"4392ead6-a9ed-4aaf-8ce4-40d135fd15fa","resolution":{"observed_at":"2026-08-05T14:04:39.327239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.310185Z","title":"13/9-approximation for graphic TSP","venue":null,"work_id":"07d7c8fa-ccfe-434d-897e-81c2f96620d3","year":2014},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.031387Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:48e1f1aea5a732ae2e1408b901704f5e2b2e6aedac947701dea46bb41eaf04a8","observation_id":"2902a87f-5ec5-4773-a51c-567ab5853c35","resolution":{"observed_at":"2026-08-05T14:04:39.312615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.301589Z","title":"Linear programming-based approximation algorithms for multi-vehicle minimum latency problems","venue":null,"work_id":"086b4dbf-0b7a-4337-a7f9-4cfca5e28d15","year":2014},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.033739Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:1ff782759a7c8a9ff0a3ecc67e0fa9f3e7e84488fce4e29e618a6a8be5174713","observation_id":"37256205-f04e-4a08-b46d-2df1f225afec","resolution":{"observed_at":"2026-08-05T14:04:39.304376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.293256Z","title":"Combinatorial Optimization: Polyhedra and Efficiency , volume 24 of Algorithms and Combinatorics","venue":null,"work_id":"99499ac9-1623-4200-a81b-ea593f957485","year":2003},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.036202Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:f6c9a9d7317dc0b18a1d6c9bfdc2d144a43c3a2f6648bf2a5b9da889117d47c9","observation_id":"e81d9801-58cc-46fa-bd72-e64c386daf20","resolution":{"observed_at":"2026-08-05T14:04:39.296485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.283916Z","title":"Shorter tours by nicer ears: 7/5-approximation for the graph- TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs","venue":null,"work_id":"f954f28e-61b9-4890-b23f-7dabeaff128c","year":2014},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.038870Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:36c31ae2802cffc515b82ee4c3185ce1d473e42a5017a02aece2719e7a1e64b0","observation_id":"61e463a4-71ad-47fb-b7d0-06a5904735d2","resolution":{"observed_at":"2026-08-05T14:04:39.287173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.275610Z","title":"Serdjukov","venue":null,"work_id":"61ff8044-7dfe-4abf-aff6-06b9b8ab1ac9","year":1978},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.041439Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:6c4a51d197ad0dc0450ba00bdff92f5c80245f8886e2588c4bd7fa398f61a63a","observation_id":"3333ca2b-6e36-4296-b5c3-8d87b09adbab","resolution":{"observed_at":"2026-08-05T14:04:39.278406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.266815Z","title":"Approximation Algorithms for Traveling Salesman Problems","venue":null,"work_id":"e9d22509-d6b2-4a6f-abc5-b3ec560bd31a","year":2024},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.044133Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:6c151366cedbe0195526e9bbbc4a2b1f891b0645eed9b3c76a71268acac70308","observation_id":"21a8dea3-620a-4d9c-878e-499c04476039","resolution":{"observed_at":"2026-08-05T14:04:39.269728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.257359Z","title":"Reducing path TSP to TSP","venue":null,"work_id":"b5eb2a0c-7404-4ea2-9189-d4f8d56be43b","year":2021},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.046821Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:bc287394fc43790c804a37481381582e2f1729ffa5af6119fd5a1a90103086a2","observation_id":"09392238-4b9f-4e1d-a6ab-0615eeaf8f1f","resolution":{"observed_at":"2026-08-05T14:04:39.260308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:04:39.247332Z","title":null,"venue":null,"work_id":"a3b9144a-be47-4f0d-afea-11d4786d67a8","year":1980},"citing_paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T14:04:39.049203Z"},"links":{"citing_paper":"/paper/2509.00448"},"observation_digest":"sha256:dc6f36a13ee6a9d63b8a0773bdbcab304896a575c61320a10c63fcd25173e65d","observation_id":"33ba3692-52ec-40e6-ab81-a1c42408adc2","resolution":{"observed_at":"2026-08-05T14:04:39.250928Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.00448","last_updated":"2025-08-30T10:33:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T16:35:07.527952Z","submitted_at":"2025-08-30T10:33:39Z","title":"Approximating Graphic Multi-Path TSP and Graphic Ordered TSP"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":16},"total_outbound_references":19},"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 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2509.00448."}