{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GSTSTIMN7HHSR5NUNMZTH2F4SJ","short_pith_number":"pith:GSTSTIMN","schema_version":"1.0","canonical_sha256":"34a729a18df9cf28f5b46b3333e8bc925f5262a75b6648b753c14e022e45202e","source":{"kind":"arxiv","id":"1310.1896","version":1},"attestation_state":"computed","paper":{"title":"TSP Tours in Cubic Graphs: Beyond 4/3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jos\\'e A. Soto, Jos\\'e R. Correa, Omar Larr\\'e","submitted_at":"2013-10-07T19:35:53Z","abstract_excerpt":"After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic 2-connected graph, has a Hamiltonian tour of length at most (4/3)n, establishing in particular that the integrality gap of the subtour LP is at most 4/3 for cubic 2-connected graphs and matching the conjectured value of the famous 4/3 conjecture. In this paper we improve upon this result by designing an algorithm that finds a tour of length (4/3 - 1/61236)n, implying that cubic 2-connected graphs are among the few interesting classes of graph"},"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":"1310.1896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-07T19:35:53Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"866ad69064c9b49b11a95441ad0f8b2d32eb9b8e703943080ff7186ec119f50b","abstract_canon_sha256":"2c55323f1cd45cc210e5e4a3eb7c37dc764f7ebd1a9c76291c18c9e2321b8075"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:10.234310Z","signature_b64":"zELPBubUfSvHQ+HeAp2AYS5gFxROoOTkBVrIauoGQNxgygv2dmz0E733kIZpsyhkGT7xC+eAZsB+FEIXJr2OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a729a18df9cf28f5b46b3333e8bc925f5262a75b6648b753c14e022e45202e","last_reissued_at":"2026-05-18T03:11:10.233509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:10.233509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TSP Tours in Cubic Graphs: Beyond 4/3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jos\\'e A. Soto, Jos\\'e R. Correa, Omar Larr\\'e","submitted_at":"2013-10-07T19:35:53Z","abstract_excerpt":"After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic 2-connected graph, has a Hamiltonian tour of length at most (4/3)n, establishing in particular that the integrality gap of the subtour LP is at most 4/3 for cubic 2-connected graphs and matching the conjectured value of the famous 4/3 conjecture. In this paper we improve upon this result by designing an algorithm that finds a tour of length (4/3 - 1/61236)n, implying that cubic 2-connected graphs are among the few interesting classes of graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1896","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":"1310.1896","created_at":"2026-05-18T03:11:10.233654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1896v1","created_at":"2026-05-18T03:11:10.233654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1896","created_at":"2026-05-18T03:11:10.233654+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSTSTIMN7HHS","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSTSTIMN7HHSR5NU","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSTSTIMN","created_at":"2026-05-18T12:27:45.050594+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/GSTSTIMN7HHSR5NUNMZTH2F4SJ","json":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ.json","graph_json":"https://pith.science/api/pith-number/GSTSTIMN7HHSR5NUNMZTH2F4SJ/graph.json","events_json":"https://pith.science/api/pith-number/GSTSTIMN7HHSR5NUNMZTH2F4SJ/events.json","paper":"https://pith.science/paper/GSTSTIMN"},"agent_actions":{"view_html":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ","download_json":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ.json","view_paper":"https://pith.science/paper/GSTSTIMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1896&json=true","fetch_graph":"https://pith.science/api/pith-number/GSTSTIMN7HHSR5NUNMZTH2F4SJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GSTSTIMN7HHSR5NUNMZTH2F4SJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/action/storage_attestation","attest_author":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/action/author_attestation","sign_citation":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/action/citation_signature","submit_replication":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/action/replication_record"}},"created_at":"2026-05-18T03:11:10.233654+00:00","updated_at":"2026-05-18T03:11:10.233654+00:00"}