{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ELVNTWDLA2NWO7ITI6QOQF2FCJ","short_pith_number":"pith:ELVNTWDL","schema_version":"1.0","canonical_sha256":"22ead9d86b069b677d1347a0e8174512476dc3235f8116ad6e2ce62208bc0455","source":{"kind":"arxiv","id":"1108.1561","version":1},"attestation_state":"computed","paper":{"title":"k-Capture in Multiagent Pursuit Evasion, or the Lion and the Hyenas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shaunak D. Bopardikar, Subhash Suri","submitted_at":"2011-08-07T18:14:40Z","abstract_excerpt":"We consider the following generalization of the classical pursuit-evasion problem, which we call k-capture. A group of n pursuers (hyenas) wish to capture an evader (lion) who is free to move in an m-dimensional Euclidean space, the pursuers and the evader can move with the same maximum speed, and at least k pursuers must simultaneously reach the evader's location to capture it. If fewer than k pursuers reach the evader, then those pursuers get destroyed by the evader. Under what conditions can the evader be k-captured? We study this problem in the discrete time, continuous space model and pro"},"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":"1108.1561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-08-07T18:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"563809a6365fd9712061eb74052881ed1f794d9fcc548edc272a6303d0207a54","abstract_canon_sha256":"f921d7b237e6ab9cf970a0db96cd48d42425338b849704ae53ae3c483a151cdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:00.725824Z","signature_b64":"wLT4WAvCb8B+QMY7M76aR3onuLm8DKDEzvdI3V1aD6xVUVk0m4xerX7P7HJs6KTdvLGs2Peiz1yB+am8ntbzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22ead9d86b069b677d1347a0e8174512476dc3235f8116ad6e2ce62208bc0455","last_reissued_at":"2026-05-18T04:16:00.725233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:00.725233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-Capture in Multiagent Pursuit Evasion, or the Lion and the Hyenas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shaunak D. Bopardikar, Subhash Suri","submitted_at":"2011-08-07T18:14:40Z","abstract_excerpt":"We consider the following generalization of the classical pursuit-evasion problem, which we call k-capture. A group of n pursuers (hyenas) wish to capture an evader (lion) who is free to move in an m-dimensional Euclidean space, the pursuers and the evader can move with the same maximum speed, and at least k pursuers must simultaneously reach the evader's location to capture it. If fewer than k pursuers reach the evader, then those pursuers get destroyed by the evader. Under what conditions can the evader be k-captured? We study this problem in the discrete time, continuous space model and pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1561","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":"1108.1561","created_at":"2026-05-18T04:16:00.725330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1561v1","created_at":"2026-05-18T04:16:00.725330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1561","created_at":"2026-05-18T04:16:00.725330+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELVNTWDLA2NW","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELVNTWDLA2NWO7IT","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELVNTWDL","created_at":"2026-05-18T12:26:28.662955+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/ELVNTWDLA2NWO7ITI6QOQF2FCJ","json":"https://pith.science/pith/ELVNTWDLA2NWO7ITI6QOQF2FCJ.json","graph_json":"https://pith.science/api/pith-number/ELVNTWDLA2NWO7ITI6QOQF2FCJ/graph.json","events_json":"https://pith.science/api/pith-number/ELVNTWDLA2NWO7ITI6QOQF2FCJ/events.json","paper":"https://pith.science/paper/ELVNTWDL"},"agent_actions":{"view_html":"https://pith.science/pith/ELVNTWDLA2NWO7ITI6QOQF2FCJ","download_json":"https://pith.science/pith/ELVNTWDLA2NWO7ITI6QOQF2FCJ.json","view_paper":"https://pith.science/paper/ELVNTWDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1561&json=true","fetch_graph":"https://pith.science/api/pith-number/ELVNTWDLA2NWO7ITI6QOQF2FCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ELVNTWDLA2NWO7ITI6QOQF2FCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELVNTWDLA2NWO7ITI6QOQF2FCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELVNTWDLA2NWO7ITI6QOQF2FCJ/action/storage_attestation","attest_author":"https://pith.science/pith/ELVNTWDLA2NWO7ITI6QOQF2FCJ/action/author_attestation","sign_citation":"https://pith.science/pith/ELVNTWDLA2NWO7ITI6QOQF2FCJ/action/citation_signature","submit_replication":"https://pith.science/pith/ELVNTWDLA2NWO7ITI6QOQF2FCJ/action/replication_record"}},"created_at":"2026-05-18T04:16:00.725330+00:00","updated_at":"2026-05-18T04:16:00.725330+00:00"}