{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JJ732ECWZV55D7ZQETHK2TWHBD","short_pith_number":"pith:JJ732ECW","canonical_record":{"source":{"id":"1207.4694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:58:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b6fabb52db6987dd0820291f9789b33f83831559ec6be1b9fd306222790f2125","abstract_canon_sha256":"9c916e9f9139cf1111e204d9e26cb07530b43d05b5b1a9ae4f34bc043fe3e333"},"schema_version":"1.0"},"canonical_sha256":"4a7fbd1056cd7bd1ff3024cead4ec708d08b5001da9f2947a3b6fc38c801ff87","source":{"kind":"arxiv","id":"1207.4694","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4694","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4694v2","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4694","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"JJ732ECWZV55","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JJ732ECWZV55D7ZQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JJ732ECW","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JJ732ECWZV55D7ZQETHK2TWHBD","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:58:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b6fabb52db6987dd0820291f9789b33f83831559ec6be1b9fd306222790f2125","abstract_canon_sha256":"9c916e9f9139cf1111e204d9e26cb07530b43d05b5b1a9ae4f34bc043fe3e333"},"schema_version":"1.0"},"canonical_sha256":"4a7fbd1056cd7bd1ff3024cead4ec708d08b5001da9f2947a3b6fc38c801ff87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:41.553699Z","signature_b64":"9SI3u/GgUILbElkUpeiXjkcbCbTMZqMudT08CDLQIZGv0Ci72oHSGtstZ5VJzv3EZPQ57Z00Gq2Yv4EmVPkoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a7fbd1056cd7bd1ff3024cead4ec708d08b5001da9f2947a3b6fc38c801ff87","last_reissued_at":"2026-05-18T03:39:41.552947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:41.552947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4694","source_version":2,"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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bS8bd95FduBzYmqg4Qa3ej63cgggjoPII8gl6uaeLGX6y+z+yBTRxkvc20mXKCaLcqU0upYf2nHXSGvzB8/DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:45:28.075300Z"},"content_sha256":"71d1ad08ff873a53838cdf727cef4ad57ec3057e185d97c404ebf9060dabee42","schema_version":"1.0","event_id":"sha256:71d1ad08ff873a53838cdf727cef4ad57ec3057e185d97c404ebf9060dabee42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JJ732ECWZV55D7ZQETHK2TWHBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Maciej Liskiewicz, Martin R. Schuster","submitted_at":"2012-07-19T14:58:30Z","abstract_excerpt":"We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i.e. graphs with maximum vertex degree three, and prove that the problem for an $n$-vertex graph can be solved in $O(1.2553^n)$ time and in linear space. We show that the exact TSP algorithm of Eppstein, with some minor modifications, yields the stated result. The previous best known upper bound $O(1.251^n)$ was claimed by Iwama and Nakashima [Proc. COCOON 2007]. Unfortunately, their analysis contains several mistakes that render the proof for the upper bound invalid."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4694","kind":"arxiv","version":2},"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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"llyXlLIfZE+50hl6YIjjTsE1oxH+7jW6ucLzdaTq7USK6JhATL8KGUykJybMEsMhWa3MmZ37tA5IRS/9RcGABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:45:28.075663Z"},"content_sha256":"d7ab84f6491d46c7649477a92fb079c6ace6e661e2e2315d141cbe9322c7b534","schema_version":"1.0","event_id":"sha256:d7ab84f6491d46c7649477a92fb079c6ace6e661e2e2315d141cbe9322c7b534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/bundle.json","state_url":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ732ECWZV55D7ZQETHK2TWHBD/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-12T01:45:28Z","links":{"resolver":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD","bundle":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/bundle.json","state":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ732ECWZV55D7ZQETHK2TWHBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JJ732ECWZV55D7ZQETHK2TWHBD","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":"9c916e9f9139cf1111e204d9e26cb07530b43d05b5b1a9ae4f34bc043fe3e333","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:58:30Z","title_canon_sha256":"b6fabb52db6987dd0820291f9789b33f83831559ec6be1b9fd306222790f2125"},"schema_version":"1.0","source":{"id":"1207.4694","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4694","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4694v2","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4694","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"JJ732ECWZV55","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JJ732ECWZV55D7ZQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JJ732ECW","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:d7ab84f6491d46c7649477a92fb079c6ace6e661e2e2315d141cbe9322c7b534","target":"graph","created_at":"2026-05-18T03:39:41Z","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 provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i.e. graphs with maximum vertex degree three, and prove that the problem for an $n$-vertex graph can be solved in $O(1.2553^n)$ time and in linear space. We show that the exact TSP algorithm of Eppstein, with some minor modifications, yields the stated result. The previous best known upper bound $O(1.251^n)$ was claimed by Iwama and Nakashima [Proc. COCOON 2007]. Unfortunately, their analysis contains several mistakes that render the proof for the upper bound invalid.","authors_text":"Maciej Liskiewicz, Martin R. Schuster","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:58:30Z","title":"A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4694","kind":"arxiv","version":2},"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:71d1ad08ff873a53838cdf727cef4ad57ec3057e185d97c404ebf9060dabee42","target":"record","created_at":"2026-05-18T03:39:41Z","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":"9c916e9f9139cf1111e204d9e26cb07530b43d05b5b1a9ae4f34bc043fe3e333","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:58:30Z","title_canon_sha256":"b6fabb52db6987dd0820291f9789b33f83831559ec6be1b9fd306222790f2125"},"schema_version":"1.0","source":{"id":"1207.4694","kind":"arxiv","version":2}},"canonical_sha256":"4a7fbd1056cd7bd1ff3024cead4ec708d08b5001da9f2947a3b6fc38c801ff87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a7fbd1056cd7bd1ff3024cead4ec708d08b5001da9f2947a3b6fc38c801ff87","first_computed_at":"2026-05-18T03:39:41.552947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:41.552947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9SI3u/GgUILbElkUpeiXjkcbCbTMZqMudT08CDLQIZGv0Ci72oHSGtstZ5VJzv3EZPQ57Z00Gq2Yv4EmVPkoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:41.553699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4694","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71d1ad08ff873a53838cdf727cef4ad57ec3057e185d97c404ebf9060dabee42","sha256:d7ab84f6491d46c7649477a92fb079c6ace6e661e2e2315d141cbe9322c7b534"],"state_sha256":"6ecbe3168990b180150ee187c7db7808087e0e0dd9fa951c4a0840322c2660fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeDjeJNgGlWM7Lc+iHUxlgHnN47XhzeC5j2gPOqx/gRblE7xWmzGX/Y7aIdr2489o3T6O0JKD2gtrll+xqnQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:45:28.077760Z","bundle_sha256":"58d93b3a74e152e4da810f831f3a4bf72ded1e5a1b9aa4cfe75a927816d7ed02"}}