{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CQ7KGFXDB3N3HCRK4WYQYHQXFS","short_pith_number":"pith:CQ7KGFXD","schema_version":"1.0","canonical_sha256":"143ea316e30edbb38a2ae5b10c1e172cb668967f07815befce6abedffb82cee3","source":{"kind":"arxiv","id":"1506.07776","version":1},"attestation_state":"computed","paper":{"title":"An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"David P. Williamson, Kyle Genova","submitted_at":"2015-06-25T14:52:40Z","abstract_excerpt":"Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant on the well-known Christofides' algorithm for the TSP, called the Best-of-Many Christofides' algorithm. The algorithm involves sampling a spanning tree from the solution the standard LP relaxation of the TSP, subject to the condition that each edge is sampled with probability at most its value in the LP relaxation. One then runs Christofides' algorithm on the tree by computing a minimum-cost matching on the odd-degree vertices in the tree, and shortcutting the resulting Eulerian graph to"},"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":"1506.07776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-25T14:52:40Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d241a166ddb2e27e00bf0f8c233a3ae31005b7b411c5e53525d56ab8713fc91e","abstract_canon_sha256":"c4d4aa22035f4ac4f9d9dbf8466eef35f0e0c344c1eef6d44948c6826330d144"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:50.852831Z","signature_b64":"EgRTWnGDHX0TRlVMua7jwvnsc93OJiPZeCE3j28ir1d/hwZ+U7XPepOIncNoeZ6lBvavlk+ZUQ6WDwr+KuGVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"143ea316e30edbb38a2ae5b10c1e172cb668967f07815befce6abedffb82cee3","last_reissued_at":"2026-05-18T01:38:50.852298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:50.852298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"David P. Williamson, Kyle Genova","submitted_at":"2015-06-25T14:52:40Z","abstract_excerpt":"Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant on the well-known Christofides' algorithm for the TSP, called the Best-of-Many Christofides' algorithm. The algorithm involves sampling a spanning tree from the solution the standard LP relaxation of the TSP, subject to the condition that each edge is sampled with probability at most its value in the LP relaxation. One then runs Christofides' algorithm on the tree by computing a minimum-cost matching on the odd-degree vertices in the tree, and shortcutting the resulting Eulerian graph to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07776","kind":"arxiv","version":1},"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":"1506.07776","created_at":"2026-05-18T01:38:50.852393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07776v1","created_at":"2026-05-18T01:38:50.852393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07776","created_at":"2026-05-18T01:38:50.852393+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQ7KGFXDB3N3","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQ7KGFXDB3N3HCRK","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQ7KGFXD","created_at":"2026-05-18T12:29:17.054201+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/CQ7KGFXDB3N3HCRK4WYQYHQXFS","json":"https://pith.science/pith/CQ7KGFXDB3N3HCRK4WYQYHQXFS.json","graph_json":"https://pith.science/api/pith-number/CQ7KGFXDB3N3HCRK4WYQYHQXFS/graph.json","events_json":"https://pith.science/api/pith-number/CQ7KGFXDB3N3HCRK4WYQYHQXFS/events.json","paper":"https://pith.science/paper/CQ7KGFXD"},"agent_actions":{"view_html":"https://pith.science/pith/CQ7KGFXDB3N3HCRK4WYQYHQXFS","download_json":"https://pith.science/pith/CQ7KGFXDB3N3HCRK4WYQYHQXFS.json","view_paper":"https://pith.science/paper/CQ7KGFXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07776&json=true","fetch_graph":"https://pith.science/api/pith-number/CQ7KGFXDB3N3HCRK4WYQYHQXFS/graph.json","fetch_events":"https://pith.science/api/pith-number/CQ7KGFXDB3N3HCRK4WYQYHQXFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQ7KGFXDB3N3HCRK4WYQYHQXFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQ7KGFXDB3N3HCRK4WYQYHQXFS/action/storage_attestation","attest_author":"https://pith.science/pith/CQ7KGFXDB3N3HCRK4WYQYHQXFS/action/author_attestation","sign_citation":"https://pith.science/pith/CQ7KGFXDB3N3HCRK4WYQYHQXFS/action/citation_signature","submit_replication":"https://pith.science/pith/CQ7KGFXDB3N3HCRK4WYQYHQXFS/action/replication_record"}},"created_at":"2026-05-18T01:38:50.852393+00:00","updated_at":"2026-05-18T01:38:50.852393+00:00"}