{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GSTSTIMN7HHSR5NUNMZTH2F4SJ","short_pith_number":"pith:GSTSTIMN","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"},"canonical_sha256":"34a729a18df9cf28f5b46b3333e8bc925f5262a75b6648b753c14e022e45202e","source":{"kind":"arxiv","id":"1310.1896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1896","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1896v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1896","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"GSTSTIMN7HHS","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GSTSTIMN7HHSR5NU","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GSTSTIMN","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GSTSTIMN7HHSR5NUNMZTH2F4SJ","target":"record","payload":{"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"},"canonical_sha256":"34a729a18df9cf28f5b46b3333e8bc925f5262a75b6648b753c14e022e45202e","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"},"source_kind":"arxiv","source_id":"1310.1896","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gs7vlT62Uu7e9ef/mX/Scsn0Ug+bs0eOICUtFXCQ9lFMnTpdV9spx52Voqx374Gq9WNvpk7+NEaXAZ2cmgfSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:40:57.983699Z"},"content_sha256":"ac11ca0cbdf6da5ed4a5033160bc4511e31c16133bdfa9807c4949df84386ba0","schema_version":"1.0","event_id":"sha256:ac11ca0cbdf6da5ed4a5033160bc4511e31c16133bdfa9807c4949df84386ba0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GSTSTIMN7HHSR5NUNMZTH2F4SJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+bWGlS0Ur8eju3hZxkS2CGQsA0XKYOFzeUPM9n4W18NEGjAM8zW1u7+TdKo3aNM3WHONWU82I5SRd7z1zrYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:40:57.984069Z"},"content_sha256":"7ce9d698300328072f5f804a3bb2972fc681242968740afee1565f52b8d7e43f","schema_version":"1.0","event_id":"sha256:7ce9d698300328072f5f804a3bb2972fc681242968740afee1565f52b8d7e43f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/bundle.json","state_url":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T15:40:57Z","links":{"resolver":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ","bundle":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/bundle.json","state":"https://pith.science/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSTSTIMN7HHSR5NUNMZTH2F4SJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GSTSTIMN7HHSR5NUNMZTH2F4SJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2c55323f1cd45cc210e5e4a3eb7c37dc764f7ebd1a9c76291c18c9e2321b8075","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-07T19:35:53Z","title_canon_sha256":"866ad69064c9b49b11a95441ad0f8b2d32eb9b8e703943080ff7186ec119f50b"},"schema_version":"1.0","source":{"id":"1310.1896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1896","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1896v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1896","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"GSTSTIMN7HHS","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GSTSTIMN7HHSR5NU","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GSTSTIMN","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:7ce9d698300328072f5f804a3bb2972fc681242968740afee1565f52b8d7e43f","target":"graph","created_at":"2026-05-18T03:11:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jos\\'e A. Soto, Jos\\'e R. Correa, Omar Larr\\'e","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-07T19:35:53Z","title":"TSP Tours in Cubic Graphs: Beyond 4/3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1896","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ac11ca0cbdf6da5ed4a5033160bc4511e31c16133bdfa9807c4949df84386ba0","target":"record","created_at":"2026-05-18T03:11:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2c55323f1cd45cc210e5e4a3eb7c37dc764f7ebd1a9c76291c18c9e2321b8075","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-07T19:35:53Z","title_canon_sha256":"866ad69064c9b49b11a95441ad0f8b2d32eb9b8e703943080ff7186ec119f50b"},"schema_version":"1.0","source":{"id":"1310.1896","kind":"arxiv","version":1}},"canonical_sha256":"34a729a18df9cf28f5b46b3333e8bc925f5262a75b6648b753c14e022e45202e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34a729a18df9cf28f5b46b3333e8bc925f5262a75b6648b753c14e022e45202e","first_computed_at":"2026-05-18T03:11:10.233509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:10.233509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zELPBubUfSvHQ+HeAp2AYS5gFxROoOTkBVrIauoGQNxgygv2dmz0E733kIZpsyhkGT7xC+eAZsB+FEIXJr2OCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:10.234310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac11ca0cbdf6da5ed4a5033160bc4511e31c16133bdfa9807c4949df84386ba0","sha256:7ce9d698300328072f5f804a3bb2972fc681242968740afee1565f52b8d7e43f"],"state_sha256":"e91e0dcb33429c7e502efd16b30be2e1faec0e3032f076f393b4cf3ff9fd2f19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM5+4yQtrMLX2GQQpnWHUWqbJ8xxaXkIFkOJyZGhx3InFY2DTKfLaqr1xBJXnQTFUpnXWKnn9Ar/XSsvB2MUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:40:57.986089Z","bundle_sha256":"fcd596d7a44f703cffc183cd27460556e608c2852f44e1a1f35f6e16ea23b27c"}}