{"as_of":"2026-08-07T06:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5db090c93bd9dfb6afc813005d2e771ed20d0e2d4ceac13bda61393a53508f47","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:04:38.542320Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2507.12304/citation-record","integrity":"/paper/2507.12304/integrity","json":"/paper/2507.12304/citation-record.json","paper":"/paper/2507.12304"},"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-06T17:04:45.637304Z","title":"Avis and V","venue":null,"work_id":"781215c1-24d7-49ee-9ea2-f3bc0b57d1af","year":1978},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:34.594548Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:275f43f01e4a537d2ed3147d3442840b02693b8d625810953649f727a082178f","observation_id":"ac7688f1-09a6-4251-a903-5b04c1968865","resolution":{"observed_at":"2026-08-06T17:04:45.705165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:45.458089Z","title":"Fast algorithms for geometric traveling salesman problems.ORSA Journal on Computing , 4(4):387–411, 1992","venue":null,"work_id":"f1b42bc4-07a5-44fd-b17e-afbaee887f43","year":1992},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:34.667243Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:3c30429ad85833c4a9be07707067f64490f98826478436ed997ca3a90924619b","observation_id":"3f3dc28c-e5da-49ec-b245-9c34ebed8e39","resolution":{"observed_at":"2026-08-06T17:04:45.539672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:45.243788Z","title":"Exponential lower bounds for many pivot rules for the sim- plex method","venue":null,"work_id":"57e94af6-d011-4b13-985e-257360f7a16d","year":2025},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:34.786434Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:e92dbf3e6fbd25d15a2e10390472de0a82aec52617b8dffabad6d8e304eb2de4","observation_id":"ad776d90-d522-4af1-81d2-d3e9befca989","resolution":{"observed_at":"2026-08-06T17:04:45.357383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:45.039726Z","title":"Brodowsky, Stefan Hougardy, and Xianghui Zhong","venue":null,"work_id":"e7860c62-6ba4-40a6-a08c-3cb81d3f0896","year":2023},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:34.875754Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:163d49c9e34b2628e9056cc7f5080a2b2c8a5c2492dfeaaae68e056b0dc8f7ca","observation_id":"6d30a613-5599-4f4d-8df3-b271b9453404","resolution":{"observed_at":"2026-08-06T17:04:45.129894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:44.889109Z","title":"New results on the oldk-opt algo- rithm for the traveling salesman problem","venue":null,"work_id":"05ec184e-b873-4d24-9bfd-2907181cdde2","year":1998},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:34.972021Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:03252d54bf1787752018274ab237ea1179a148fff46888baaa09ed02f3139498","observation_id":"a6057ebe-a91e-4c77-add1-3f9fde44671c","resolution":{"observed_at":"2026-08-06T17:04:44.960230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:44.718490Z","title":null,"venue":null,"work_id":"6279fee7-1cc2-4db8-89cc-562e4a131f6a","year":1990},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.040141Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:a0e9fc486d67eb851709bbfdbf6923023489b74a3c53703c46eb6325c0d9172d","observation_id":"14d2dd4c-54b7-4e49-821a-a7190c5bd25f","resolution":{"observed_at":"2026-08-06T17:04:44.772025Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:44.489691Z","title":null,"venue":null,"work_id":"6097945b-7890-4479-8a1a-db793333e45e","year":2023},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.168998Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:86b19a624e33346279a680b708ea2ed2ad28c41424930fe085a08cde692ff66d","observation_id":"9ccbfc3e-d133-4f48-b0f4-2cad08768764","resolution":{"observed_at":"2026-08-06T17:04:44.630916Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:44.167180Z","title":"Smoothed analysis of the 2- opt algorithm for the general TSP","venue":null,"work_id":"a082ca8e-6de7-4553-bdd3-a84e081eca77","year":2016},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.269531Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:a980322e699e98e01d5c71a46507d90519a577c0d5669f93ba61b15b8eda98fc","observation_id":"6d6ab920-10aa-4303-a600-570716e9b31f","resolution":{"observed_at":"2026-08-06T17:04:44.304895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:43.906293Z","title":"Worst case and probabilistic analysis of the 2-opt algorithm for the TSP","venue":null,"work_id":"811eb2b8-500c-482b-af50-c2e4ed1f9cb0","year":2014},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.428604Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:1bd3eedc88a5e0df7252dedfdac553146786ac22dae34f8f6d339bfbe266b1cc","observation_id":"df6a42d7-0323-41bb-809a-72cfc69bea58","resolution":{"observed_at":"2026-08-06T17:04:44.028828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:43.645073Z","title":null,"venue":null,"work_id":"0c8958cf-f3ee-43eb-a6cd-65b2fe8e705f","year":1956},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.572698Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:e9085622c092b8742c9c82d17e63d88047a20b4abd2c2d8ea612a011b142965d","observation_id":"a6c50128-48e0-410f-a989-a0e746646598","resolution":{"observed_at":"2026-08-06T17:04:43.770856Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:43.315654Z","title":"On the Smoothed Complexity of Combinatorial Local Search","venue":null,"work_id":"071b1eb9-cea9-4b22-aec9-ff17f030b378","year":2024},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.653879Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:aea41fd4b2ed23fac432b03b2551ae82b03254da5bcfdafe33e6fd76d266e0ec","observation_id":"2b8972c1-64ee-4d8f-8c67-d1b3fcee66e0","resolution":{"observed_at":"2026-08-06T17:04:43.506137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2211.07547","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:04:38.746351Z","title":"On the smoothed complexity of combinatorial local search","venue":null,"work_id":"05ce256b-25ca-4337-8241-2dade59d7221","year":2025},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.712261Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:0cb9a56575ab79e4f113588079718d956b2ed50ab5177917ff1e5f84290ef0d3","observation_id":"6616f29f-d0cc-4030-8778-49ac5fe803f9","resolution":{"observed_at":"2026-08-06T17:04:38.844122Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:42.984008Z","title":"Worst case behavior of the steepest edge simplex method","venue":null,"work_id":"5052a452-ef0a-4f66-8c48-124e6d1cdd63","year":1979},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.778105Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:62b72bc769fcc590cd6549eead2b25e0bd0aa033f175afe1f075e9484afc6ccd","observation_id":"57bb0632-be3d-4f88-b691-465274272fec","resolution":{"observed_at":"2026-08-06T17:04:43.173579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:42.685741Z","title":null,"venue":null,"work_id":"d342e657-6a17-4ec0-9016-2eb56259db58","year":1989},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:35.925099Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:842d1695228b249a55f1eda5edb95bcd51e05ed791844a591d1a51bbe4c4d9c2","observation_id":"8fc02db9-1ae4-44e0-aee9-20683a812d02","resolution":{"observed_at":"2026-08-06T17:04:42.795549Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:42.498591Z","title":"Hoang, and Stefan Hougardy","venue":null,"work_id":"5bf97eb8-cb13-47de-b29b-cc30ba553835","year":2024},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.072890Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:2532e953d62e2fb4d597e861925e9f21a57e5d09474cc0bbb787a960f17293aa","observation_id":"f67df12b-d859-480f-b692-a1d1ac15fcd5","resolution":{"observed_at":"2026-08-06T17:04:42.565996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:42.386521Z","title":"Hoang and Stefan Hougardy","venue":null,"work_id":"b6352599-6dd2-4436-bdd2-5e7a409081cc","year":2023},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.163219Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:d08dc9ef3ae7da19f284f5cb4526565ca05bd804f1f231b4c723306b9965c9db","observation_id":"8f3d5fe9-fbe2-4621-bd9a-bd674f5e3d74","resolution":{"observed_at":"2026-08-06T17:04:42.442698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:42.289761Z","title":"The approximation ratio of the 2-opt heuristic for the metric traveling salesman problem","venue":null,"work_id":"6bf1b93d-48f9-4740-af9e-3009441e3993","year":2020},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.250809Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:397fb53a09a375c8a5fbc45c049a11086019c69a39071715db1985c7cff8fec8","observation_id":"6fbddce0-551f-4e78-b274-b126f7af794b","resolution":{"observed_at":"2026-08-06T17:04:42.340499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:42.109063Z","title":null,"venue":null,"work_id":"5aa31fe6-b722-4aff-819d-cd4ec95505b4","year":1973},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.325312Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:8f90504a223a6852613ca071bc6f58d08bd17dc1bf7a9fbfd8c43d9d9b1f97b3","observation_id":"c99b9706-9dce-4660-946c-e68b9a3519f7","resolution":{"observed_at":"2026-08-06T17:04:42.224439Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:41.966009Z","title":"Johnson and Lyle A","venue":null,"work_id":"bb61fd39-fd4d-41dd-a670-9b47fc1e2be7","year":1997},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.466620Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:79a504c094cb55b13cac39ce77c6a66b8ed1f8a78058b6c9be1f27e501d2cef4","observation_id":"465b0911-6e51-46f2-82bb-24163dbee80a","resolution":{"observed_at":"2026-08-06T17:04:42.024377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:41.812590Z","title":"Johnson and Lyle A","venue":null,"work_id":"fafab61a-0489-439b-af83-618708c12e37","year":2002},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.570708Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:c2eeeb4b316443ddaabbd8968319b71b91ab8283d3abf9a3e0b17e3eac977a36","observation_id":"ae18dfb2-6b49-49c0-a88f-10dd37f30563","resolution":{"observed_at":"2026-08-06T17:04:41.892105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:41.683899Z","title":"Johnson, Christos H","venue":null,"work_id":"8f42395d-1a15-41d5-91ea-ab3d6e8dfa70","year":1988},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.702473Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:336ee48fafa5c27ecf5ac2c9aa3722538917bd5e17027033a182193f0c751ae3","observation_id":"8a1dceea-73f0-4a2d-9705-9c8477660ece","resolution":{"observed_at":"2026-08-06T17:04:41.738569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:41.515629Z","title":"Kleitman","venue":null,"work_id":"206e2bc0-8e19-454f-a57b-085b7357835b","year":1992},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.830444Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:6f07512bb0ff73cc4959feab2d921998d9e25714aea0083be9a48b48f0210a27","observation_id":"8e1783a7-f7b4-43e2-9a64-cc8a5e7555fd","resolution":{"observed_at":"2026-08-06T17:04:41.583365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:41.374189Z","title":"Mount, Nathan S","venue":null,"work_id":"a84984b3-867a-4bf5-9919-94d2fb6dea0f","year":2004},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:36.968451Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:25c352ee1149744721cfc3ac20d592ad58cb24ae4aba5a9732918d46dbd481c3","observation_id":"450cb861-ca66-41d5-92d2-130fea758c35","resolution":{"observed_at":"2026-08-06T17:04:41.452459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:41.221645Z","title":null,"venue":null,"work_id":"e441e452-df83-428a-92b9-af51aa6582d2","year":1972},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:37.108590Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:e5501b2490ba41055113ba285e1dd78ec80a040b9b8828c71125875930555367","observation_id":"5adb64d3-4e13-4982-8334-5c946173ac77","resolution":{"observed_at":"2026-08-06T17:04:41.272676Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:41.027940Z","title":null,"venue":null,"work_id":"96de265e-6c76-43df-b07c-677f51ba8e8b","year":1969},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:37.220517Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:c32079467a30a6f90d584b58235a62621298897c4152ff4102bfb3191cdd82a6","observation_id":"73318d48-6c3d-4c46-8100-6e81f6ca9dd7","resolution":{"observed_at":"2026-08-06T17:04:41.086193Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:40.874548Z","title":"Structure in locally optimal solutions","venue":null,"work_id":"42ba4491-5851-4f34-a60d-4e743ad2fbf9","year":1989},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:37.301583Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:b0682432d7a99ff8c87a757f2e227cbbf8db877d8af0d3c76e8a5657cd7924a0","observation_id":"a0000ed2-064a-419b-9d2e-221dccaadb00","resolution":{"observed_at":"2026-08-06T17:04:40.949263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:40.669815Z","title":"Computer solutions of the traveling salesman problem","venue":null,"work_id":"2f5aeba4-1846-4caf-97fd-6c0b58cc0fa4","year":1965},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:37.485979Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:cdf12c014f9850eb6f50296e2a263ddc24f8b187909174557c551a885dee34ca","observation_id":"d57aec9a-8cd1-4a74-96ac-afa712ccec23","resolution":{"observed_at":"2026-08-06T17:04:40.752535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:40.437428Z","title":"Improved smoothed analysis of 2-opt for the euclidean TSP","venue":null,"work_id":"ee928d1b-f7f7-48c9-9c63-68b02feaa935","year":2025},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:37.557356Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:bd666ee9689cabe8324d7481b667329d16d94bb9cd2d4aea8ad6fcefce61b8bd","observation_id":"57246904-c924-470e-9589-c5776e82ac65","resolution":{"observed_at":"2026-08-06T17:04:40.546062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.19594","last_updated":"2024-09-26T17:59:01Z","snapshot_observed_at":"2026-07-06T16:40:31.491333Z","submitted_at":"2023-10-30T14:51:40Z","title":"Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.19594","snapshot_observed_at":"2026-08-06T17:04:37.663299Z","title":"Superpolynomial smoothed complexity of 3-flip in local max-cut","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:37.663299Z"},"links":{"cited_paper":"/paper/2310.19594","citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:a44860e61e9713f51439bd2159f35f065f1762b368b891d1dca1b7d670de1e9a","observation_id":"c396724b-953d-49f9-9b30-5544941fdcea","resolution":{"observed_at":"2026-08-06T17:04:37.663299Z","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-06T17:04:40.250224Z","title":"On the power of nodes of degree four in the local max-cut problem","venue":null,"work_id":"e25c22ac-b7ad-43a0-9652-3c92e0bcde1b","year":null},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:37.753796Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:fbb732cb439c75fd475b37013ecc364e34452d05441f2f6c068b8ee77b4cb0be","observation_id":"e095d8b1-09e4-49e4-bf56-dbd0894a1f9d","resolution":{"observed_at":"2026-08-06T17:04:40.346046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:39.958324Z","title":"Papadimitriou","venue":null,"work_id":"d179c567-ed91-4b1e-9f65-6686dfa6c346","year":1978},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:38.014487Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:fe9b7a1e68cf63590e53fc664c4535a0f5c64114d6ec23dcff21caeb336ffb92","observation_id":"4778c26a-c881-4786-8c3d-311ee4f716f2","resolution":{"observed_at":"2026-08-06T17:04:40.054529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:39.774106Z","title":"Papadimitriou, Alejandro A","venue":null,"work_id":"9f745cb5-0337-4b18-bfba-87ecc18282d9","year":1990},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:38.118487Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:e65592f701e57745d26bd42438de39bafbf6ade26fafeb0ca11ecba7ad50c06f","observation_id":"ce667ff2-3c8e-4b56-b076-26e078eb87d9","resolution":{"observed_at":"2026-08-06T17:04:39.854541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:39.536794Z","title":"Integer linear programs and local search for max-cut","venue":null,"work_id":"1db942d0-9616-4689-912d-e412474b1091","year":1995},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:38.174893Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:1024b2c5a38535e31c9ea966d74bc4cca0f3e75482b64089ef34c2f5044d6eed","observation_id":"fce2361a-36b8-4251-9e9c-455aa0dc4857","resolution":{"observed_at":"2026-08-06T17:04:39.652002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:39.324510Z","title":"Sch¨ affer and Mihalis Yannakakis","venue":null,"work_id":"0eb980c0-64cc-46be-87df-b32fb091f75a","year":1991},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:38.283711Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:156d76ece24a88e2c1ba77d2a88723d3b96e4b46d8dd78edb77f9acd1b2606ff","observation_id":"3c93df68-ed73-49a2-ab2e-986651f454c8","resolution":{"observed_at":"2026-08-06T17:04:39.413616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:39.176767Z","title":"Computational complexity","venue":null,"work_id":"4a5f1832-e521-4932-a072-97477cb610c9","year":2003},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:38.415064Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:7787203e32d3f4af27fb2bda789bdccaca5418a2f59d4e5a8a937bb0e1cc37c3","observation_id":"1c435ff4-2b62-4d31-b596-aaae4bea2eee","resolution":{"observed_at":"2026-08-06T17:04:39.271714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:38.955984Z","title":"On the approximation ratio of the k-opt and lin-kernighan algo- rithm for metric and graph tsp","venue":null,"work_id":"825f1c0c-ad92-41af-83e7-ea7d2c234ca2","year":2020},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:38.542320Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:8281ca9abb32cef847e5c7a1f267eec1750e488715f4f39d6ae1005e87e01389","observation_id":"f6b1b754-8229-4f8c-95e1-b75ad974067c","resolution":{"observed_at":"2026-08-06T17:04:39.033108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:04:37.856016Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","version":1},"reference_index":275,"source":"pdf_text","source_observed_at":"2026-08-06T17:04:37.856016Z"},"links":{"citing_paper":"/paper/2507.12304"},"observation_digest":"sha256:c3809d1f6b6037f3781d038756a446dffb4e7d65281feb3f2bf4e847fc84a771","observation_id":"80184460-05d4-4e3b-b39b-8893266a8715","resolution":{"observed_at":"2026-08-06T17:04:37.856016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.12304","last_updated":"2025-07-16T15:04:26Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T16:46:41.065884Z","submitted_at":"2025-07-16T15:04:26Z","title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":37},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2507.12304."}