{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UAHBRO5QVBWIMNYN6VCJOMFUK6","short_pith_number":"pith:UAHBRO5Q","schema_version":"1.0","canonical_sha256":"a00e18bbb0a86c86370df5449730b4578847fe1e5cc4901d000b666e08371252","source":{"kind":"arxiv","id":"1404.2396","version":2},"attestation_state":"computed","paper":{"title":"Approximating the Regular Graphic TSP in near linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashish Chiplunkar, Sundar Vishwanathan","submitted_at":"2014-04-09T08:48:51Z","abstract_excerpt":"We present a randomized approximation algorithm for computing traveling salesperson tours in undirected regular graphs. Given an $n$-vertex, $k$-regular graph, the algorithm computes a tour of length at most $\\left(1+\\frac{7}{\\ln k-O(1)}\\right)n$, with high probability, in $O(nk \\log k)$ time. This improves upon a recent result by Vishnoi (\\cite{Vishnoi12}, FOCS 2012) for the same problem, in terms of both approximation factor, and running time. The key ingredient of our algorithm is a technique that uses edge-coloring algorithms to sample a cycle cover with $O(n/\\log k)$ cycles with high prob"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1404.2396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-09T08:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"7802bc8bc79ec942c9f5e5fc736fd5144083a2ce77ea017976cb5ec90822726e","abstract_canon_sha256":"71fc56c396d0cb0371c0c49ebd69ecab2fc31e4420b8b1ff56cc3ee3c76553d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:46.898448Z","signature_b64":"7teY5nY5q2IP74INxXr/pmk1sSSiwtHQkOBaoor+m4JUZ/nLzYWndY6QFF1jHW3tR9FWKdF7L3o+AFcCrxqPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a00e18bbb0a86c86370df5449730b4578847fe1e5cc4901d000b666e08371252","last_reissued_at":"2026-05-18T02:49:46.898057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:46.898057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Regular Graphic TSP in near linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashish Chiplunkar, Sundar Vishwanathan","submitted_at":"2014-04-09T08:48:51Z","abstract_excerpt":"We present a randomized approximation algorithm for computing traveling salesperson tours in undirected regular graphs. Given an $n$-vertex, $k$-regular graph, the algorithm computes a tour of length at most $\\left(1+\\frac{7}{\\ln k-O(1)}\\right)n$, with high probability, in $O(nk \\log k)$ time. This improves upon a recent result by Vishnoi (\\cite{Vishnoi12}, FOCS 2012) for the same problem, in terms of both approximation factor, and running time. The key ingredient of our algorithm is a technique that uses edge-coloring algorithms to sample a cycle cover with $O(n/\\log k)$ cycles with high prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2396","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.2396","created_at":"2026-05-18T02:49:46.898113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2396v2","created_at":"2026-05-18T02:49:46.898113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2396","created_at":"2026-05-18T02:49:46.898113+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAHBRO5QVBWI","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAHBRO5QVBWIMNYN","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAHBRO5Q","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6","json":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6.json","graph_json":"https://pith.science/api/pith-number/UAHBRO5QVBWIMNYN6VCJOMFUK6/graph.json","events_json":"https://pith.science/api/pith-number/UAHBRO5QVBWIMNYN6VCJOMFUK6/events.json","paper":"https://pith.science/paper/UAHBRO5Q"},"agent_actions":{"view_html":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6","download_json":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6.json","view_paper":"https://pith.science/paper/UAHBRO5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2396&json=true","fetch_graph":"https://pith.science/api/pith-number/UAHBRO5QVBWIMNYN6VCJOMFUK6/graph.json","fetch_events":"https://pith.science/api/pith-number/UAHBRO5QVBWIMNYN6VCJOMFUK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6/action/storage_attestation","attest_author":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6/action/author_attestation","sign_citation":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6/action/citation_signature","submit_replication":"https://pith.science/pith/UAHBRO5QVBWIMNYN6VCJOMFUK6/action/replication_record"}},"created_at":"2026-05-18T02:49:46.898113+00:00","updated_at":"2026-05-18T02:49:46.898113+00:00"}