{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W655YB3GUHNSPISNMF36CON4MJ","short_pith_number":"pith:W655YB3G","canonical_record":{"source":{"id":"1611.04156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T16:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"ed3ea12a180defcc7fc6b9ce0ee0f3ea7bba4e739115d9c9ff05b89e1dbbd6ce","abstract_canon_sha256":"031a374081d542ec6e581b613654653149605af07b8055c3748bf5e6ebdeaba6"},"schema_version":"1.0"},"canonical_sha256":"b7bbdc0766a1db27a24d6177e139bc625dc82003d007dafc7f5f6e4b72c62622","source":{"kind":"arxiv","id":"1611.04156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04156","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04156v1","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04156","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"W655YB3GUHNS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W655YB3GUHNSPISN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W655YB3G","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W655YB3GUHNSPISNMF36CON4MJ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T16:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"ed3ea12a180defcc7fc6b9ce0ee0f3ea7bba4e739115d9c9ff05b89e1dbbd6ce","abstract_canon_sha256":"031a374081d542ec6e581b613654653149605af07b8055c3748bf5e6ebdeaba6"},"schema_version":"1.0"},"canonical_sha256":"b7bbdc0766a1db27a24d6177e139bc625dc82003d007dafc7f5f6e4b72c62622","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:17.325681Z","signature_b64":"0AalujYn9gYUCMp51foY76jgILtOxBFQZV80w5wAxEuwhM52RPXKCAjnEDL2RUClPMV/tEi7ZYz7e3e37vSTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7bbdc0766a1db27a24d6177e139bc625dc82003d007dafc7f5f6e4b72c62622","last_reissued_at":"2026-05-18T00:59:17.324921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:17.324921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04156","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:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FcL/963K4drtZlsEPjlCiWpFa5x0XZAEtaZVEsfE2Su5kAf8V8vR8dvmXpQVKz2/5W9b/Jz4/hl/AO+VeFrmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:12:03.033761Z"},"content_sha256":"3596372a39bb01087b4900a6077135a7ccc8f8deced1c7552504ee100c80acbe","schema_version":"1.0","event_id":"sha256:3596372a39bb01087b4900a6077135a7ccc8f8deced1c7552504ee100c80acbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W655YB3GUHNSPISNMF36CON4MJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planning system for deliveries in Medell\\'in","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Catalina Pati\\~no-Forero, Mateo Agudelo-Toro, Mauricio Toro","submitted_at":"2016-11-13T16:51:51Z","abstract_excerpt":"Here we present the implementation of an application capable of planning the shortest delivery route in the city of Medell\\'in, Colombia. We discuss the different approaches to this problem which is similar to the famous Traveling Salesman Problem (TSP), but differs in the fact that, in our problem, we can visit each place (or vertex) more than once. Solving this problem is important since it would help people, especially stores with delivering services, to save time and money spent in fuel, because they can plan any route in an efficient way."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04156","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:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAlMCJ1MVHEnq6s4jN1K0yaZLYvvs9FXY9Z9gqO4eudNQj7NgcFRYwwCQByhLuyn/qWVCDMCV9EHSRNLO0NuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:12:03.034430Z"},"content_sha256":"2629f6582acefa43e29ab6b5a0f8e825085048b9f55c24767817e80367f101f8","schema_version":"1.0","event_id":"sha256:2629f6582acefa43e29ab6b5a0f8e825085048b9f55c24767817e80367f101f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W655YB3GUHNSPISNMF36CON4MJ/bundle.json","state_url":"https://pith.science/pith/W655YB3GUHNSPISNMF36CON4MJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W655YB3GUHNSPISNMF36CON4MJ/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-31T19:12:03Z","links":{"resolver":"https://pith.science/pith/W655YB3GUHNSPISNMF36CON4MJ","bundle":"https://pith.science/pith/W655YB3GUHNSPISNMF36CON4MJ/bundle.json","state":"https://pith.science/pith/W655YB3GUHNSPISNMF36CON4MJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W655YB3GUHNSPISNMF36CON4MJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W655YB3GUHNSPISNMF36CON4MJ","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":"031a374081d542ec6e581b613654653149605af07b8055c3748bf5e6ebdeaba6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T16:51:51Z","title_canon_sha256":"ed3ea12a180defcc7fc6b9ce0ee0f3ea7bba4e739115d9c9ff05b89e1dbbd6ce"},"schema_version":"1.0","source":{"id":"1611.04156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04156","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04156v1","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04156","created_at":"2026-05-18T00:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"W655YB3GUHNS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W655YB3GUHNSPISN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W655YB3G","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:2629f6582acefa43e29ab6b5a0f8e825085048b9f55c24767817e80367f101f8","target":"graph","created_at":"2026-05-18T00:59:17Z","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":"Here we present the implementation of an application capable of planning the shortest delivery route in the city of Medell\\'in, Colombia. We discuss the different approaches to this problem which is similar to the famous Traveling Salesman Problem (TSP), but differs in the fact that, in our problem, we can visit each place (or vertex) more than once. Solving this problem is important since it would help people, especially stores with delivering services, to save time and money spent in fuel, because they can plan any route in an efficient way.","authors_text":"Catalina Pati\\~no-Forero, Mateo Agudelo-Toro, Mauricio Toro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T16:51:51Z","title":"Planning system for deliveries in Medell\\'in"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04156","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:3596372a39bb01087b4900a6077135a7ccc8f8deced1c7552504ee100c80acbe","target":"record","created_at":"2026-05-18T00:59:17Z","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":"031a374081d542ec6e581b613654653149605af07b8055c3748bf5e6ebdeaba6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T16:51:51Z","title_canon_sha256":"ed3ea12a180defcc7fc6b9ce0ee0f3ea7bba4e739115d9c9ff05b89e1dbbd6ce"},"schema_version":"1.0","source":{"id":"1611.04156","kind":"arxiv","version":1}},"canonical_sha256":"b7bbdc0766a1db27a24d6177e139bc625dc82003d007dafc7f5f6e4b72c62622","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7bbdc0766a1db27a24d6177e139bc625dc82003d007dafc7f5f6e4b72c62622","first_computed_at":"2026-05-18T00:59:17.324921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:17.324921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0AalujYn9gYUCMp51foY76jgILtOxBFQZV80w5wAxEuwhM52RPXKCAjnEDL2RUClPMV/tEi7ZYz7e3e37vSTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:17.325681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3596372a39bb01087b4900a6077135a7ccc8f8deced1c7552504ee100c80acbe","sha256:2629f6582acefa43e29ab6b5a0f8e825085048b9f55c24767817e80367f101f8"],"state_sha256":"8234cf23617cf54f3f6b42dbd6292a330140d221b8a87a90ca13bac1356ca16a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kZ/4dZjsoSGG7ZbKO56IZ64FCBkd1nlThEGhVzREhxsiQ/Sd9OS+c+km1eOOsXhxIBlTNAbyfky2Fa9/e5QBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:12:03.038558Z","bundle_sha256":"6124a07a952d0bebc1149cf2ec9b638d631d774f5c4ab92239173e453bac12f6"}}