{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YMUT2KAI7G4BCF2NNVPBOTCWLE","short_pith_number":"pith:YMUT2KAI","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"},"canonical_sha256":"c3293d2808f9b811174d6d5e174c5659228af5f5c4bbc8483949a19e0ace7ff4","source":{"kind":"arxiv","id":"1608.07568","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07568","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07568v3","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07568","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"YMUT2KAI7G4B","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YMUT2KAI7G4BCF2N","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YMUT2KAI","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YMUT2KAI7G4BCF2NNVPBOTCWLE","target":"record","payload":{"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"},"canonical_sha256":"c3293d2808f9b811174d6d5e174c5659228af5f5c4bbc8483949a19e0ace7ff4","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"},"source_kind":"arxiv","source_id":"1608.07568","source_version":3,"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-18T01:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbELRC0v2vIyJ5FA2rEdSUrtFf7cj6YhF+Q50p9+i21hq1qLtyWZOeOmj9diOIWbQj+NKYuJmLqd7LLRm7JcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:12:37.140271Z"},"content_sha256":"5fa16b9f489c459678aba329914e3a5e50339441ff4684ba32ca2121db8e20dc","schema_version":"1.0","event_id":"sha256:5fa16b9f489c459678aba329914e3a5e50339441ff4684ba32ca2121db8e20dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YMUT2KAI7G4BCF2NNVPBOTCWLE","target":"graph","payload":{"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"},"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-18T01:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V1+T+xl2oYMHckqY0yVWINr/ddUfmUdIE6RVtOay79ob+3oRQPXeilxs+JT8MDrgfK7lyJfJ2L6Skdzpg+HRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:12:37.141018Z"},"content_sha256":"369b94806639a5bba26389d5fc81c0df153a077c8599a7674994bda9365be324","schema_version":"1.0","event_id":"sha256:369b94806639a5bba26389d5fc81c0df153a077c8599a7674994bda9365be324"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/bundle.json","state_url":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/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-05-25T18:12:37Z","links":{"resolver":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE","bundle":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/bundle.json","state":"https://pith.science/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMUT2KAI7G4BCF2NNVPBOTCWLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YMUT2KAI7G4BCF2NNVPBOTCWLE","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":"ba08f1f5bbf0ab634109aea8c0027438ea187a6532e4ee19e463a6b6bdf64ecb","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-26T19:39:42Z","title_canon_sha256":"18d216af39f11736883803d2b7def0cffbe8d129b328dc753a17ec198741cc53"},"schema_version":"1.0","source":{"id":"1608.07568","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07568","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07568v3","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07568","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"YMUT2KAI7G4B","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YMUT2KAI7G4BCF2N","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YMUT2KAI","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:369b94806639a5bba26389d5fc81c0df153a077c8599a7674994bda9365be324","target":"graph","created_at":"2026-05-18T01:06:20Z","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":"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.","authors_text":"Bojan Mohar, Daniel Kral, Zdenek Dvorak","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-26T19:39:42Z","title":"Graphic TSP in cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07568","kind":"arxiv","version":3},"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:5fa16b9f489c459678aba329914e3a5e50339441ff4684ba32ca2121db8e20dc","target":"record","created_at":"2026-05-18T01:06:20Z","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":"ba08f1f5bbf0ab634109aea8c0027438ea187a6532e4ee19e463a6b6bdf64ecb","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-26T19:39:42Z","title_canon_sha256":"18d216af39f11736883803d2b7def0cffbe8d129b328dc753a17ec198741cc53"},"schema_version":"1.0","source":{"id":"1608.07568","kind":"arxiv","version":3}},"canonical_sha256":"c3293d2808f9b811174d6d5e174c5659228af5f5c4bbc8483949a19e0ace7ff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3293d2808f9b811174d6d5e174c5659228af5f5c4bbc8483949a19e0ace7ff4","first_computed_at":"2026-05-18T01:06:20.283402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:20.283402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ombvtvh7vG3A9OED2DqcQmolJKk1tn3hPJySC9N4UxdCToMyoGQtGtA/IvaNGLuMbTVnvZ/hcALQVkeK67ASAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:20.284247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07568","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fa16b9f489c459678aba329914e3a5e50339441ff4684ba32ca2121db8e20dc","sha256:369b94806639a5bba26389d5fc81c0df153a077c8599a7674994bda9365be324"],"state_sha256":"6ed9e2949ea983b38fbce19cb2ffca42e8fba789d56c5f8c7e7319d16013b13d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/GI9oZlsFnbc0fVBAsGESKxD8QYXjJbAUyFNauk2nNPtJZ/QDzXVRLLwLnhFjGcBY6ZdnQnMGLecwXZQk0XBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:12:37.144896Z","bundle_sha256":"26e5a17e847a82623b755e36c28ff0b4816e768fc0225997c3e4c4b58a267f10"}}