{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:KA67QAWR6ROXSNUVMVS6TMNFHA","short_pith_number":"pith:KA67QAWR","canonical_record":{"source":{"id":"2112.06278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-12T16:59:46Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"58bb0c119c6cd51c8c9f4000f6c1e7415d4e4904e54833f9858dc65fc43a416f","abstract_canon_sha256":"2f6c7c51ff39a6ad76ab24ad3066492e8eddbb6c027f0414361aa8bd2f8e3367"},"schema_version":"1.0"},"canonical_sha256":"503df802d1f45d7936956565e9b1a5380680cab58fd6b1c445cf9bb82a7eefde","source":{"kind":"arxiv","id":"2112.06278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.06278","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"2112.06278v1","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06278","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"KA67QAWR6ROX","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"pith_short_16","alias_value":"KA67QAWR6ROXSNUV","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"pith_short_8","alias_value":"KA67QAWR","created_at":"2026-07-05T03:40:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:KA67QAWR6ROXSNUVMVS6TMNFHA","target":"record","payload":{"canonical_record":{"source":{"id":"2112.06278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-12T16:59:46Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"58bb0c119c6cd51c8c9f4000f6c1e7415d4e4904e54833f9858dc65fc43a416f","abstract_canon_sha256":"2f6c7c51ff39a6ad76ab24ad3066492e8eddbb6c027f0414361aa8bd2f8e3367"},"schema_version":"1.0"},"canonical_sha256":"503df802d1f45d7936956565e9b1a5380680cab58fd6b1c445cf9bb82a7eefde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:12.247282Z","signature_b64":"AquYUqBaVYDiMkgRqyB4yTD5rhvJYQem5Na1sHr0r8YfSi/2O2wreWcjabBWr7SlmveRaCseKq/xIpjNlXHlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"503df802d1f45d7936956565e9b1a5380680cab58fd6b1c445cf9bb82a7eefde","last_reissued_at":"2026-07-05T03:40:12.246817Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:12.246817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.06278","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-07-05T03:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+u2q0o4kebLNFcoUs4hsY4suf/HgBTXHuz3O0a7Di1J5dzrJAyQ5jM0aifFCV3AN/CnbmOltrS9iK8jHMarDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:26:41.876722Z"},"content_sha256":"0c2be0f2ce0533f2d951f8e9e009a052b4a2f2be65b87a344a3eb30a908295af","schema_version":"1.0","event_id":"sha256:0c2be0f2ce0533f2d951f8e9e009a052b4a2f2be65b87a344a3eb30a908295af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:KA67QAWR6ROXSNUVMVS6TMNFHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating TSP walks in subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Michael C. Wigal, Xingxing Yu, Youngho Yoo","submitted_at":"2021-12-12T16:59:46Z","abstract_excerpt":"We prove that every simple 2-connected subcubic graph on $n$ vertices with $n_2$ vertices of degree 2 has a TSP walk of length at most $\\frac{5n+n_2}{4}-1$, confirming a conjecture of Dvo\\v{r}\\'ak, Kr\\'al', and Mohar. This bound is best possible; there are infinitely many subcubic and cubic graphs whose minimum TSP walks have lengths $\\frac{5n+n_2}{4}-1$ and $\\frac{5n}{4} - 2$ respectively. We characterize the extremal subcubic examples meeting this bound. We also give a quadratic-time combinatorial algorithm for finding such a TSP walk. In particular, we obtain a $\\frac{5}{4}$-approximation a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06278","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.06278/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTsQVZWhBmERDkQPI9sAGQCoEVX3NgpSuuPNG28b65LcCdV56BhhxEyI16vFczvA6pvUt6FLLfhMQh2QcXZRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:26:41.877093Z"},"content_sha256":"554d0a225552695d8678f2a7c04f0bc6d9d69fa16c3c70ff03142aeac55958f4","schema_version":"1.0","event_id":"sha256:554d0a225552695d8678f2a7c04f0bc6d9d69fa16c3c70ff03142aeac55958f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KA67QAWR6ROXSNUVMVS6TMNFHA/bundle.json","state_url":"https://pith.science/pith/KA67QAWR6ROXSNUVMVS6TMNFHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KA67QAWR6ROXSNUVMVS6TMNFHA/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-07-06T13:26:41Z","links":{"resolver":"https://pith.science/pith/KA67QAWR6ROXSNUVMVS6TMNFHA","bundle":"https://pith.science/pith/KA67QAWR6ROXSNUVMVS6TMNFHA/bundle.json","state":"https://pith.science/pith/KA67QAWR6ROXSNUVMVS6TMNFHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KA67QAWR6ROXSNUVMVS6TMNFHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KA67QAWR6ROXSNUVMVS6TMNFHA","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":"2f6c7c51ff39a6ad76ab24ad3066492e8eddbb6c027f0414361aa8bd2f8e3367","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-12T16:59:46Z","title_canon_sha256":"58bb0c119c6cd51c8c9f4000f6c1e7415d4e4904e54833f9858dc65fc43a416f"},"schema_version":"1.0","source":{"id":"2112.06278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.06278","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"2112.06278v1","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06278","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"KA67QAWR6ROX","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"pith_short_16","alias_value":"KA67QAWR6ROXSNUV","created_at":"2026-07-05T03:40:12Z"},{"alias_kind":"pith_short_8","alias_value":"KA67QAWR","created_at":"2026-07-05T03:40:12Z"}],"graph_snapshots":[{"event_id":"sha256:554d0a225552695d8678f2a7c04f0bc6d9d69fa16c3c70ff03142aeac55958f4","target":"graph","created_at":"2026-07-05T03:40:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.06278/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that every simple 2-connected subcubic graph on $n$ vertices with $n_2$ vertices of degree 2 has a TSP walk of length at most $\\frac{5n+n_2}{4}-1$, confirming a conjecture of Dvo\\v{r}\\'ak, Kr\\'al', and Mohar. This bound is best possible; there are infinitely many subcubic and cubic graphs whose minimum TSP walks have lengths $\\frac{5n+n_2}{4}-1$ and $\\frac{5n}{4} - 2$ respectively. We characterize the extremal subcubic examples meeting this bound. We also give a quadratic-time combinatorial algorithm for finding such a TSP walk. In particular, we obtain a $\\frac{5}{4}$-approximation a","authors_text":"Michael C. Wigal, Xingxing Yu, Youngho Yoo","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-12T16:59:46Z","title":"Approximating TSP walks in subcubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06278","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:0c2be0f2ce0533f2d951f8e9e009a052b4a2f2be65b87a344a3eb30a908295af","target":"record","created_at":"2026-07-05T03:40:12Z","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":"2f6c7c51ff39a6ad76ab24ad3066492e8eddbb6c027f0414361aa8bd2f8e3367","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-12T16:59:46Z","title_canon_sha256":"58bb0c119c6cd51c8c9f4000f6c1e7415d4e4904e54833f9858dc65fc43a416f"},"schema_version":"1.0","source":{"id":"2112.06278","kind":"arxiv","version":1}},"canonical_sha256":"503df802d1f45d7936956565e9b1a5380680cab58fd6b1c445cf9bb82a7eefde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"503df802d1f45d7936956565e9b1a5380680cab58fd6b1c445cf9bb82a7eefde","first_computed_at":"2026-07-05T03:40:12.246817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:40:12.246817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AquYUqBaVYDiMkgRqyB4yTD5rhvJYQem5Na1sHr0r8YfSi/2O2wreWcjabBWr7SlmveRaCseKq/xIpjNlXHlDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:40:12.247282Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.06278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c2be0f2ce0533f2d951f8e9e009a052b4a2f2be65b87a344a3eb30a908295af","sha256:554d0a225552695d8678f2a7c04f0bc6d9d69fa16c3c70ff03142aeac55958f4"],"state_sha256":"975fbc20394ffd414403d013c92cdfac31d8e727ae88a7c7f69ea393d8de4e66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZWFuedBsvuVwxFFI49fkVL80neFob6nUkelBlB4WjyYAZG2IxbnWm7KprQzb/8dFZBpzyxXr8wJC9babAe1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:26:41.879055Z","bundle_sha256":"27bff40e9afc69471902166129590a51966f705117c54c29fbcd391b4b935b6e"}}