{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CDULNBZAGVVUFOTVW2WIB4ALHK","short_pith_number":"pith:CDULNBZA","canonical_record":{"source":{"id":"1412.2114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-01T06:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"8e24e7c7d0de71003c81dc9c3e2d3b35bfc954c99e628fb36df96398cd3aff2a","abstract_canon_sha256":"45b48d7d2e6d69e67eab5230c9d07881bb0418fab7d1e3c0a5be0c8ca540ee89"},"schema_version":"1.0"},"canonical_sha256":"10e8b68720356b42ba75b6ac80f00b3ab25ae3366d75231385e8f6b2b6228946","source":{"kind":"arxiv","id":"1412.2114","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2114","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2114v1","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2114","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"CDULNBZAGVVU","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDULNBZAGVVUFOTV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDULNBZA","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CDULNBZAGVVUFOTVW2WIB4ALHK","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-01T06:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"8e24e7c7d0de71003c81dc9c3e2d3b35bfc954c99e628fb36df96398cd3aff2a","abstract_canon_sha256":"45b48d7d2e6d69e67eab5230c9d07881bb0418fab7d1e3c0a5be0c8ca540ee89"},"schema_version":"1.0"},"canonical_sha256":"10e8b68720356b42ba75b6ac80f00b3ab25ae3366d75231385e8f6b2b6228946","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:46.653574Z","signature_b64":"QcMby0UezqNgEqoltEBf9HkrgoqiOcrKUGfZjlPISRD+AZ9tnbPtsizdMO8oFHN2sQ3uFKEjR1zEpfON5DaoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10e8b68720356b42ba75b6ac80f00b3ab25ae3366d75231385e8f6b2b6228946","last_reissued_at":"2026-05-18T00:17:46.653142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:46.653142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2114","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:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qc+OpUc4f4JJVPGkX4asZzkdCsNWW4DChG2pQNQsqFGzIvEUFqZROIJwOQQlGVLmr+Y5BMTPiEfhgNg0nLEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:35:06.553152Z"},"content_sha256":"53c09ed11fb9f867870e6e9a3601f817bb4ee7ff79455bccdd042b3035827cec","schema_version":"1.0","event_id":"sha256:53c09ed11fb9f867870e6e9a3601f817bb4ee7ff79455bccdd042b3035827cec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CDULNBZAGVVUFOTVW2WIB4ALHK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chases and Escapes, and Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Toru Ohira","submitted_at":"2014-12-01T06:47:28Z","abstract_excerpt":"We propose a new approach for solving combinatorial optimization problem by utilizing the mechanism of chases and escapes, which has a long history in mathematics. In addition to the well-used steepest descent and neighboring search, we perform a chase and escape game on the \"landscape\" of the cost function. We have created a concrete algorithm for the Traveling Salesman Problem. Our preliminary test indicates a possibility that this new fusion of chases and escapes problem into combinatorial optimization search is fruitful."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2114","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:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hCMtWANstWggXGTVWXdU3Stk0zJqtV7awOe5Pocr/cNwnJcTfYbgTiPUgnPdFbhgwzZjh6Dkr+qpFAN8NXFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:35:06.553529Z"},"content_sha256":"ec92bb1d73590826f51d85cc3519a2995c5732d595cc2f966e8c7acc4baa6552","schema_version":"1.0","event_id":"sha256:ec92bb1d73590826f51d85cc3519a2995c5732d595cc2f966e8c7acc4baa6552"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/bundle.json","state_url":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/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-26T13:35:06Z","links":{"resolver":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK","bundle":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/bundle.json","state":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CDULNBZAGVVUFOTVW2WIB4ALHK","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":"45b48d7d2e6d69e67eab5230c9d07881bb0418fab7d1e3c0a5be0c8ca540ee89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-01T06:47:28Z","title_canon_sha256":"8e24e7c7d0de71003c81dc9c3e2d3b35bfc954c99e628fb36df96398cd3aff2a"},"schema_version":"1.0","source":{"id":"1412.2114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2114","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2114v1","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2114","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"CDULNBZAGVVU","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDULNBZAGVVUFOTV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDULNBZA","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:ec92bb1d73590826f51d85cc3519a2995c5732d595cc2f966e8c7acc4baa6552","target":"graph","created_at":"2026-05-18T00:17:46Z","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":"We propose a new approach for solving combinatorial optimization problem by utilizing the mechanism of chases and escapes, which has a long history in mathematics. In addition to the well-used steepest descent and neighboring search, we perform a chase and escape game on the \"landscape\" of the cost function. We have created a concrete algorithm for the Traveling Salesman Problem. Our preliminary test indicates a possibility that this new fusion of chases and escapes problem into combinatorial optimization search is fruitful.","authors_text":"Toru Ohira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-01T06:47:28Z","title":"Chases and Escapes, and Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2114","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:53c09ed11fb9f867870e6e9a3601f817bb4ee7ff79455bccdd042b3035827cec","target":"record","created_at":"2026-05-18T00:17:46Z","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":"45b48d7d2e6d69e67eab5230c9d07881bb0418fab7d1e3c0a5be0c8ca540ee89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-01T06:47:28Z","title_canon_sha256":"8e24e7c7d0de71003c81dc9c3e2d3b35bfc954c99e628fb36df96398cd3aff2a"},"schema_version":"1.0","source":{"id":"1412.2114","kind":"arxiv","version":1}},"canonical_sha256":"10e8b68720356b42ba75b6ac80f00b3ab25ae3366d75231385e8f6b2b6228946","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10e8b68720356b42ba75b6ac80f00b3ab25ae3366d75231385e8f6b2b6228946","first_computed_at":"2026-05-18T00:17:46.653142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:46.653142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QcMby0UezqNgEqoltEBf9HkrgoqiOcrKUGfZjlPISRD+AZ9tnbPtsizdMO8oFHN2sQ3uFKEjR1zEpfON5DaoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:46.653574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53c09ed11fb9f867870e6e9a3601f817bb4ee7ff79455bccdd042b3035827cec","sha256:ec92bb1d73590826f51d85cc3519a2995c5732d595cc2f966e8c7acc4baa6552"],"state_sha256":"8797818aa94f323a3f6a8cded495623a9a262f05928bc8c7547569873dbb3db8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2WiM9W/9BtzROaMuYQ3XbMyxt4w4DxhoCWJkc7DboZ9TwH2Si4GIECMs5O0L6WTN5nfX/cGsgotSUEIMC2lAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:35:06.557170Z","bundle_sha256":"a44d398195662d69d6732ef36addd19fea90d125a9ace615cb25115233b842d0"}}