{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CDULNBZAGVVUFOTVW2WIB4ALHK","short_pith_number":"pith:CDULNBZA","schema_version":"1.0","canonical_sha256":"10e8b68720356b42ba75b6ac80f00b3ab25ae3366d75231385e8f6b2b6228946","source":{"kind":"arxiv","id":"1412.2114","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.2114","created_at":"2026-05-18T00:17:46.653206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2114v1","created_at":"2026-05-18T00:17:46.653206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2114","created_at":"2026-05-18T00:17:46.653206+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDULNBZAGVVU","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDULNBZAGVVUFOTV","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDULNBZA","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK","json":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK.json","graph_json":"https://pith.science/api/pith-number/CDULNBZAGVVUFOTVW2WIB4ALHK/graph.json","events_json":"https://pith.science/api/pith-number/CDULNBZAGVVUFOTVW2WIB4ALHK/events.json","paper":"https://pith.science/paper/CDULNBZA"},"agent_actions":{"view_html":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK","download_json":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK.json","view_paper":"https://pith.science/paper/CDULNBZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2114&json=true","fetch_graph":"https://pith.science/api/pith-number/CDULNBZAGVVUFOTVW2WIB4ALHK/graph.json","fetch_events":"https://pith.science/api/pith-number/CDULNBZAGVVUFOTVW2WIB4ALHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/action/storage_attestation","attest_author":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/action/author_attestation","sign_citation":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/action/citation_signature","submit_replication":"https://pith.science/pith/CDULNBZAGVVUFOTVW2WIB4ALHK/action/replication_record"}},"created_at":"2026-05-18T00:17:46.653206+00:00","updated_at":"2026-05-18T00:17:46.653206+00:00"}