{"as_of":"2026-08-13T01:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04a1e50e051009496ca58308f8a5346e6009acad69bd5c69fda56f3ae8eead88","coverage":[{"denominator":73,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":73,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:08:45.058322Z","state":"measured"},{"denominator":73,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":73,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.14745/citation-record","integrity":"/paper/2411.14745/integrity","json":"/paper/2411.14745/citation-record.json","paper":"/paper/2411.14745"},"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-12T15:08:49.175073Z","title":"Applegate, Robert E","venue":null,"work_id":"23efc669-f118-4243-a2ba-cc10b2a5a77b","year":2003},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.230282Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:f50b4e453cf89d63e74a94f78dee1789cdd048b206071728f6cdec7c179a78d3","observation_id":"8dcecc53-8fbf-42ef-8323-b63debe78c90","resolution":{"observed_at":"2026-08-12T15:08:49.179156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:49.049691Z","title":"Applegate, Robert E","venue":null,"work_id":"60939366-96c6-47c2-89aa-7907d22913d1","year":2006},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.310671Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:199ab0005a81459883fb9f8dbd436dcdec8a4a6ba07cc7f6f71bd551cdc0b838","observation_id":"ce65b63a-9e06-4d64-91df-d0f735247999","resolution":{"observed_at":"2026-08-12T15:08:49.116448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.993495Z","title":"Beating approximation factor two for weighted tree augmentation with bounded costs","venue":null,"work_id":"31d4733c-65cd-42c3-a856-fbc5fdbe2c86","year":2018},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.315141Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:f1e6231de080a2cbb609e8d23e427296da3e3bc38c234a2b1c31fbcc5d3d901d","observation_id":"a9af2a88-2ed0-4b33-8a2f-804ea843af4a","resolution":{"observed_at":"2026-08-12T15:08:48.999450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.979978Z","title":"The multiplicative weights update method: a meta-algorithm and applications","venue":null,"work_id":"0a6b92c8-1bb7-479e-be3e-f4a7abafaa4b","year":2012},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.320973Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:5a4e12def347f583cb8e1828f69174210c4e316c91b05567bc6adb95e3ae8d30","observation_id":"aa939562-08bf-49e8-a760-18c6314c5f8f","resolution":{"observed_at":"2026-08-12T15:08:48.984274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.924175Z","title":"Stateless distributed gradient descent for positive linear programs","venue":null,"work_id":"0a9bdf6a-f0a6-417a-b77a-f6c13fe90673","year":2008},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.325602Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:119df0078dc3af7910540158cdd58eb0adb5339971557af48df7e5e9ba7e64f7","observation_id":"535719b7-1def-43a1-82f7-cc77ce0529c3","resolution":{"observed_at":"2026-08-12T15:08:48.969089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.832203Z","title":"Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems","venue":null,"work_id":"43505b53-44ab-4d19-9aa5-8708474fdfa2","year":1998},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.331136Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:d741ccac8c5fdb0dfaff8ab81efe31d2912f7f600c3ca56067a5225402b0785b","observation_id":"6566c07b-daaf-4820-ac38-b43d6f00b682","resolution":{"observed_at":"2026-08-12T15:08:48.837787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.814588Z","title":"Atallah and Uzi Vishkin","venue":null,"work_id":"fc2453dd-4487-4222-a401-ac4df9387825","year":1984},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.336471Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:33e4b9dd8cbc682abde1f85b1bc225e0cdec11c1e1c34af339161e3e5ed7a4ea","observation_id":"e8972225-78a1-4809-8127-45c5064df840","resolution":{"observed_at":"2026-08-12T15:08:48.820824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.795220Z","title":"Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel","venue":null,"work_id":"66a7349c-8c44-4864-b41b-0707e4cc78c6","year":null},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.341965Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:fde949a0df9be5254bc62abe726857477fbc8fe55ed1e380ae50f1a3eae864ab","observation_id":"38246805-31a4-4f56-aa63-50f30c264aea","resolution":{"observed_at":"2026-08-12T15:08:48.802010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.612710Z","title":"Nearly-linear time positive lp solver with faster convergence rate","venue":null,"work_id":"01f7a3d3-d066-498e-8567-dccd61032811","year":2015},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.347383Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:c24937aaa71302022856873e57a22c08f04317a093e71502df879fe77bf59214","observation_id":"c081ff35-af96-42c9-8503-bebacb05beb8","resolution":{"observed_at":"2026-08-12T15:08:48.698665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.597724Z","title":"Byers, and Danny Raz","venue":null,"work_id":"3c55b586-3a36-461e-91bc-e0e591ca83b1","year":1997},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.421098Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:296dad52a677b927e67fdd32c9da34d7a07f5c3121c4f6fa00afaeafc45c5608","observation_id":"e99e21a4-f26b-44db-8371-0871c46919df","resolution":{"observed_at":"2026-08-12T15:08:48.602464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.475191Z","title":"Byers, and Danny Raz","venue":null,"work_id":"bc4e8260-c9d2-4294-b7bf-a0785981d418","year":2005},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.499454Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:8fa1be57d8b86c9a76fcbbe83ea89703ce76e5af9e5d022cc41b3138e6e0dfc7","observation_id":"5b638970-468b-4d7d-89ba-14243c3e6119","resolution":{"observed_at":"2026-08-12T15:08:48.531815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.458566Z","title":"Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs","venue":null,"work_id":"8849940a-2c5b-41b6-9358-2d966702ed81","year":2014},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.504661Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:9d9d6217845ba1ce7cd1928347eb6b3bc9621dcaeb04a1f1248a5b7adbb92dfe","observation_id":"d2d5d906-262b-4e3f-bf0c-6f6d4151285f","resolution":{"observed_at":"2026-08-12T15:08:48.464415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.404178Z","title":"Minimum weight 2-edge-connected spanning subgraphs in planar graphs","venue":null,"work_id":"2b1bc56a-3470-4df1-a367-ed470cdede3c","year":2007},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.509075Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:7e61da5ab4f7add792732f43384ccc574f5c3258f561b0f52face27c68e610a3","observation_id":"bfd509c4-c36e-4f6b-917a-476c191e830c","resolution":{"observed_at":"2026-08-12T15:08:48.447792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.328090Z","title":"Blelloch","venue":null,"work_id":"47c88772-696c-400f-9d17-ce07fefdc17d","year":1996},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.596371Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:31da6735af666184b4a4eafd736506fba046327f4cf8778c844af6aa1b1e0bd6","observation_id":"21df0db4-43e9-4926-b8d5-4aff6393a332","resolution":{"observed_at":"2026-08-12T15:08:48.333986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.291004Z","title":"A simple algorithm for minimum cuts in near-linear time","venue":null,"work_id":"a108d0c6-f523-4283-83ce-702436ee4cf2","year":2020},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.601263Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:c30228488362ac00a8b04be4ea2f650d18b152f36a1513346cc558ca9d550d90","observation_id":"f47f549d-2819-4d16-aecb-3783faf1f1af","resolution":{"observed_at":"2026-08-12T15:08:48.315460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.200994Z","title":"Survivable network design for group connectivity in low-treewidth graphs","venue":null,"work_id":"8eb47f6a-2332-495b-a326-4840d1f8c211","year":2018},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.606817Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:5d3f6bc75e310b48f50e168c2be5028b8b7b7e17d8314afa3ddb7c2b35801dc2","observation_id":"38227f7c-2bc2-471a-9003-686732739e60","resolution":{"observed_at":"2026-08-12T15:08:48.206511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.185302Z","title":"Carr, Lisa Fleischer, Vitus J","venue":null,"work_id":"a3b6c8ea-0e7b-4a40-bbf3-aefdaa9c5528","year":2000},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.612362Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:fb5db3aba3adf06c837399a93c6300706d9706304e097235bd1cd1309898c305","observation_id":"fde8a394-b509-4e71-8523-991939f9c76f","resolution":{"observed_at":"2026-08-12T15:08:48.190355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.085834Z","title":"Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs","venue":null,"work_id":"1052dead-6e16-4be6-b7d1-100138c8c4eb","year":2004},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.617562Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:5e45de9962cff238e1d36c4890cb378db7ce1929e6e17efadbd72bed54fd1f95","observation_id":"77fed510-49b3-4165-9536-9a088b0b6f9b","resolution":{"observed_at":"2026-08-12T15:08:48.174474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:48.071075Z","title":"Approximating k-edge-connected spanning subgraphs via a near-linear time LP solver","venue":null,"work_id":"822b8364-bf93-4e5e-9db8-cfd76260cb7f","year":2022},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.720539Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:b4b68aac13bb4c84a859d5e251030ec113e63d44f2b5ef51e6bb2c71b3cb0c7c","observation_id":"039a3900-2598-41ed-bb62-efa46eee9afe","resolution":{"observed_at":"2026-08-12T15:08:48.075544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.951204Z","title":"Worst-case analysis of a new heuristic for the traveling salesman","venue":null,"work_id":"28aec75f-f891-4f7b-876b-c3f90b597518","year":1976},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.822019Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:6b76109ba0c28057aee656e77161bc2d7203778daeef9cf416bfc2e4dbf29e3b","observation_id":"e5a9cd2b-e410-41c3-963a-6e568487ee8e","resolution":{"observed_at":"2026-08-12T15:08:47.961133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.934976Z","title":"Approximability of dense and sparse instances of minimum 2-connectivity, tsp and path problems","venue":null,"work_id":"4edec8ab-46b0-4f0f-9dd1-4153ce526c2e","year":2002},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.826674Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:1d4d8a04e14ad12d9b2ef31cbdc16f5b15a9475d8a8141998a05320b98d28e9b","observation_id":"225250e7-4472-487d-bf9a-e9a6467693e5","resolution":{"observed_at":"2026-08-12T15:08:47.940966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.818064Z","title":"On approximability of the minimum-cost k-connected spanning subgraph problem","venue":null,"work_id":"c1b6f606-2624-4512-9a11-204539d7852a","year":1999},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.830744Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:6c27cc3140f79cd2aed544dfaf4ce4a04ef859c0a7d75edc52000ea4f952b87d","observation_id":"aab1057d-8b10-4705-87b7-fc2c602c7108","resolution":{"observed_at":"2026-08-12T15:08:47.922898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.802356Z","title":"Fast approximation schemes for euclidean multi-connectivity problems","venue":null,"work_id":"29ffc138-16b5-432a-bff8-e6961c9cc95e","year":2000},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.835629Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:94d7ab66f998f977616f6efb0a31d59bc312f29f2687c2deccf9f2e001463868","observation_id":"c436f361-556e-4f12-b474-146fc64bbcda","resolution":{"observed_at":"2026-08-12T15:08:47.807578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.764473Z","title":"Carr and Giuseppe Lancia","venue":null,"work_id":"15baff24-ec16-42cf-9196-e06921eb8b5c","year":2002},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.840319Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:167f446b3466f8466c13065be7902c3fd6d28af953a7a388d86dba5a5cbf49c6","observation_id":"8a1ca8e6-fe28-4535-a11b-64f20a185396","resolution":{"observed_at":"2026-08-12T15:08:47.791699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.657994Z","title":null,"venue":null,"work_id":"375bbb26-bbe1-4725-b392-15045bb060b4","year":2012},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.845315Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:f10477f51a2eafff5e7ebd06ba9e64e1fe150320e3447e24c96352a5ef2f194f","observation_id":"4c0acbff-718c-438d-86f1-0cc8fae58343","resolution":{"observed_at":"2026-08-12T15:08:47.718410Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.642599Z","title":"Approximating the H eld- K arp bound for metric TSP in nearly-linear time","venue":null,"work_id":"a3f0cc3f-ddce-4836-846c-3cd831d63cfa","year":2017},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.849656Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:70b0fd3225616bab42bb037034615dfd4e1ac5a35fa09c6e616c4fe490128996","observation_id":"74186e5b-571d-4075-b5c8-64edad099f41","resolution":{"observed_at":"2026-08-12T15:08:47.648388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.01242","last_updated":"2018-02-05T02:48:36Z","snapshot_observed_at":"2026-07-06T06:21:42.681163Z","submitted_at":"2018-02-05T02:48:36Z","title":"Fast Approximations for Metric-TSP via Linear Programming","version":1},"cited_work":{"arxiv_id":"1802.01242","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.01242","snapshot_observed_at":"2026-08-12T15:08:45.168853Z","title":"Fast Approximations for Metric-TSP via Linear Programming","venue":"cs.DS","work_id":"a4a26d0a-65d9-41da-a458-63405c1e94f1","year":2018},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.854090Z"},"links":{"cited_paper":"/paper/1802.01242","citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:40ca06d0577c2b1ef868ad5b2a2bc0c5606f1396ba3ebe2b61bffcb776147d7f","observation_id":"792a9b17-d375-4239-9bfc-f59f1b4a5f4b","resolution":{"observed_at":"2026-08-12T15:08:45.174800Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.460527Z","title":"Dantzig, D","venue":null,"work_id":"74b2d542-9ac0-4fd1-92ef-18965baad885","year":1954},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:43.915547Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:669ca9d6b67e9286b024fe5c0d44eb450ad0354d899914fa501d438f2cf060f5","observation_id":"5c83f783-43f5-4387-8e0f-71287dfccbd4","resolution":{"observed_at":"2026-08-12T15:08:47.530853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.445933Z","title":"A better approximation ratio for the minimum sizek-edge-connected spanning subgraph problem","venue":null,"work_id":"1ad504b1-89ec-4510-8109-a6f463b735f7","year":1998},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.007123Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:0ea3bf4512ded4b58e9951ebae28c7cbb2b072f4020200d031c3becc36c97f8f","observation_id":"72556bb4-1fda-437b-8486-8fb4aa140c3b","resolution":{"observed_at":"2026-08-12T15:08:47.450865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.393958Z","title":"Approximating weighted tree augmentation via chv \\'a tal-gomory cuts","venue":null,"work_id":"977cbc9b-a48c-49ef-8217-7ac17f091bcc","year":2018},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.016667Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:6003b5045a1f85a8a28a4e075a594c1ed2f3d57647665f6a8d260f1a8640e68d","observation_id":"e4911ca9-0a8d-4d5b-b39f-f2ca7e2e8ffc","resolution":{"observed_at":"2026-08-12T15:08:47.434358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.269796Z","title":"Davenport-schinzel theory of matrices","venue":null,"work_id":"4caf5922-3097-44da-97bd-5762215fd02f","year":1992},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.022266Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:95d4a759753f6fec13ec244d153990c617b03c38bf2618e9d9141a70182d7f71","observation_id":"6031cffe-5b4d-4ad3-a15f-0316f99e22ba","resolution":{"observed_at":"2026-08-12T15:08:47.275661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.255092Z","title":"Frederickson and Joseph J \\' a J \\' a","venue":null,"work_id":"1cd445c8-8dbb-4147-ba31-ce26424e65b8","year":1981},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.026865Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:4863547729703d7b59c0d18038ac34306405b8740c06fb4c6fa37d42bbc1c417","observation_id":"7af28d23-ceab-4583-8b41-da9ec01f43b6","resolution":{"observed_at":"2026-08-12T15:08:47.259544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.151066Z","title":"Frederickson and Joseph F","venue":null,"work_id":"f696b1c4-89d4-40a2-b3b9-4029d905e477","year":1982},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.031605Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:b420586da45bc110d6bcc190b3c199007888dec82d7440a4dc914251ecc96177","observation_id":"e348c1f2-3759-4f3f-a4f9-2bbc4a5f845f","resolution":{"observed_at":"2026-08-12T15:08:47.210290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.135715Z","title":"Approximating fractional multicommodity flow independent of the number of commodities","venue":null,"work_id":"4d0944f4-4477-4478-9593-46924e6653d5","year":2000},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.036028Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:3755a8c33e1cc621b5363af210c285e97829708211f03bd844bae082ef2c9eea","observation_id":"6679a3f4-bef8-4a36-b1ac-28d725487a74","resolution":{"observed_at":"2026-08-12T15:08:47.141592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.120945Z","title":"Goemans and Dimitris Bertsimas","venue":null,"work_id":"e5b5aa3e-0c67-4363-9098-77aaffacdd1b","year":1993},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.041604Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:4c68934464e89a02938e62c082166f94e0380391a186aac1292ea31b0572afce","observation_id":"314aefce-7d95-4196-9bf5-473a5f220f02","resolution":{"observed_at":"2026-08-12T15:08:47.125856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.048479Z","title":"Parallel minimum cuts in near-linear work and low depth","venue":null,"work_id":"860addc9-f3f2-4053-8f5a-ba78af7ea622","year":2018},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.046309Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:b69b1ed74a5af382aadd4c92f2155c6b394388b1baf4859c1715fd6d35a63e18","observation_id":"a827a0cb-37f7-492c-9e55-22bd5d9f6202","resolution":{"observed_at":"2026-08-12T15:08:47.052708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:47.033724Z","title":"Approximating the smallest k-edge connected spanning subgraph by lp-rounding","venue":null,"work_id":"e5974d56-7fd7-48b5-870a-4445c33bcac2","year":2009},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.092548Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:d4e402520b9b2dcab68dc8088927685c48f1aada321f62bbaa975bef88eeaf88","observation_id":"7f276d6f-b67b-4fb7-a7ce-f90c7518ac88","resolution":{"observed_at":"2026-08-12T15:08:47.038999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.944945Z","title":"Faster and simpler algorithms for multicommodity flow and other fractional packing problems","venue":null,"work_id":"148adf49-9535-4fb0-ae4f-9d8ce697459f","year":2007},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.139841Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:0d8b2e8e99c4e0f79833fa4410049b023d8e5c2adee30a2d02a7c682be1c2816","observation_id":"d7827dee-4bbd-419e-8f74-02422392107c","resolution":{"observed_at":"2026-08-12T15:08:47.023120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.930729Z","title":"From trees to polynomials and back again: New capacity bounds with applications to TSP","venue":null,"work_id":"d627e3fa-6a33-4148-905b-46f8352b38bf","year":2024},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.182203Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:cb88a15cd567583173a2bf4eaee025dc8f2d09b34bc9e75098b0c10c7ccc6c19","observation_id":"29cb2017-9f72-4206-97ca-28340407db9a","resolution":{"observed_at":"2026-08-12T15:08:46.935204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.871640Z","title":"Improved approximation for tree augmentation: saving by rewiring","venue":null,"work_id":"ee4df9dc-411d-4d5e-afa6-d8fa3d075348","year":2018},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.186194Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:432f7fb414414dc088741bf97c705f9bfe9fb82db243d57a44d120290f5db1bc","observation_id":"0f3c8c6b-9479-4dbb-84f4-bfb163d331ad","resolution":{"observed_at":"2026-08-12T15:08:46.920315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.772958Z","title":"A note on a recent algorithm for minimum cut","venue":null,"work_id":"988495e3-9591-45e0-9304-1e88faf798ee","year":2021},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.191554Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:0ccaf65045fb780e82690f8d08cb0eb8985d154aa0ddfdb8618f788d5ac7ee62","observation_id":"9ba02888-eb91-4029-89a8-5e7dbbe7ac2d","resolution":{"observed_at":"2026-08-12T15:08:46.779262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.639444Z","title":null,"venue":null,"work_id":"a25f5abc-eadf-4d22-a49e-2e9841ad4049","year":1995},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.196294Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:54928438d74fc4b7f527e6c54e5d16c31ddeed1194999090432d96f32e4be1f2","observation_id":"ce31a20c-7da8-41eb-91aa-8ab70eea8066","resolution":{"observed_at":"2026-08-12T15:08:46.709724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.622743Z","title":null,"venue":null,"work_id":"0b88043f-f5ff-4889-ab23-41ca248e30d4","year":2007},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.202393Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:d5c8e124dacb9b5ee1287eec4229f8c88cbc9dd47c2645aaa77d91dece2f290a","observation_id":"9a3056fe-058a-468e-a412-ea10692f2af0","resolution":{"observed_at":"2026-08-12T15:08:46.628269Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.544382Z","title":null,"venue":null,"work_id":"4d8b6e74-ea39-4ff0-8a15-0b8a31b358e1","year":1970},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.208524Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:d4c67016266bd7db41a40a351b6e057b9b22da65a9617a7db33cbd02ff9ac9c7","observation_id":"9d7278ce-573c-41e4-9ea2-7518bb17fd0b","resolution":{"observed_at":"2026-08-12T15:08:46.549131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.527898Z","title":"Ellis Hershkowitz, Nathan Klein, and Rico Zenklusen","venue":null,"work_id":"075c9a2c-f449-45fd-8c40-2f91efa75081","year":2024},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.213336Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:f9040a1610fc4b0d42245f2f7080a13486881957a7a30a5a4765e5201d5cd540","observation_id":"e14e1e07-2188-4f2e-93ff-91a05c1b341f","resolution":{"observed_at":"2026-08-12T15:08:46.533293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.388181Z","title":"Deterministic near-linear time minimum cut in weighted graphs","venue":null,"work_id":"628976f0-e099-4728-92cd-1bb799941815","year":2024},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.218225Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:183f81963985803e41f3d1ace265f7285025a14551de4a112b061f3d7219ec04","observation_id":"825ec26f-b63f-43ad-8aba-a0e5919feca7","resolution":{"observed_at":"2026-08-12T15:08:46.483161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.373657Z","title":"Williamson","venue":null,"work_id":"0440426c-9abb-4812-98e7-b387631066be","year":1996},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.312014Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:d1a45b89c22fa76a729bfdd510bcb6ae0a38b06bdb7a83a32a0a08cc95cc37e2","observation_id":"d7ffd659-1ed0-4387-a10a-0e81d001e39d","resolution":{"observed_at":"2026-08-12T15:08:46.378514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:44.379880Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.379880Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:909cf11b6f9976ea0de4622fc968d9165e1c3b93cb97301c9308a9354b76f3b1","observation_id":"35fa05fc-b338-4017-b038-44bd89a1d432","resolution":{"observed_at":"2026-08-12T15:08:44.379880Z","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-12T15:08:46.311717Z","title":"Lagrangian relaxation based algorithms for convex programming problems","venue":null,"work_id":"62f93e37-1e52-4588-b0ae-56fb83733e24","year":2004},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.385122Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:5170c03743b1011ba1a639223126080ca85e22d40f0a6a86131a8912ede2a602","observation_id":"27f10c6a-9136-4302-95e3-dfb1486746af","resolution":{"observed_at":"2026-08-12T15:08:46.353348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.281615Z","title":"Karlin, Nathan Klein, Shayan Oveis Gharan, and Xinzhi Zhang","venue":null,"work_id":"e1fcf1d1-9e80-457f-abdf-8272675940c3","year":2022},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.389635Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:55ce7bba7d617a2cc107c18de5927c228a92f8fdff9d25a9d45202c9478a8925","observation_id":"ad8c95bc-15c6-4dca-8548-4d502892d392","resolution":{"observed_at":"2026-08-12T15:08:46.286351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.266896Z","title":"Karlin, Nathan Klein, and Shayan Oveis Gharan","venue":null,"work_id":"fb66ecdb-3db6-4796-9e5a-e5dd231c1ce9","year":2021},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.394735Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:1298b8109edb2dd2a9199ff64ba1fb46625c68837bac1466fe58ed71bb2fb07e","observation_id":"f9838851-0163-4fbe-9c9d-82504a8e5d5f","resolution":{"observed_at":"2026-08-12T15:08:46.272277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.207556Z","title":"Karlin, Nathan Klein, and Shayan Oveis Gharan","venue":null,"work_id":"9662dff5-a5bb-4245-8033-ef5bd4cabd77","year":2022},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.399124Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:c855a7a92b9c7839d6d7557c2a57562a997404447d363f841d64832c85478b40","observation_id":"85a37226-7f2a-4445-b5db-48a545313d56","resolution":{"observed_at":"2026-08-12T15:08:46.212411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.192737Z","title":"Biconnectivity approximations and graph carvings","venue":null,"work_id":"1086ee58-ed10-421c-b7a7-678aaed08301","year":1994},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.402772Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:b18d1de1da6141f02adda4144af722aa3b64682c28a58ebf1f00b0553fde9753","observation_id":"14afd8e3-9489-4717-8002-7fd9faedd336","resolution":{"observed_at":"2026-08-12T15:08:46.197763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.158809Z","title":"Improved inapproximability for TSP","venue":null,"work_id":"b117307d-2e6d-4957-8461-6116ebd606e7","year":2014},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.406862Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:199dafa7cec3586cad93abfe9bb52e49a2e6966150bf077291f797765d7965c6","observation_id":"84f0cc49-d04f-48b7-8aa9-51d7e9e87b10","resolution":{"observed_at":"2026-08-12T15:08:46.182591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.110748Z","title":"A rounding by sampling approach to the minimum size k-arc connected subgraph problem","venue":null,"work_id":"16d80503-cb07-4c2e-8810-1878b24b3782","year":2012},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.411000Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:be6ead9ae860ae8e9cea8726dcb3c9ed888f5085936738a0888294225ecc2303","observation_id":"1ced05c9-dfb2-41b3-8c2d-84b870738f93","resolution":{"observed_at":"2026-08-12T15:08:46.117365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.094963Z","title":null,"venue":null,"work_id":"edb76cec-bedf-4d5b-8349-6133c7275665","year":1991},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.558815Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:bce7bc82b57494b0d1f6d49af64594a19918aad72b05531626af3a55d5522889","observation_id":"ee75f117-87c6-433f-8115-9a808a912a30","resolution":{"observed_at":"2026-08-12T15:08:46.099712Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:46.013254Z","title":"Work-optimal parallel minimum cuts for non-sparse graphs","venue":null,"work_id":"06ffa0f7-323e-4f85-b64b-201b0b0b330e","year":2021},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.707143Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:6c6e754ec56cb6d70af716a681c51e4c61a8c45052c10daf828e2aa4434044ce","observation_id":"1440bbd7-f0c5-42e1-ab79-b5995cd26954","resolution":{"observed_at":"2026-08-12T15:08:46.083311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.998565Z","title":"A parallel approximation algorithm for positive linear programming","venue":null,"work_id":"f33e46bc-65b4-4aea-81b2-762f6a12d0f9","year":1993},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.713248Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:e2d2c6f0ae9a171932d8cbac0326f77405b56255779e32b4111639cf5c6488a1","observation_id":"01bb4fcc-3d3c-4265-81f9-c6c2d21dbca7","resolution":{"observed_at":"2026-08-12T15:08:46.003439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.899749Z","title":null,"venue":null,"work_id":"8f92242a-0285-4f87-9fe9-b14c61132bd8","year":1999},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.718791Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:875e4af864e897bdaef10c8e5f86217fa98af4cf7e3c38d8902582e3bc70c306","observation_id":"d35a1e82-b3b5-44d9-84ed-6dc769419f3e","resolution":{"observed_at":"2026-08-12T15:08:45.987387Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.883269Z","title":"Monma, Beth Spellman Munson, and William R","venue":null,"work_id":"7e519aef-e1f5-4bea-9951-8c9a5d334310","year":1990},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.723697Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:20911639e1ff2e48aaeff491c5cc3a5e2c603007cf202948cdfed3c3c33440db","observation_id":"aaf4bc28-f100-421d-b595-d6464dba1d6c","resolution":{"observed_at":"2026-08-12T15:08:45.889092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.821954Z","title":"Weighted min-cut: sequential, cut-query, and streaming algorithms","venue":null,"work_id":"776a125b-9899-4c2c-9dc4-54b4eb4164e9","year":2020},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.871798Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:718073078e5e2ffd6da1bcd1729d42976dc8c8354315788c0c6591662394d973","observation_id":"78bf664c-e5a6-4307-879d-23c760ec9874","resolution":{"observed_at":"2026-08-12T15:08:45.872352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.666914Z","title":"Mahoney, Satish Rao, Di Wang, and Peng Zhang","venue":null,"work_id":"6352ccdc-9bd5-42c0-9a30-096fdd1ddcbe","year":2016},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.877650Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:dbabc3964c9bf3e1777bef88a07ba97f05899ed4d85095c8ce9e572eefcb482e","observation_id":"9dd7b318-518e-4172-9fd0-40d7dc3878c7","resolution":{"observed_at":"2026-08-12T15:08:45.672217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.652359Z","title":"Nesterov","venue":null,"work_id":"29e2568d-eaa4-48d8-a2e4-c264f34615a5","year":2005},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.882754Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:f5628dfa38a1c977399e4ea7b70bda644475ca558bb85d44c3647cf95a2e7c62","observation_id":"8512d780-4bf1-4671-85ea-b1eedd158274","resolution":{"observed_at":"2026-08-12T15:08:45.657212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.547048Z","title":"Polyhedral structure of submodular and posi-modular systems","venue":null,"work_id":"7c3ec3ad-7797-499e-bc71-9e74f5525160","year":2000},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.887742Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:9d5ca97d3aa423427085402726e6a3b26464cae2a308c292e780fd28bec4c859","observation_id":"7bf3fc4a-92f4-41c9-8bf0-45875d04f2b7","resolution":{"observed_at":"2026-08-12T15:08:45.640741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:44.891694Z","title":null,"venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.891694Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:2cbaa47efd199c36ebb4add16db7336c2fd40105b94744eb4e4fbe89fbd436ca","observation_id":"033a9aa5-3eca-4b10-b84a-f4cf8e9c5227","resolution":{"observed_at":"2026-08-12T15:08:44.891694Z","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-12T15:08:45.518687Z","title":"k-edge-connectivity: Approximation and LP relaxation","venue":null,"work_id":"d55186b1-f657-411f-b85b-eb5392b79bdc","year":2010},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.896858Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:38703bf2ffe286e3cfb22d0424aebce20a34e4377404fd08bdcdc11a95f7cab1","observation_id":"1c80e390-811d-4584-b4a9-560675d3f477","resolution":{"observed_at":"2026-08-12T15:08:45.524196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.432867Z","title":"Plotkin, David B","venue":null,"work_id":"79d0305a-94c7-4ad7-a1c9-003adf6ccfb9","year":1995},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:44.975779Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:2439b81fcf43efd5bba3bdd3bebd2529c5215936041622387e04899a1ab555a4","observation_id":"4af0b868-327b-4086-ad2f-0ecbf93c7b98","resolution":{"observed_at":"2026-08-12T15:08:45.506977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.413581Z","title":null,"venue":null,"work_id":"b14d87c8-27aa-4140-a025-883352d7c076","year":1978},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:45.031516Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:36df21972274d82f899184368b4dfdb4ceee6fdce1d67ebab66b5ec0ba884567","observation_id":"53b4f613-4c8c-49db-9dda-7b85ddfa60d2","resolution":{"observed_at":"2026-08-12T15:08:45.419189Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.291409Z","title":"An o(n \\( ^2 \\) log n) parallel MAX-FLOW algorithm","venue":null,"work_id":"c96ca7d2-b12a-4da3-8a4a-323b00838efe","year":1982},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:45.036800Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:35653ee9950d457b432ef9a417706b4ad09aa6d50d44db9891d8a1d8df3034eb","observation_id":"6bdab757-df7d-436d-908b-0145c33556b0","resolution":{"observed_at":"2026-08-12T15:08:45.379936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.274503Z","title":"Shmoys and David P","venue":null,"work_id":"28d34039-abc8-4011-99d1-924a5690f071","year":1990},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:45.042161Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:08a91c15859673bcf92e957d96f57acec6aff4d1f46bc187b0dfa1bdb1b05db6","observation_id":"53c4b68c-8ab1-4a63-ae38-fe157d54987c","resolution":{"observed_at":"2026-08-12T15:08:45.279259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.260931Z","title":null,"venue":null,"work_id":"97ae71dc-f8d1-4e16-98aa-d6ad3e7aa547","year":1980},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:45.047100Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:80d84f43dadd6ecb6aa843d0016df34f8169b57d75c8857c21fe2652d41dfe28","observation_id":"26dd63ed-1a86-43ef-8059-1339de70da2f","resolution":{"observed_at":"2026-08-12T15:08:45.265021Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T15:08:45.185643Z","title":null,"venue":null,"work_id":"b3c1d704-43f6-46e7-953b-d202c591d728","year":2001},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:45.053932Z"},"links":{"citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:27c739f87216f5ac4824ad91ef1768ed565b753b7b16707a206b39e93837fc56","observation_id":"ecc7ddd3-ebd6-4cfb-839d-d36421724cf8","resolution":{"observed_at":"2026-08-12T15:08:45.242480Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.3015","last_updated":"2014-11-05T06:39:30Z","snapshot_observed_at":"2026-07-06T03:48:44.391683Z","submitted_at":"2014-07-11T03:17:57Z","title":"Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs","version":3},"cited_work":{"arxiv_id":"1407.3015","doi":null,"metadata_source":"pith","pith_arxiv_id":"1407.3015","snapshot_observed_at":"2026-08-12T15:08:45.095203Z","title":"Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs","venue":"cs.DS","work_id":"aa08e444-6d5b-4ac5-a605-4add68187957","year":2014},"citing_paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-12T15:08:45.058322Z"},"links":{"cited_paper":"/paper/1407.3015","citing_paper":"/paper/2411.14745"},"observation_digest":"sha256:beacb706af56d1cb5aec9a7990176f64f19fce8c667c376f68f672d7b668a4ad","observation_id":"e095076e-c8d7-4746-9454-30e97075095c","resolution":{"observed_at":"2026-08-12T15:08:45.151752Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14745","last_updated":"2025-06-23T09:29:54Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T14:54:47.969728Z","submitted_at":"2024-11-22T05:46:06Z","title":"Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth"},"reference_resolution":{"displayed":73,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":60},"total_outbound_references":73},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 0 inbound Pith citation observations for arXiv:2411.14745."}