{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HWDB2LF6VD6NKMCDZW26NTXSCC","short_pith_number":"pith:HWDB2LF6","canonical_record":{"source":{"id":"2512.08574","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-12-09T13:13:27Z","cross_cats_sorted":[],"title_canon_sha256":"193e8b77c150d657b6973499cc23bff805db7bdda4d2e89aeadd98c7418fecbe","abstract_canon_sha256":"5fedda9a45096fe55ed3dc7fdcca63202fdf5b0aa47ab6dca00372119054870e"},"schema_version":"1.0"},"canonical_sha256":"3d861d2cbea8fcd53043cdb5e6cef2109294ef526cba272b9fee029b2864e3ad","source":{"kind":"arxiv","id":"2512.08574","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08574","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08574v2","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08574","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"pith_short_12","alias_value":"HWDB2LF6VD6N","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"pith_short_16","alias_value":"HWDB2LF6VD6NKMCD","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"pith_short_8","alias_value":"HWDB2LF6","created_at":"2026-07-30T01:19:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HWDB2LF6VD6NKMCDZW26NTXSCC","target":"record","payload":{"canonical_record":{"source":{"id":"2512.08574","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-12-09T13:13:27Z","cross_cats_sorted":[],"title_canon_sha256":"193e8b77c150d657b6973499cc23bff805db7bdda4d2e89aeadd98c7418fecbe","abstract_canon_sha256":"5fedda9a45096fe55ed3dc7fdcca63202fdf5b0aa47ab6dca00372119054870e"},"schema_version":"1.0"},"canonical_sha256":"3d861d2cbea8fcd53043cdb5e6cef2109294ef526cba272b9fee029b2864e3ad","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d861d2cbea8fcd53043cdb5e6cef2109294ef526cba272b9fee029b2864e3ad","last_reissued_at":"2026-07-30T01:19:21.463185Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:19:21.463185Z"},"source_kind":"arxiv","source_id":"2512.08574","source_version":2,"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-07-30T01:19:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pxynwawxDuMev8AwChlw9JMeCTULwmb2/TOHN+gsLmOr++/3B2oH6YKutzCf67XZgD7BEHDTB6To3/1Cx7QiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T17:17:22.066661Z"},"content_sha256":"fa9dfb8cc8a8cd1586bf9fd6525d6c6b304e8ae7d6136bc9b2cb63dcd19708bf","schema_version":"1.0","event_id":"sha256:fa9dfb8cc8a8cd1586bf9fd6525d6c6b304e8ae7d6136bc9b2cb63dcd19708bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HWDB2LF6VD6NKMCDZW26NTXSCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RVC-NMPC: Nonlinear Model Predictive Control with Reciprocal Velocity Constraints for Mutual Collision Avoidance in Agile UAV Flight","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Martin Saska, Ondrej Prochazka, Parakh M. Gupta, Robert Penicka, Vit Kratky","submitted_at":"2025-12-09T13:13:27Z","abstract_excerpt":"This paper presents an approach to mutual collision avoidance based on Nonlinear Model Predictive Control (NMPC) with time-dependent Reciprocal Velocity Constraints (RVCs). Unlike most existing methods, the proposed approach relies solely on observable information about other robots, eliminating the need for excessive communication. The computationally efficient algorithm for computing RVCs, together with the direct integration of these constraints into the NMPC problem formulation at the controller level, allows the whole pipeline to run at 100 Hz. This high processing rate, combined with mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08574","kind":"arxiv","version":2},"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/2512.08574/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"},"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-07-30T01:19:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRKaS/Y/6PR0fKBE0alJLQNvxY4k/WXHNuWnEiXTE/rbCdMjufYPEmN4qa4a9E0pWeWXHPTEwO+vCdzvtu84Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T17:17:22.067285Z"},"content_sha256":"3a04e5621f268101e8037f096c224ba44c13552b7c47f6084dc457346e5409ef","schema_version":"1.0","event_id":"sha256:3a04e5621f268101e8037f096c224ba44c13552b7c47f6084dc457346e5409ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWDB2LF6VD6NKMCDZW26NTXSCC/bundle.json","state_url":"https://pith.science/pith/HWDB2LF6VD6NKMCDZW26NTXSCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWDB2LF6VD6NKMCDZW26NTXSCC/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-08-14T17:17:22Z","links":{"resolver":"https://pith.science/pith/HWDB2LF6VD6NKMCDZW26NTXSCC","bundle":"https://pith.science/pith/HWDB2LF6VD6NKMCDZW26NTXSCC/bundle.json","state":"https://pith.science/pith/HWDB2LF6VD6NKMCDZW26NTXSCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWDB2LF6VD6NKMCDZW26NTXSCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HWDB2LF6VD6NKMCDZW26NTXSCC","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":"5fedda9a45096fe55ed3dc7fdcca63202fdf5b0aa47ab6dca00372119054870e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-12-09T13:13:27Z","title_canon_sha256":"193e8b77c150d657b6973499cc23bff805db7bdda4d2e89aeadd98c7418fecbe"},"schema_version":"1.0","source":{"id":"2512.08574","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08574","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08574v2","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08574","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"pith_short_12","alias_value":"HWDB2LF6VD6N","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"pith_short_16","alias_value":"HWDB2LF6VD6NKMCD","created_at":"2026-07-30T01:19:21Z"},{"alias_kind":"pith_short_8","alias_value":"HWDB2LF6","created_at":"2026-07-30T01:19:21Z"}],"graph_snapshots":[{"event_id":"sha256:3a04e5621f268101e8037f096c224ba44c13552b7c47f6084dc457346e5409ef","target":"graph","created_at":"2026-07-30T01:19:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.08574/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents an approach to mutual collision avoidance based on Nonlinear Model Predictive Control (NMPC) with time-dependent Reciprocal Velocity Constraints (RVCs). Unlike most existing methods, the proposed approach relies solely on observable information about other robots, eliminating the need for excessive communication. The computationally efficient algorithm for computing RVCs, together with the direct integration of these constraints into the NMPC problem formulation at the controller level, allows the whole pipeline to run at 100 Hz. This high processing rate, combined with mod","authors_text":"Martin Saska, Ondrej Prochazka, Parakh M. Gupta, Robert Penicka, Vit Kratky","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-12-09T13:13:27Z","title":"RVC-NMPC: Nonlinear Model Predictive Control with Reciprocal Velocity Constraints for Mutual Collision Avoidance in Agile UAV Flight"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08574","kind":"arxiv","version":2},"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:fa9dfb8cc8a8cd1586bf9fd6525d6c6b304e8ae7d6136bc9b2cb63dcd19708bf","target":"record","created_at":"2026-07-30T01:19:21Z","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":"5fedda9a45096fe55ed3dc7fdcca63202fdf5b0aa47ab6dca00372119054870e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-12-09T13:13:27Z","title_canon_sha256":"193e8b77c150d657b6973499cc23bff805db7bdda4d2e89aeadd98c7418fecbe"},"schema_version":"1.0","source":{"id":"2512.08574","kind":"arxiv","version":2}},"canonical_sha256":"3d861d2cbea8fcd53043cdb5e6cef2109294ef526cba272b9fee029b2864e3ad","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d861d2cbea8fcd53043cdb5e6cef2109294ef526cba272b9fee029b2864e3ad","first_computed_at":"2026-07-30T01:19:21.463185Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:19:21.463185Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2512.08574","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa9dfb8cc8a8cd1586bf9fd6525d6c6b304e8ae7d6136bc9b2cb63dcd19708bf","sha256:3a04e5621f268101e8037f096c224ba44c13552b7c47f6084dc457346e5409ef"],"state_sha256":"81e3eb5cd095faa13b184d7a60a9fc177412685d841d04d552f7c8da7ceebf97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3jhqgY6lt4WhWpUU9spHjgkx8St1rxG4g1mHQoPlA5r+MUNXZ4T9Ut9BzKd2+cA1umroMP2K2qo3wje1mcOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T17:17:22.098122Z","bundle_sha256":"fa8e64bc748f046fff872057c77cf05189cf21b3fa23bff7a520aef63bad7a49"}}