{"as_of":"2026-08-13T06:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64a8431110ee0ea7e0eba36f12de5581d54044b7244b7897e53f046f6e526ed1","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-12T14:53:55.684958Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:04:39.000509Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T14:04:39.235605Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2411.14994/citation-record","integrity":"/paper/2411.14994/integrity","json":"/paper/2411.14994/citation-record.json","paper":"/paper/2411.14994"},"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-12T14:53:56.035882Z","title":"Improved approximation algorithms for prize-collecting S teiner tree and TSP","venue":null,"work_id":"feb1a643-0964-43f7-aecc-d80117b9edac","year":2011},"citing_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},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.587940Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:e4431c1b0d1d371459f3accd0ed9b00a20ae94bbfe4c4e065c9a412c57bd561e","observation_id":"b0ede03a-2c0d-4d72-ba75-eb953b5518a2","resolution":{"observed_at":"2026-08-12T14:53:56.041156Z","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-12T14:53:56.020951Z","title":"2-approximation for prize-collecting steiner forest","venue":null,"work_id":"84f55eff-3ca3-46b0-8a14-77387b90a9e3","year":2024},"citing_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},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.593692Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:984407dd3e40987ad953174ff3d1190fe75870f7f1d038a12fd33fa90bd7d757","observation_id":"b4e887c6-1159-41d4-bf8b-1be63677e038","resolution":{"observed_at":"2026-08-12T14:53:56.025798Z","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-12T14:53:56.003560Z","title":"Prize-collecting steiner tree: A 1.79 approximation","venue":null,"work_id":"f64eb011-d657-4584-b0fe-95b7ecc872d0","year":2024},"citing_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},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.599049Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:343afa973437918eea1f0afded252c14b94c177730921f0d3cd035708a68134e","observation_id":"d36d7192-eefa-446c-9210-5b0e988bc623","resolution":{"observed_at":"2026-08-12T14:53:56.008761Z","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-12T14:53:55.982840Z","title":"A (3/2+ 1/e)-approximation algorithm for ordered TSP","venue":null,"work_id":"03c0dbed-c602-4753-a761-b621de476bda","year":2024},"citing_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},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.604310Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:ee40072213306d1b71924ef9e0acd7109b5cd194f164afbfbb65078eb6738486","observation_id":"dcbe528e-efe0-4311-b5d2-af4751648057","resolution":{"observed_at":"2026-08-12T14:53:55.987828Z","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-12T14:53:55.967904Z","title":"o hm, Zachary Friggstad, Tobias M \\","venue":null,"work_id":"50cdb726-cbcf-45eb-8c0e-5de0b5147fe6","year":2025},"citing_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},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.609782Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:43c7d6d5866093e20e5c499a1a81bc49fad82d3784ac8b00a0626f85d47ba40a","observation_id":"2e6ed61a-dd30-4683-a6eb-271fb39627f7","resolution":{"observed_at":"2026-08-12T14:53:55.972653Z","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-12T14:53:55.951970Z","title":"A note on the prize collecting traveling salesman problem","venue":null,"work_id":"3891f9c7-0f08-419f-ab13-37fc5c37aefb","year":1993},"citing_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},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.615619Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:ca92f6d08725c26657a476804b26aa3855df9c00ee78d340e2bf780724d59368","observation_id":"9c8278a1-a7a2-4f6e-bfb6-3905ebe8f7c6","resolution":{"observed_at":"2026-08-12T14:53:55.957027Z","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-12T14:53:55.935229Z","title":"On the approximation hardness of some generalizations of TSP","venue":null,"work_id":"d913c30a-3f85-4c0e-b11f-13d760edfb97","year":2006},"citing_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},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.621522Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:d1b676162e251048ebcd4dbc4d457011fcb9b31891178f999bf67c936f640a52","observation_id":"274515ef-a42f-4a16-9e6c-7e99dc052d34","resolution":{"observed_at":"2026-08-12T14:53:55.940912Z","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-12T14:53:55.919087Z","title":"Preserving and increasing local edge-connectivity in mixed graphs","venue":null,"work_id":"d0bf593a-58a3-414c-8fec-74069d8a99fb","year":1995},"citing_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},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.626681Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:4ff9b6be7dcc3bd702707cd65fdf0cc975fd7702d32295c2ba053333cac4e729","observation_id":"ffda51d4-8975-448b-9160-edb00dae748f","resolution":{"observed_at":"2026-08-12T14:53:55.924225Z","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-12T14:53:55.901452Z","title":"A better-than-1.6-approximation for prize-collecting TSP","venue":null,"work_id":"fcca6862-985e-45f6-bde2-cc50d97b862f","year":2024},"citing_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},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.631750Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:7d4282fc957b3e749c4a0924419eeb96b989d733eaf5885a33e1f462435ca755","observation_id":"d51c6aae-8a24-41bb-9aec-2acb46c4a01b","resolution":{"observed_at":"2026-08-12T14:53:55.908045Z","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-12T14:53:55.880558Z","title":"o ckenhauer, Tobias M \\","venue":null,"work_id":"1f9ce907-80cb-486e-a1df-ddcaad2aaf47","year":2013},"citing_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},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.637192Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:0412d6bbf49b1d6d99aed85412320e74c0419c7f13ed7d571f439e3e8e55cb17","observation_id":"7b93be42-bd5a-419e-974a-5ba599143abb","resolution":{"observed_at":"2026-08-12T14:53:55.887025Z","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-12T14:53:55.860876Z","title":"An improved approximation guarantee for prize-collecting TSP","venue":null,"work_id":"4a697946-dfb8-405c-85db-f0f1c6421ddf","year":2023},"citing_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},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.642275Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:8c9bb5c707642ffe36f495d3c65a15c675a161824621824065aeb68a0c5eb540","observation_id":"384ebe64-13ea-485b-ada8-307ee1b7a08b","resolution":{"observed_at":"2026-08-12T14:53:55.867934Z","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-12T14:53:55.843284Z","title":"Worst-case analysis of a new heuristic for the travelling salesman problem","venue":null,"work_id":"3282fc3c-68b5-48f7-88b0-4e81188c1818","year":2022},"citing_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},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.647480Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:40835c97ca459085b09f6804a2af05d41ecf598b0bb2c0f2ee166c214ddfe356","observation_id":"6cb6744c-b53c-44da-bdb5-79d025c9989c","resolution":{"observed_at":"2026-08-12T14:53:55.848118Z","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":{"arxiv_id":"0910.0553","last_updated":"2009-10-03T15:48:44Z","snapshot_observed_at":"2026-07-06T02:02:41.208237Z","submitted_at":"2009-10-03T15:48:44Z","title":"Combining Approximation Algorithms for the Prize-Collecting TSP","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0910.0553","snapshot_observed_at":"2026-08-12T14:53:55.653879Z","title":"Combining approximation algorithms for the prize-collecting TSP","venue":null,"work_id":null,"year":2009},"citing_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},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.653879Z"},"links":{"cited_paper":"/paper/0910.0553","citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:1a74a0757372a82b1b604fa081d7953e11f30f1a6c4e195cdbd37d8f885c3450","observation_id":"c7d1e2de-2214-4c4e-b900-48f7ebbf74eb","resolution":{"observed_at":"2026-08-12T14:53:55.653879Z","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-12T14:53:55.825742Z","title":"A general approximation technique for constrained forest problems","venue":null,"work_id":"667305e3-6ff0-4145-9ede-3c96f1b90e37","year":1995},"citing_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},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.659392Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:ab2cab0e71683e8a5adb12c7be4649bd2d2ac95f534291c02527213303c6a0b2","observation_id":"dc31f0b6-b98e-46d2-b84b-23b1283cb6b4","resolution":{"observed_at":"2026-08-12T14:53:55.830858Z","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-12T14:53:55.807735Z","title":"A (slightly) improved approximation algorithm for metric TSP","venue":null,"work_id":"1235790d-46dc-448f-aaa8-5df9e2cf32be","year":2021},"citing_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},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.664440Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:2ea9396e306772a6c556b9e7da4ba691e43b6d34b6e561c406a1b430636f7d80","observation_id":"6d674787-065c-48ec-91d6-aa5da286b7c7","resolution":{"observed_at":"2026-08-12T14:53:55.813500Z","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-12T14:53:55.788858Z","title":"Linear programming-based approximation algorithms for multi-vehicle minimum latency problems (extended abstract)","venue":null,"work_id":"2ef2264d-fe91-4214-942c-f5dbc421ccab","year":2015},"citing_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},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.670640Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:aae6f8f16e9be08aa6b9c71e70094fb24ebdaa214d6ae7e97069f95269c8cf01","observation_id":"e7b13791-83eb-4b09-852d-6948da60b4e7","resolution":{"observed_at":"2026-08-12T14:53:55.795190Z","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-12T14:53:55.771397Z","title":"Some extremal bypasses in graphs [in russian]","venue":null,"work_id":"0bfc9b3c-bca5-47cb-9d8e-0f3590ec6bb6","year":1978},"citing_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},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.675399Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:9010876d2a8ebed0503ec2f29bfa0a7c60e35fb77fa56a26a4cc5ca061fb41d7","observation_id":"47301489-ad42-4726-b9da-00a432cfa4b3","resolution":{"observed_at":"2026-08-12T14:53:55.777160Z","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-12T14:53:55.680150Z","title":"Approximation Algorithms for Traveling Salesman Problems","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.680150Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:f089cdcc43f944347cba0b6d00b0c0d7b086139c4632e90f5dbb17a3e5a4d29d","observation_id":"416bb1f3-b797-458b-a9fc-f78cc7ce99ec","resolution":{"observed_at":"2026-08-12T14:53:55.680150Z","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-12T14:53:55.741292Z","title":"Reducing path TSP to TSP","venue":null,"work_id":"7e6742dd-f454-4a2f-bc06-ce4e1fef7d46","year":2020},"citing_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},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T14:53:55.684958Z"},"links":{"citing_paper":"/paper/2411.14994"},"observation_digest":"sha256:c0de05f36f3ba60038ddf4edcb67dc8a0464113c2882beaa6bc68ecbc4213a2d","observation_id":"bf69d65b-291f-4a74-8817-d10f0401516a","resolution":{"observed_at":"2026-08-12T14:53:55.748000Z","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"}}],"paper":{"arxiv_id":"2411.14994","last_updated":"2024-11-22T15:09:30Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T05:26:10.094277Z","submitted_at":"2024-11-22T15:09:30Z","title":"Approximating Prize-Collecting Variants of TSP"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":17},"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 1 inbound Pith citation observation for arXiv:2411.14994."}