{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HIUEFRC73676NXKSHISK5XLXEQ","short_pith_number":"pith:HIUEFRC7","schema_version":"1.0","canonical_sha256":"3a2842c45fdfbfe6dd523a24aedd772437c970eda0718ebc5a0d427b6faebc31","source":{"kind":"arxiv","id":"2503.10245","version":1},"attestation_state":"computed","paper":{"title":"Reach-Avoid-Stay-Collision-Avoidance Negotiation Framework for Multi-Agent Systems via Spatiotemporal Tubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Mohd. Faizuddin Faruqui, Pushpak Jagtap, Ratnangshu Das, Ravi Kumar L","submitted_at":"2025-03-13T10:45:34Z","abstract_excerpt":"This study presents a multi-agent negotiation-based framework to obtain collision-free paths while performing prescribed-time reach-avoid-stay (RAS) tasks for agents with unknown dynamics and bounded disturbance. By employing spatiotemporal tubes to generate time-varying state constraints, we ensure that all agents adhere to RAS specifications using synthesized controllers. To prevent inter-agent collisions, a negotiation mechanism is proposed where successful negotiations result in spatiotemporal tubes for each agent fulfilling desired tasks. This approach results in a completely distributed,"},"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":"2503.10245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-03-13T10:45:34Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c87d7ddfd8fae13b31bbaec00a920bf67a55993f17f384f2a901cb23fcb1f471","abstract_canon_sha256":"f4bc8ab1a46039a7239ca6a85ccccdeb98dec577b5ea89c7f95f6805a10271ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:41.351183Z","signature_b64":"ceRF06L7GWVIb2PHUMNnLKx3cvfHGa0sa4wJFvSfN+ZVnwu8F+GZQb5WJsHbB6/MKqJM9iqDfb8uMk/cqUgOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a2842c45fdfbfe6dd523a24aedd772437c970eda0718ebc5a0d427b6faebc31","last_reissued_at":"2026-07-05T10:30:41.350190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:41.350190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reach-Avoid-Stay-Collision-Avoidance Negotiation Framework for Multi-Agent Systems via Spatiotemporal Tubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Mohd. Faizuddin Faruqui, Pushpak Jagtap, Ratnangshu Das, Ravi Kumar L","submitted_at":"2025-03-13T10:45:34Z","abstract_excerpt":"This study presents a multi-agent negotiation-based framework to obtain collision-free paths while performing prescribed-time reach-avoid-stay (RAS) tasks for agents with unknown dynamics and bounded disturbance. By employing spatiotemporal tubes to generate time-varying state constraints, we ensure that all agents adhere to RAS specifications using synthesized controllers. To prevent inter-agent collisions, a negotiation mechanism is proposed where successful negotiations result in spatiotemporal tubes for each agent fulfilling desired tasks. This approach results in a completely distributed,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10245","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/2503.10245/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":"2503.10245","created_at":"2026-07-05T10:30:41.350295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10245v1","created_at":"2026-07-05T10:30:41.350295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10245","created_at":"2026-07-05T10:30:41.350295+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIUEFRC73676","created_at":"2026-07-05T10:30:41.350295+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIUEFRC73676NXKS","created_at":"2026-07-05T10:30:41.350295+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIUEFRC7","created_at":"2026-07-05T10:30:41.350295+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13834","citing_title":"Spatiotemporal Tubes for Temporal Reach-Avoid-Stay Tasks in Unknown Systems","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ","json":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ.json","graph_json":"https://pith.science/api/pith-number/HIUEFRC73676NXKSHISK5XLXEQ/graph.json","events_json":"https://pith.science/api/pith-number/HIUEFRC73676NXKSHISK5XLXEQ/events.json","paper":"https://pith.science/paper/HIUEFRC7"},"agent_actions":{"view_html":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ","download_json":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ.json","view_paper":"https://pith.science/paper/HIUEFRC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10245&json=true","fetch_graph":"https://pith.science/api/pith-number/HIUEFRC73676NXKSHISK5XLXEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HIUEFRC73676NXKSHISK5XLXEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ/action/storage_attestation","attest_author":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ/action/author_attestation","sign_citation":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ/action/citation_signature","submit_replication":"https://pith.science/pith/HIUEFRC73676NXKSHISK5XLXEQ/action/replication_record"}},"created_at":"2026-07-05T10:30:41.350295+00:00","updated_at":"2026-07-05T10:30:41.350295+00:00"}