{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:27ASP3HJMQXMW3SLLJXLYNMYAB","short_pith_number":"pith:27ASP3HJ","canonical_record":{"source":{"id":"1212.6831","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T07:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"33cf6d5128338c78ef41cd3a83ed3e167302dc6180b7f165a58f8963bf0a3797","abstract_canon_sha256":"5571fa218a6dac65999a3c9913cae0a68806739fdec523593b1ab93152768f86"},"schema_version":"1.0"},"canonical_sha256":"d7c127ece9642ecb6e4b5a6ebc35980077c5bf9026de36a978b68411c3034f14","source":{"kind":"arxiv","id":"1212.6831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6831","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6831v1","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6831","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"27ASP3HJMQXM","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"27ASP3HJMQXMW3SL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"27ASP3HJ","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:27ASP3HJMQXMW3SLLJXLYNMYAB","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6831","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T07:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"33cf6d5128338c78ef41cd3a83ed3e167302dc6180b7f165a58f8963bf0a3797","abstract_canon_sha256":"5571fa218a6dac65999a3c9913cae0a68806739fdec523593b1ab93152768f86"},"schema_version":"1.0"},"canonical_sha256":"d7c127ece9642ecb6e4b5a6ebc35980077c5bf9026de36a978b68411c3034f14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:36.901766Z","signature_b64":"3ImX7UfjiMTuL6Go1c15esYoQzHt5lgloIZHFYaFyN9HH3XMYreAZ49I/BjYf0OtSmIW2P0eakcoeO4x03VyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7c127ece9642ecb6e4b5a6ebc35980077c5bf9026de36a978b68411c3034f14","last_reissued_at":"2026-05-18T00:38:36.901072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:36.901072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6831","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-05-18T00:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fV5DXZV4u0DJd6yYS5gVrgum9qi3Tm0agF6UXwdrywg4m4ypEDwQ0n1md2teuaUeXQ0pffqJsmSAej7v4bsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:41:51.233695Z"},"content_sha256":"374e38f4f6b8db500acb0c900732b278426e4e067e92238c53038681fc0f8c24","schema_version":"1.0","event_id":"sha256:374e38f4f6b8db500acb0c900732b278426e4e067e92238c53038681fc0f8c24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:27ASP3HJMQXMW3SLLJXLYNMYAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Nagamochi, Mingyu Xiao","submitted_at":"2012-12-31T07:28:15Z","abstract_excerpt":"The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3. This improves the previous time bounds of O^*(1.251^n) by Iwama and Nakashima and O^*(1.260^n) by Eppstein. Our algorithm is a simple branch-and-search algorithm. The only branch rule is designed on a cut-circuit structure of a graph induced by unprocessed edges. To improve a time bound by a simple analysis on measure and conquer, we introduce an amortization scheme over the cut-circuit structure by defining the measure of an instance to be the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6831","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":""},"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-18T00:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeLtfJiJKHSiN+o1aLmSq5fbYTWbsa/LyoxRFAwfzY8fJk+MAELfx4F+Cua4k1MGrRL1/k/F2wZBtTaaxZE8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:41:51.234046Z"},"content_sha256":"926f6a0520377f547225e0c1afbf420909c9410b64faaef8778b78d54a086807","schema_version":"1.0","event_id":"sha256:926f6a0520377f547225e0c1afbf420909c9410b64faaef8778b78d54a086807"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27ASP3HJMQXMW3SLLJXLYNMYAB/bundle.json","state_url":"https://pith.science/pith/27ASP3HJMQXMW3SLLJXLYNMYAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27ASP3HJMQXMW3SLLJXLYNMYAB/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-28T09:41:51Z","links":{"resolver":"https://pith.science/pith/27ASP3HJMQXMW3SLLJXLYNMYAB","bundle":"https://pith.science/pith/27ASP3HJMQXMW3SLLJXLYNMYAB/bundle.json","state":"https://pith.science/pith/27ASP3HJMQXMW3SLLJXLYNMYAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27ASP3HJMQXMW3SLLJXLYNMYAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:27ASP3HJMQXMW3SLLJXLYNMYAB","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":"5571fa218a6dac65999a3c9913cae0a68806739fdec523593b1ab93152768f86","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T07:28:15Z","title_canon_sha256":"33cf6d5128338c78ef41cd3a83ed3e167302dc6180b7f165a58f8963bf0a3797"},"schema_version":"1.0","source":{"id":"1212.6831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6831","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6831v1","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6831","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"27ASP3HJMQXM","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"27ASP3HJMQXMW3SL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"27ASP3HJ","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:926f6a0520377f547225e0c1afbf420909c9410b64faaef8778b78d54a086807","target":"graph","created_at":"2026-05-18T00:38:36Z","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":"The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3. This improves the previous time bounds of O^*(1.251^n) by Iwama and Nakashima and O^*(1.260^n) by Eppstein. Our algorithm is a simple branch-and-search algorithm. The only branch rule is designed on a cut-circuit structure of a graph induced by unprocessed edges. To improve a time bound by a simple analysis on measure and conquer, we introduce an amortization scheme over the cut-circuit structure by defining the measure of an instance to be the ","authors_text":"Hiroshi Nagamochi, Mingyu Xiao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T07:28:15Z","title":"An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6831","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:374e38f4f6b8db500acb0c900732b278426e4e067e92238c53038681fc0f8c24","target":"record","created_at":"2026-05-18T00:38:36Z","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":"5571fa218a6dac65999a3c9913cae0a68806739fdec523593b1ab93152768f86","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-12-31T07:28:15Z","title_canon_sha256":"33cf6d5128338c78ef41cd3a83ed3e167302dc6180b7f165a58f8963bf0a3797"},"schema_version":"1.0","source":{"id":"1212.6831","kind":"arxiv","version":1}},"canonical_sha256":"d7c127ece9642ecb6e4b5a6ebc35980077c5bf9026de36a978b68411c3034f14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7c127ece9642ecb6e4b5a6ebc35980077c5bf9026de36a978b68411c3034f14","first_computed_at":"2026-05-18T00:38:36.901072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:36.901072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ImX7UfjiMTuL6Go1c15esYoQzHt5lgloIZHFYaFyN9HH3XMYreAZ49I/BjYf0OtSmIW2P0eakcoeO4x03VyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:36.901766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:374e38f4f6b8db500acb0c900732b278426e4e067e92238c53038681fc0f8c24","sha256:926f6a0520377f547225e0c1afbf420909c9410b64faaef8778b78d54a086807"],"state_sha256":"8e439390c6458f1d6cc0c952f9739ca42a5d7d328e24154f11e8c86c2e02065d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHK6rDWSfIxBD4Rfwl2MTgbgqJ2lnxIRnJ6gCdYQoxXwPWVv16LKFBCo8/i1ZTq+1hjsc2LSs97fWhiERdR+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:41:51.236069Z","bundle_sha256":"22f2704b1e32c2d5bf063accb420f718f9b03b35ac6c4dd4840a9f5fddf84956"}}