{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SKZBUDO35RROFJLWUIB3U5SWVU","short_pith_number":"pith:SKZBUDO3","canonical_record":{"source":{"id":"1504.02151","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-08T22:48:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3524f5103ced148e2212f8a86c88e7244d8ca7aeab01c761c86c5f0316326a39","abstract_canon_sha256":"5c5725a34e57ec829fa9eb17ced88c1e0da7761ec9b53e1aae811320d43f9ce5"},"schema_version":"1.0"},"canonical_sha256":"92b21a0ddbec62e2a576a203ba7656ad3337a10e896dfdd0c1dce1a7fd0dfce2","source":{"kind":"arxiv","id":"1504.02151","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02151","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02151v5","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02151","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"pith_short_12","alias_value":"SKZBUDO35RRO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SKZBUDO35RROFJLW","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SKZBUDO3","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SKZBUDO35RROFJLWUIB3U5SWVU","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02151","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-08T22:48:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3524f5103ced148e2212f8a86c88e7244d8ca7aeab01c761c86c5f0316326a39","abstract_canon_sha256":"5c5725a34e57ec829fa9eb17ced88c1e0da7761ec9b53e1aae811320d43f9ce5"},"schema_version":"1.0"},"canonical_sha256":"92b21a0ddbec62e2a576a203ba7656ad3337a10e896dfdd0c1dce1a7fd0dfce2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:10.141881Z","signature_b64":"sYcg5CFlRZf8dmnVUDyUPDX3yIscRUvLrFbgnbTEgKsXZWVpC131HMVUN7SDBpiKPa44YBvGn+S4sGyyPUlfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b21a0ddbec62e2a576a203ba7656ad3337a10e896dfdd0c1dce1a7fd0dfce2","last_reissued_at":"2026-05-18T00:36:10.141177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:10.141177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02151","source_version":5,"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:36:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xafgNoTMuuJHe2l2u7SEXLA12RuGJEf2ROuqqkyVsySRVV3CZwU8DVSz9N2oZZG3FoHbfPfwYY0TeN2ROSqECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:47:10.719618Z"},"content_sha256":"4079f3c5736bb29fb78e680621cdaadbc69e6e108bcbe3b100f83c18aaa01d6a","schema_version":"1.0","event_id":"sha256:4079f3c5736bb29fb78e680621cdaadbc69e6e108bcbe3b100f83c18aaa01d6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SKZBUDO35RROFJLWUIB3U5SWVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear Time Algorithm for the $3$-neighbour Traveling Salesman Problem on Halin graphs and extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Abraham Punnen, Brad Woods, Tamon Stephen","submitted_at":"2015-04-08T22:48:21Z","abstract_excerpt":"The Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs are defined on all pairs of edges contained in the Hamilton cycle. This is a more general version than the commonly studied QTSP which only considers pairs of adjacent edges. We define a restricted version of QTSP, the $k$-neighbour TSP (TSP($k$)), and give a linear time algorithm to solve TSP($k$) on a Halin graph for $k\\leq 3$. This algorithm can be extended to solve TSP($k$) on any fully reducible class of graphs for any fixed $k$ in polynomial time. This result gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02151","kind":"arxiv","version":5},"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:36:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hpv15gTLYSEMKAzxGHfPJbzhFuyJXh4J6PeOvoOb3Uyc/QXAq1W4VBJMV+6Z0LazEIpCRFHgvje4/h+428/vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:47:10.720826Z"},"content_sha256":"5b3a54b5849bd4e289d3d7b2d68368e1a8903160e064147d728d8247d074daf4","schema_version":"1.0","event_id":"sha256:5b3a54b5849bd4e289d3d7b2d68368e1a8903160e064147d728d8247d074daf4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKZBUDO35RROFJLWUIB3U5SWVU/bundle.json","state_url":"https://pith.science/pith/SKZBUDO35RROFJLWUIB3U5SWVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKZBUDO35RROFJLWUIB3U5SWVU/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-05T20:47:10Z","links":{"resolver":"https://pith.science/pith/SKZBUDO35RROFJLWUIB3U5SWVU","bundle":"https://pith.science/pith/SKZBUDO35RROFJLWUIB3U5SWVU/bundle.json","state":"https://pith.science/pith/SKZBUDO35RROFJLWUIB3U5SWVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKZBUDO35RROFJLWUIB3U5SWVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SKZBUDO35RROFJLWUIB3U5SWVU","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":"5c5725a34e57ec829fa9eb17ced88c1e0da7761ec9b53e1aae811320d43f9ce5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-08T22:48:21Z","title_canon_sha256":"3524f5103ced148e2212f8a86c88e7244d8ca7aeab01c761c86c5f0316326a39"},"schema_version":"1.0","source":{"id":"1504.02151","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02151","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02151v5","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02151","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"pith_short_12","alias_value":"SKZBUDO35RRO","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SKZBUDO35RROFJLW","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SKZBUDO3","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:5b3a54b5849bd4e289d3d7b2d68368e1a8903160e064147d728d8247d074daf4","target":"graph","created_at":"2026-05-18T00:36:10Z","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 Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs are defined on all pairs of edges contained in the Hamilton cycle. This is a more general version than the commonly studied QTSP which only considers pairs of adjacent edges. We define a restricted version of QTSP, the $k$-neighbour TSP (TSP($k$)), and give a linear time algorithm to solve TSP($k$) on a Halin graph for $k\\leq 3$. This algorithm can be extended to solve TSP($k$) on any fully reducible class of graphs for any fixed $k$ in polynomial time. This result gen","authors_text":"Abraham Punnen, Brad Woods, Tamon Stephen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-08T22:48:21Z","title":"A Linear Time Algorithm for the $3$-neighbour Traveling Salesman Problem on Halin graphs and extensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02151","kind":"arxiv","version":5},"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:4079f3c5736bb29fb78e680621cdaadbc69e6e108bcbe3b100f83c18aaa01d6a","target":"record","created_at":"2026-05-18T00:36:10Z","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":"5c5725a34e57ec829fa9eb17ced88c1e0da7761ec9b53e1aae811320d43f9ce5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-08T22:48:21Z","title_canon_sha256":"3524f5103ced148e2212f8a86c88e7244d8ca7aeab01c761c86c5f0316326a39"},"schema_version":"1.0","source":{"id":"1504.02151","kind":"arxiv","version":5}},"canonical_sha256":"92b21a0ddbec62e2a576a203ba7656ad3337a10e896dfdd0c1dce1a7fd0dfce2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b21a0ddbec62e2a576a203ba7656ad3337a10e896dfdd0c1dce1a7fd0dfce2","first_computed_at":"2026-05-18T00:36:10.141177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:10.141177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sYcg5CFlRZf8dmnVUDyUPDX3yIscRUvLrFbgnbTEgKsXZWVpC131HMVUN7SDBpiKPa44YBvGn+S4sGyyPUlfCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:10.141881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02151","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4079f3c5736bb29fb78e680621cdaadbc69e6e108bcbe3b100f83c18aaa01d6a","sha256:5b3a54b5849bd4e289d3d7b2d68368e1a8903160e064147d728d8247d074daf4"],"state_sha256":"c9111084beab185349b74f6142fad7b0ad57412013c183d81b03283e39ea0c2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hg2FV/uo9H66t+qptfBZUJWeel761TdYDlv4fdFXPY7a1YLaCyP0/ryWPLHNZESjbSyijiyuWNkBjXNfcKaPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:47:10.723669Z","bundle_sha256":"7f7000ad1c5bb7491fcb250c03215e3b6ccc3efea6fc6bfd5a6f736a4a4438da"}}