{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JJ732ECWZV55D7ZQETHK2TWHBD","short_pith_number":"pith:JJ732ECW","schema_version":"1.0","canonical_sha256":"4a7fbd1056cd7bd1ff3024cead4ec708d08b5001da9f2947a3b6fc38c801ff87","source":{"kind":"arxiv","id":"1207.4694","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.4694","created_at":"2026-05-18T03:39:41.553100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4694v2","created_at":"2026-05-18T03:39:41.553100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4694","created_at":"2026-05-18T03:39:41.553100+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJ732ECWZV55","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJ732ECWZV55D7ZQ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJ732ECW","created_at":"2026-05-18T12:27:11.947152+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/JJ732ECWZV55D7ZQETHK2TWHBD","json":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD.json","graph_json":"https://pith.science/api/pith-number/JJ732ECWZV55D7ZQETHK2TWHBD/graph.json","events_json":"https://pith.science/api/pith-number/JJ732ECWZV55D7ZQETHK2TWHBD/events.json","paper":"https://pith.science/paper/JJ732ECW"},"agent_actions":{"view_html":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD","download_json":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD.json","view_paper":"https://pith.science/paper/JJ732ECW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4694&json=true","fetch_graph":"https://pith.science/api/pith-number/JJ732ECWZV55D7ZQETHK2TWHBD/graph.json","fetch_events":"https://pith.science/api/pith-number/JJ732ECWZV55D7ZQETHK2TWHBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/action/storage_attestation","attest_author":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/action/author_attestation","sign_citation":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/action/citation_signature","submit_replication":"https://pith.science/pith/JJ732ECWZV55D7ZQETHK2TWHBD/action/replication_record"}},"created_at":"2026-05-18T03:39:41.553100+00:00","updated_at":"2026-05-18T03:39:41.553100+00:00"}