{"as_of":"2026-08-16T17:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ccb95e7d9bb50fd3e27ec2e8ba507840e366e4210f9a298c195768c13c2bc78a","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:31:21.489995Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.09325/citation-record","integrity":"/paper/1908.09325/integrity","json":"/paper/1908.09325/citation-record.json","paper":"/paper/1908.09325"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:21.421347Z","title":"Popularconjecturesimplystronglowerbounds for dynamic problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.421347Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:42ced68ba465ed08f2191f7407540c4be274d33bd2466448d2a62793495f7a07","observation_id":"11c47f88-d19f-43cc-9ed0-371a0175fbe1","resolution":{"observed_at":"2026-08-14T11:31:21.421347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:21.425985Z","title":"Finding and counting given length cycles.Algo- rithmica, 17(3):209–223, 1997.doi:10.1007/BF02523189","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.425985Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:b0fec4877a75426cf0cd9b69afb2b7a1c02abe9b06db5d1fa0bd820e2dd9214a","observation_id":"43fd23d2-eeae-4c92-babc-2cd190200f46","resolution":{"observed_at":"2026-08-14T11:31:21.425985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:21.431376Z","title":"Homomorphismsareagoodbasisforcounting small subgraphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.431376Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:da0f317a950799465106cc17e762546f86b45b73c3064a112bdefe3729517fda","observation_id":"0234467e-1c00-45b2-8865-c57bd1ad3502","resolution":{"observed_at":"2026-08-14T11:31:21.431376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:21.435698Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.435698Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:21582388e8791c63312b8afd98de9c8f321856f105654609f534006e119fc737","observation_id":"22b3d969-170f-4ab1-9720-6691b5772f5b","resolution":{"observed_at":"2026-08-14T11:31:21.435698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:21.439892Z","title":"Improving TSP tours using dynamic programming over tree decompositions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.439892Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:c1745c4cc8879ba98c047517a564547565f3b1d701e1058cb2c29eca6438422d","observation_id":"85b904d4-3bcc-49aa-a211-0e5a698485fd","resolution":{"observed_at":"2026-08-14T11:31:21.439892Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:21.957437Z","title":null,"venue":null,"work_id":"10a26a75-9f4e-4bc7-bf5b-4bb0c9e504a3","year":2016},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.444180Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:af5bf39809780e6ded63b0f6109134e6a24f2ca3782c4c1381218c892ce67ffa","observation_id":"134c7468-17e5-483b-aa0f-851a9414509c","resolution":{"observed_at":"2026-08-14T11:31:21.962379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.940691Z","title":"Fomin, Serge Gaspers, Saket Saurabh, and Alexey A","venue":null,"work_id":"d3be3986-96c2-45df-bc30-0aeab4d01b76","year":2009},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.448394Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:b4d3406ebfed06020fbb3116f899d06b87c040bfd536589c7406a1df54d179e6","observation_id":"63b737ef-e586-4d8d-8aee-17e1bb72241c","resolution":{"observed_at":"2026-08-14T11:31:21.946578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.452062Z","title":"Fredman, János Komlós, and Endre Szemerédi","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.452062Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:a27c0c7f9ce6c0fdc1c5ce531512bc4e2cb453530174370890b2a41821ba94e9","observation_id":"b53c3cbd-a656-41dc-acd6-f372ab21b459","resolution":{"observed_at":"2026-08-14T11:31:21.452062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-012-9685-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:21.542034Z","title":"The parameterized com- plexity of local search for TSP, more refined","venue":null,"work_id":"f12f85da-0ca5-4d89-9d56-0b3b904f9ae6","year":2013},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.455971Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:f0302f35af84376ba22284ac3a6ecbbd039045ffdf8ccffd7fefd97423becbf5","observation_id":"2a8469b1-6e54-40f0-a70b-2ca2d9f5ff98","resolution":{"observed_at":"2026-08-14T11:31:21.546629Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.926331Z","title":null,"venue":null,"work_id":"fcca622c-b9e7-41d6-8304-f715c35d33af","year":1971},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.460476Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:a457f1ad845e749e98bf1be796a97a19afc64407f39134c07eb063bb04347c88","observation_id":"88dfd98e-3acf-4a5a-af02-2b0c709fa5a7","resolution":{"observed_at":"2026-08-14T11:31:21.931023Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.911662Z","title":"An effective implementation of the Lin-Kernighan traveling salesman heuris- tic","venue":null,"work_id":"8f2c68c7-822c-48f8-9a09-9054084e9b74","year":2000},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.464298Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:215be3214ff362263595e7ea80711da81a33f3c663ed7bf93cb18e021c5d902f","observation_id":"ffb53163-a525-4e44-9398-91109f396904","resolution":{"observed_at":"2026-08-14T11:31:21.916746Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.899563Z","title":"Generalk-opt submoves for the Lin-Kernighan TSP heuristic.Math","venue":null,"work_id":"e5d21493-0dcc-42d7-b979-3934a1b20114","year":2009},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.468000Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:bc1d835c36956575689016572704369a75c970f4a4867e102cf7c7423575d5c3","observation_id":"98ee8024-d2b7-4825-a775-735b9772108e","resolution":{"observed_at":"2026-08-14T11:31:21.903662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.885902Z","title":null,"venue":null,"work_id":"7150e907-4f69-4881-bab6-8a442d5d72d9","year":2002},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.471908Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:59fa6289b827ea2f3c006f5b05c16a97eb71b819f86d70013eefc4d095a1753a","observation_id":"5b463ae2-4413-4afb-8ce7-feda9ed2160d","resolution":{"observed_at":"2026-08-14T11:31:21.890826Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.872936Z","title":"Johnson and L.A McGeoch","venue":null,"work_id":"69e1e38f-bc69-4e66-9525-c8d20bf26ace","year":1997},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.475414Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:faeb02d77545577352215eb44cfc09241658f737716050e03b4aecf1c6d225e7","observation_id":"9a243134-ac70-4f23-a13c-a6430da9c460","resolution":{"observed_at":"2026-08-14T11:31:21.876819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.478879Z","title":"Lin and Brian W","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.478879Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:78ab8508276ee96b57c62b3eb913fe186eafdd7e37fdc2d2ac264f64bac151bd","observation_id":"32433758-e3dc-48e7-b81c-23c6bf60c88b","resolution":{"observed_at":"2026-08-14T11:31:21.478879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.orl.2007.02.008","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:21.520007Z","title":"Searching the k-change neighborhood for TSP is W[1]-hard.Oper","venue":null,"work_id":"4ff7e8bf-a9f2-435f-ba2a-02dd5fa7ddc2","year":2008},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.482751Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:6b37b2f15908a5a90c1597cec999177cd585c8681cd33d6a1b72dbfb83898026","observation_id":"dc7f13a9-e953-47d9-8f9d-02e17a0b9b9c","resolution":{"observed_at":"2026-08-14T11:31:21.526282Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.860967Z","title":"Can you beat treewidth? Theory of Computing, 6(1):85–112, 2010.doi:10","venue":null,"work_id":"7a0410a0-6287-424d-9fab-5468cfa08fbc","year":2010},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.486338Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:3f81970e0be67e4d5c34fdf196ff950dfc609f4901f4608b87bd4292a484a36e","observation_id":"53a4845e-81c4-42d3-a651-23df8011c164","resolution":{"observed_at":"2026-08-14T11:31:21.865189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:21.844329Z","title":"Enumerating connection patterns","venue":null,"work_id":"41202923-17b5-4996-afbe-33c0654400d9","year":1985},"citing_paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:21.489995Z"},"links":{"citing_paper":"/paper/1908.09325"},"observation_digest":"sha256:dc061103e6fabf406a80b1f156c92d30d4475d687861349d8ab4eb282d3bae2b","observation_id":"5f569024-007d-4798-ae7d-942c2b3bfdbf","resolution":{"observed_at":"2026-08-14T11:31:21.848935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09325","last_updated":"2019-09-03T07:01:59Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T15:51:06.046735Z","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":5},"total_outbound_references":18},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:1908.09325."}