{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:T57GUWEDUDGVNP2G5UZZ7WNDIT","short_pith_number":"pith:T57GUWED","schema_version":"1.0","canonical_sha256":"9f7e6a5883a0cd56bf46ed339fd9a344fe5da6b6eb50267aafea53440aa72380","source":{"kind":"arxiv","id":"2011.11247","version":1},"attestation_state":"computed","paper":{"title":"Restricted Airspace Protection using Multi-UAV Spatio-TemporalMulti-Task Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Shridhar Velhal, Suresh Sundaram","submitted_at":"2020-11-23T07:13:42Z","abstract_excerpt":"This paper addresses the problem of restricted airspace protection from invaders using the cooperative multi-UAV system. The objective is to detect and capture the invaders cooperatively by a team of homogeneous UAVs (called evaders)before invaders enter the restricted airspace. The problem of restricted airspace protection problem is formulated as a Multi-UAV Spatio-Temporal Multi-Task Allocation problem and is referred as MUST-MTA. The MUST-MTA problem is solved using a modified consensus-based bundled auction method. Here, the spatial and time constraints are handled by combining both spati"},"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":"2011.11247","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2020-11-23T07:13:42Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"bcd2bb696d76860e06dbffc9de97b8f03e9a3a2f701b12455cde7f24279cb944","abstract_canon_sha256":"c8bfedd524ed765bad24bd7ce55706d8e396cd6d1aa36154097091a3222ae305"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:40.890761Z","signature_b64":"UUBVIWQLIpx8N5BM7pCGuIIY2NsjvJovu++vxkS20BHMw4Su1WIB+jSenVTeGx6GU51c7kR7kWkBeyp00azhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f7e6a5883a0cd56bf46ed339fd9a344fe5da6b6eb50267aafea53440aa72380","last_reissued_at":"2026-07-05T01:53:40.890424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:40.890424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Restricted Airspace Protection using Multi-UAV Spatio-TemporalMulti-Task Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Shridhar Velhal, Suresh Sundaram","submitted_at":"2020-11-23T07:13:42Z","abstract_excerpt":"This paper addresses the problem of restricted airspace protection from invaders using the cooperative multi-UAV system. The objective is to detect and capture the invaders cooperatively by a team of homogeneous UAVs (called evaders)before invaders enter the restricted airspace. The problem of restricted airspace protection problem is formulated as a Multi-UAV Spatio-Temporal Multi-Task Allocation problem and is referred as MUST-MTA. The MUST-MTA problem is solved using a modified consensus-based bundled auction method. Here, the spatial and time constraints are handled by combining both spati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.11247","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.11247/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.11247","created_at":"2026-07-05T01:53:40.890480+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.11247v1","created_at":"2026-07-05T01:53:40.890480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.11247","created_at":"2026-07-05T01:53:40.890480+00:00"},{"alias_kind":"pith_short_12","alias_value":"T57GUWEDUDGV","created_at":"2026-07-05T01:53:40.890480+00:00"},{"alias_kind":"pith_short_16","alias_value":"T57GUWEDUDGVNP2G","created_at":"2026-07-05T01:53:40.890480+00:00"},{"alias_kind":"pith_short_8","alias_value":"T57GUWED","created_at":"2026-07-05T01:53:40.890480+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/T57GUWEDUDGVNP2G5UZZ7WNDIT","json":"https://pith.science/pith/T57GUWEDUDGVNP2G5UZZ7WNDIT.json","graph_json":"https://pith.science/api/pith-number/T57GUWEDUDGVNP2G5UZZ7WNDIT/graph.json","events_json":"https://pith.science/api/pith-number/T57GUWEDUDGVNP2G5UZZ7WNDIT/events.json","paper":"https://pith.science/paper/T57GUWED"},"agent_actions":{"view_html":"https://pith.science/pith/T57GUWEDUDGVNP2G5UZZ7WNDIT","download_json":"https://pith.science/pith/T57GUWEDUDGVNP2G5UZZ7WNDIT.json","view_paper":"https://pith.science/paper/T57GUWED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.11247&json=true","fetch_graph":"https://pith.science/api/pith-number/T57GUWEDUDGVNP2G5UZZ7WNDIT/graph.json","fetch_events":"https://pith.science/api/pith-number/T57GUWEDUDGVNP2G5UZZ7WNDIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T57GUWEDUDGVNP2G5UZZ7WNDIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T57GUWEDUDGVNP2G5UZZ7WNDIT/action/storage_attestation","attest_author":"https://pith.science/pith/T57GUWEDUDGVNP2G5UZZ7WNDIT/action/author_attestation","sign_citation":"https://pith.science/pith/T57GUWEDUDGVNP2G5UZZ7WNDIT/action/citation_signature","submit_replication":"https://pith.science/pith/T57GUWEDUDGVNP2G5UZZ7WNDIT/action/replication_record"}},"created_at":"2026-07-05T01:53:40.890480+00:00","updated_at":"2026-07-05T01:53:40.890480+00:00"}