{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YMUT2KAI7G4BCF2NNVPBOTCWLE","short_pith_number":"pith:YMUT2KAI","schema_version":"1.0","canonical_sha256":"c3293d2808f9b811174d6d5e174c5659228af5f5c4bbc8483949a19e0ace7ff4","source":{"kind":"arxiv","id":"1608.07568","version":3},"attestation_state":"computed","paper":{"title":"Graphic TSP in cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Bojan Mohar, Daniel Kral, Zdenek Dvorak","submitted_at":"2016-08-26T19:39:42Z","abstract_excerpt":"We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which improves the previously best approximation factor of 1.3 for 2-connected cubic graphs and drops the requirement of 2-connectivity at the same time. To design our algorithm, we prove that every simple 2-connected cubic n-vertex graph contains a spanning closed walk of length at most 9n/7-1, and that such a walk can be found in polynomial time."},"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":"1608.07568","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-26T19:39:42Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"18d216af39f11736883803d2b7def0cffbe8d129b328dc753a17ec198741cc53","abstract_canon_sha256":"ba08f1f5bbf0ab634109aea8c0027438ea187a6532e4ee19e463a6b6bdf64ecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:20.284247Z","signature_b64":"ombvtvh7vG3A9OED2DqcQmolJKk1tn3hPJySC9N4UxdCToMyoGQtGtA/IvaNGLuMbTVnvZ/hcALQVkeK67ASAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3293d2808f9b811174d6d5e174c5659228af5f5c4bbc8483949a19e0ace7ff4","last_reissued_at":"2026-05-18T01:06:20.283402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:20.283402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphic TSP in cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Bojan Mohar, Daniel Kral, Zdenek Dvorak","submitted_at":"2016-08-26T19:39:42Z","abstract_excerpt":"We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which improves the previously best approximation factor of 1.3 for 2-connected cubic graphs and drops the requirement of 2-connectivity at the same time. To design our algorithm, we prove that every simple 2-connected cubic n-vertex graph contains a spanning closed walk of length at most 9n/7-1, and that such a walk can be found in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07568","kind":"arxiv","version":3},"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":"1608.07568","created_at":"2026-05-18T01:06:20.283552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07568v3","created_at":"2026-05-18T01:06:20.283552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07568","created_at":"2026-05-18T01:06:20.283552+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMUT2KAI7G4B","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMUT2KAI7G4BCF2N","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMUT2KAI","created_at":"2026-05-18T12:30:53.716459+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/YMUT2KAI7G4BCF2NNVPBOTCWLE","json":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE.json","graph_json":"https://pith.science/api/pith-number/YMUT2KAI7G4BCF2NNVPBOTCWLE/graph.json","events_json":"https://pith.science/api/pith-number/YMUT2KAI7G4BCF2NNVPBOTCWLE/events.json","paper":"https://pith.science/paper/YMUT2KAI"},"agent_actions":{"view_html":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE","download_json":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE.json","view_paper":"https://pith.science/paper/YMUT2KAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07568&json=true","fetch_graph":"https://pith.science/api/pith-number/YMUT2KAI7G4BCF2NNVPBOTCWLE/graph.json","fetch_events":"https://pith.science/api/pith-number/YMUT2KAI7G4BCF2NNVPBOTCWLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/action/storage_attestation","attest_author":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/action/author_attestation","sign_citation":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/action/citation_signature","submit_replication":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/action/replication_record"}},"created_at":"2026-05-18T01:06:20.283552+00:00","updated_at":"2026-05-18T01:06:20.283552+00:00"}