{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OKVVR5BMYVO5P3TB3QTDPTWSDV","short_pith_number":"pith:OKVVR5BM","canonical_record":{"source":{"id":"1310.2350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-09T05:17:16Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"028af83b7c002efc4d7593bda5291519b6e5f2c838c909cedeb3a0bbcfc2a2b4","abstract_canon_sha256":"0ca7fd69d000feaeb87f51246134f277d236c4b82fbbd109c6aa11d6b5ba4448"},"schema_version":"1.0"},"canonical_sha256":"72ab58f42cc55dd7ee61dc2637ced21d5048e0e1d151fe218a7a1f758b35bad8","source":{"kind":"arxiv","id":"1310.2350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2350","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2350v1","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2350","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"pith_short_12","alias_value":"OKVVR5BMYVO5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OKVVR5BMYVO5P3TB","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OKVVR5BM","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OKVVR5BMYVO5P3TB3QTDPTWSDV","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-09T05:17:16Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"028af83b7c002efc4d7593bda5291519b6e5f2c838c909cedeb3a0bbcfc2a2b4","abstract_canon_sha256":"0ca7fd69d000feaeb87f51246134f277d236c4b82fbbd109c6aa11d6b5ba4448"},"schema_version":"1.0"},"canonical_sha256":"72ab58f42cc55dd7ee61dc2637ced21d5048e0e1d151fe218a7a1f758b35bad8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:12.073082Z","signature_b64":"hw6K+BbCD0hdA+0ZDUJJ8ivRlLXmXsS0z2KvOpxQhRK6PfQ/KQZ5z6DJsbhSfukKg1KjNOmV7rPBfEuOk2kyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ab58f42cc55dd7ee61dc2637ced21d5048e0e1d151fe218a7a1f758b35bad8","last_reissued_at":"2026-05-18T00:38:12.072465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:12.072465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2350","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6uNORL1IXJhIn62zQID76MqXH/sM4fjEdEOs8CyDL3NhlK3QXyNn5O2/ygq2T9q+W4gwRH8xhjsQIPQz2xJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:20:55.158422Z"},"content_sha256":"12c2a214b9515664fce21631b489b0a933735f9dff251559ad007a6d237ae6bd","schema_version":"1.0","event_id":"sha256:12c2a214b9515664fce21631b489b0a933735f9dff251559ad007a6d237ae6bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OKVVR5BMYVO5P3TB3QTDPTWSDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Generalized Traveling Salesman Problem solved with Ant Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Camelia Chira, Camelia-M. Pintea, Petrica C. Pop","submitted_at":"2013-10-09T05:17:16Z","abstract_excerpt":"A well known N P-hard problem called the Generalized Traveling Salesman Problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters. The objective is to find a minimum cost tour passing through exactly one node from each cluster. An exact exponential time algorithm and an effective meta-heuristic algorithm for the problem are presented. The meta-heuristic proposed is a modified Ant Colony System (ACS) algorithm called Reinforcing Ant Colony System (RACS) which introduces new correction rules in the ACS algorithm. Computational results are report"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2350","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kP+sMxTNEW3Vn1MAHGmJmthL1fWkMgllzAcJDpxeJYlMovcd5i+kp3fgKgCXtv6Jv/9AZ32835NpNC4zJxcQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:20:55.158765Z"},"content_sha256":"cb6718222c183f72fae884427549acea283c5587b6eba96214f32bf208a1b9f4","schema_version":"1.0","event_id":"sha256:cb6718222c183f72fae884427549acea283c5587b6eba96214f32bf208a1b9f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKVVR5BMYVO5P3TB3QTDPTWSDV/bundle.json","state_url":"https://pith.science/pith/OKVVR5BMYVO5P3TB3QTDPTWSDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKVVR5BMYVO5P3TB3QTDPTWSDV/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-24T21:20:55Z","links":{"resolver":"https://pith.science/pith/OKVVR5BMYVO5P3TB3QTDPTWSDV","bundle":"https://pith.science/pith/OKVVR5BMYVO5P3TB3QTDPTWSDV/bundle.json","state":"https://pith.science/pith/OKVVR5BMYVO5P3TB3QTDPTWSDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKVVR5BMYVO5P3TB3QTDPTWSDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OKVVR5BMYVO5P3TB3QTDPTWSDV","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":"0ca7fd69d000feaeb87f51246134f277d236c4b82fbbd109c6aa11d6b5ba4448","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-09T05:17:16Z","title_canon_sha256":"028af83b7c002efc4d7593bda5291519b6e5f2c838c909cedeb3a0bbcfc2a2b4"},"schema_version":"1.0","source":{"id":"1310.2350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2350","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2350v1","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2350","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"pith_short_12","alias_value":"OKVVR5BMYVO5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OKVVR5BMYVO5P3TB","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OKVVR5BM","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:cb6718222c183f72fae884427549acea283c5587b6eba96214f32bf208a1b9f4","target":"graph","created_at":"2026-05-18T00:38:12Z","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":"A well known N P-hard problem called the Generalized Traveling Salesman Problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters. The objective is to find a minimum cost tour passing through exactly one node from each cluster. An exact exponential time algorithm and an effective meta-heuristic algorithm for the problem are presented. The meta-heuristic proposed is a modified Ant Colony System (ACS) algorithm called Reinforcing Ant Colony System (RACS) which introduces new correction rules in the ACS algorithm. Computational results are report","authors_text":"Camelia Chira, Camelia-M. Pintea, Petrica C. Pop","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-09T05:17:16Z","title":"The Generalized Traveling Salesman Problem solved with Ant Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2350","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:12c2a214b9515664fce21631b489b0a933735f9dff251559ad007a6d237ae6bd","target":"record","created_at":"2026-05-18T00:38:12Z","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":"0ca7fd69d000feaeb87f51246134f277d236c4b82fbbd109c6aa11d6b5ba4448","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-10-09T05:17:16Z","title_canon_sha256":"028af83b7c002efc4d7593bda5291519b6e5f2c838c909cedeb3a0bbcfc2a2b4"},"schema_version":"1.0","source":{"id":"1310.2350","kind":"arxiv","version":1}},"canonical_sha256":"72ab58f42cc55dd7ee61dc2637ced21d5048e0e1d151fe218a7a1f758b35bad8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72ab58f42cc55dd7ee61dc2637ced21d5048e0e1d151fe218a7a1f758b35bad8","first_computed_at":"2026-05-18T00:38:12.072465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:12.072465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hw6K+BbCD0hdA+0ZDUJJ8ivRlLXmXsS0z2KvOpxQhRK6PfQ/KQZ5z6DJsbhSfukKg1KjNOmV7rPBfEuOk2kyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:12.073082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12c2a214b9515664fce21631b489b0a933735f9dff251559ad007a6d237ae6bd","sha256:cb6718222c183f72fae884427549acea283c5587b6eba96214f32bf208a1b9f4"],"state_sha256":"2db285e8de7d7a14a04f7327aebb72dd582d2790387d4aac648a0bfab63335c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYRP0DpxYLDDET9JygR3uZCUpO0+KkEqhsTZRIqC7jLQlgT3SvlVS5DGu3AK3r+DXmsNXd1I8kdOz3HF/pnVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:20:55.160711Z","bundle_sha256":"1990c8d9b82eeae66c71dfba713ce5f104d9cc0fe60dee3fbe8d0998404940b5"}}