{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6G2RGMVHENDXVIXVMLOZB7FLNR","short_pith_number":"pith:6G2RGMVH","canonical_record":{"source":{"id":"1304.7607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T10:03:29Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"0a2f58cac6508287e50740be73bddff6f34319c573922080607c8b0db778bbcb","abstract_canon_sha256":"1f9f42514c8a384398fada77216911119d216bc4fffbb12e2e8d6406b2b15101"},"schema_version":"1.0"},"canonical_sha256":"f1b51332a723477aa2f562dd90fcab6c7a972c46224ab5e9ffb1fe967bbffdcc","source":{"kind":"arxiv","id":"1304.7607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7607","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7607v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7607","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"6G2RGMVHENDX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6G2RGMVHENDXVIXV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6G2RGMVH","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6G2RGMVHENDXVIXVMLOZB7FLNR","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T10:03:29Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"0a2f58cac6508287e50740be73bddff6f34319c573922080607c8b0db778bbcb","abstract_canon_sha256":"1f9f42514c8a384398fada77216911119d216bc4fffbb12e2e8d6406b2b15101"},"schema_version":"1.0"},"canonical_sha256":"f1b51332a723477aa2f562dd90fcab6c7a972c46224ab5e9ffb1fe967bbffdcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.080387Z","signature_b64":"WR4dY2hA77XlI9AlZ+ocHIhmkCHfu8iWfyP4NtEkugloyo9dGjt4kXPVaHDMgaOfHWwy/tJnv4GuKsXjHAZ3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1b51332a723477aa2f562dd90fcab6c7a972c46224ab5e9ffb1fe967bbffdcc","last_reissued_at":"2026-05-18T01:32:42.079849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.079849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7607","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHdDeglK/EF0muX/jz9G/JGZJ2O3eGFCMfjHSvYU7tzE3s6/T5VA2KMS1KOndi4yr6G4JmtMykYyawFSjriXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:26:13.147777Z"},"content_sha256":"95aa9a296c8ab80aabf235ca518d04a34a1e47d56baff3116dcaada2aaf31345","schema_version":"1.0","event_id":"sha256:95aa9a296c8ab80aabf235ca518d04a34a1e47d56baff3116dcaada2aaf31345"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6G2RGMVHENDXVIXVMLOZB7FLNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"math.OC","authors_text":"Chunhua Yang, Weihua Gui, Xiaojun Zhou, Xiaolin Tang","submitted_at":"2013-04-29T10:03:29Z","abstract_excerpt":"Generalized traveling salesman problem (GTSP) is an extension of classical traveling salesman problem (TSP), which is a combinatorial optimization problem and an NP-hard problem. In this paper, an efficient discrete state transition algorithm (DSTA) for GTSP is proposed, where a new local search operator named \\textit{K-circle}, directed by neighborhood information in space, has been introduced to DSTA to shrink search space and strengthen search ability. A novel robust update mechanism, restore in probability and risk in probability (Double R-Probability), is used in our work to escape from l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7607","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ij6ePy1hTr844XAqTe45cC40OK+r20L4Jf8yangM7m/ssxnn4uL1fk4oMlwGQYmXMiE4wjVgiWqDP2a+uyNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:26:13.148485Z"},"content_sha256":"54e7aaf1809c154f4d64e591e059d204d023162149671a3504b635e176b2fbdc","schema_version":"1.0","event_id":"sha256:54e7aaf1809c154f4d64e591e059d204d023162149671a3504b635e176b2fbdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6G2RGMVHENDXVIXVMLOZB7FLNR/bundle.json","state_url":"https://pith.science/pith/6G2RGMVHENDXVIXVMLOZB7FLNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6G2RGMVHENDXVIXVMLOZB7FLNR/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-08T06:26:13Z","links":{"resolver":"https://pith.science/pith/6G2RGMVHENDXVIXVMLOZB7FLNR","bundle":"https://pith.science/pith/6G2RGMVHENDXVIXVMLOZB7FLNR/bundle.json","state":"https://pith.science/pith/6G2RGMVHENDXVIXVMLOZB7FLNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6G2RGMVHENDXVIXVMLOZB7FLNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6G2RGMVHENDXVIXVMLOZB7FLNR","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":"1f9f42514c8a384398fada77216911119d216bc4fffbb12e2e8d6406b2b15101","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T10:03:29Z","title_canon_sha256":"0a2f58cac6508287e50740be73bddff6f34319c573922080607c8b0db778bbcb"},"schema_version":"1.0","source":{"id":"1304.7607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7607","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7607v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7607","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"6G2RGMVHENDX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6G2RGMVHENDXVIXV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6G2RGMVH","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:54e7aaf1809c154f4d64e591e059d204d023162149671a3504b635e176b2fbdc","target":"graph","created_at":"2026-05-18T01:32:42Z","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":"Generalized traveling salesman problem (GTSP) is an extension of classical traveling salesman problem (TSP), which is a combinatorial optimization problem and an NP-hard problem. In this paper, an efficient discrete state transition algorithm (DSTA) for GTSP is proposed, where a new local search operator named \\textit{K-circle}, directed by neighborhood information in space, has been introduced to DSTA to shrink search space and strengthen search ability. A novel robust update mechanism, restore in probability and risk in probability (Double R-Probability), is used in our work to escape from l","authors_text":"Chunhua Yang, Weihua Gui, Xiaojun Zhou, Xiaolin Tang","cross_cats":["cs.AI","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T10:03:29Z","title":"A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7607","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:95aa9a296c8ab80aabf235ca518d04a34a1e47d56baff3116dcaada2aaf31345","target":"record","created_at":"2026-05-18T01:32:42Z","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":"1f9f42514c8a384398fada77216911119d216bc4fffbb12e2e8d6406b2b15101","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T10:03:29Z","title_canon_sha256":"0a2f58cac6508287e50740be73bddff6f34319c573922080607c8b0db778bbcb"},"schema_version":"1.0","source":{"id":"1304.7607","kind":"arxiv","version":1}},"canonical_sha256":"f1b51332a723477aa2f562dd90fcab6c7a972c46224ab5e9ffb1fe967bbffdcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1b51332a723477aa2f562dd90fcab6c7a972c46224ab5e9ffb1fe967bbffdcc","first_computed_at":"2026-05-18T01:32:42.079849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.079849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WR4dY2hA77XlI9AlZ+ocHIhmkCHfu8iWfyP4NtEkugloyo9dGjt4kXPVaHDMgaOfHWwy/tJnv4GuKsXjHAZ3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.080387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95aa9a296c8ab80aabf235ca518d04a34a1e47d56baff3116dcaada2aaf31345","sha256:54e7aaf1809c154f4d64e591e059d204d023162149671a3504b635e176b2fbdc"],"state_sha256":"143e7b0a74a94b2fb22fdafc524673a21846c672657c904876d06bc2c0dc7826"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9w+uy2+QkWI8np2POJqExiO3WqahUxTjE39EB5t5OgBhYmlK1EKywZJ7MoeBjSgUgJXYPByvmzq5d4pT3KYMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:26:13.152344Z","bundle_sha256":"b91997240795fef4e154cbcfa214ba1fc07eefda2a7de86332f5ca3fb213996c"}}