{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BFEXCWBKL544ELMHS5XKFS5WJI","short_pith_number":"pith:BFEXCWBK","canonical_record":{"source":{"id":"1607.07472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-25T20:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"615fbca2ad392b439b6a433987a5ab4cba47b9c8189cab273c0fa037ad228ef9","abstract_canon_sha256":"00d45e890c1148cacc318c73efef2b2af18b90a1dcf321ca2a8d64b8d6af64ee"},"schema_version":"1.0"},"canonical_sha256":"094971582a5f79c22d87976ea2cbb64a0ef7f16acf49a57db7150f4c1a36071c","source":{"kind":"arxiv","id":"1607.07472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07472","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07472v1","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07472","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"pith_short_12","alias_value":"BFEXCWBKL544","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BFEXCWBKL544ELMH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BFEXCWBK","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BFEXCWBKL544ELMHS5XKFS5WJI","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-25T20:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"615fbca2ad392b439b6a433987a5ab4cba47b9c8189cab273c0fa037ad228ef9","abstract_canon_sha256":"00d45e890c1148cacc318c73efef2b2af18b90a1dcf321ca2a8d64b8d6af64ee"},"schema_version":"1.0"},"canonical_sha256":"094971582a5f79c22d87976ea2cbb64a0ef7f16acf49a57db7150f4c1a36071c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:37.665651Z","signature_b64":"XRvMpnh6kBmiR3hqibZluOASGsg2+uPdzyuYLQ/dTswlNYwALzFY9unaUDPwSEPgXIX4w/JLxqBjrdM+K8B0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"094971582a5f79c22d87976ea2cbb64a0ef7f16acf49a57db7150f4c1a36071c","last_reissued_at":"2026-05-18T01:03:37.665083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:37.665083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07472","source_version":1,"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-05-18T01:03:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYW7ps9rpaGweIb7SP0xVFNih2YXJI7qc2kI9dk7sXlceP4vTcLL6QkgwR+4rSFvOdf8kkmdTz/+hZW+X9p8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:26:09.383480Z"},"content_sha256":"e6758723f857321ffde4ae0596035d251b2e4c1f87bb6239213f8d1756671ac1","schema_version":"1.0","event_id":"sha256:e6758723f857321ffde4ae0596035d251b2e4c1f87bb6239213f8d1756671ac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BFEXCWBKL544ELMHS5XKFS5WJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Multi-Agent Global Navigation Using Interpolating Bridges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dinesh Manocha, Jia Pan, Liang He","submitted_at":"2016-07-25T20:50:47Z","abstract_excerpt":"We present a novel approach for collision-free global navigation for continuous-time multi-agent systems with general linear dynamics. Our approach is general and can be used to perform collision-free navigation in 2D and 3D workspaces with narrow passages and crowded regions. As part of pre-computation, we compute multiple bridges in the narrow or tight regions in the workspace using kinodynamic RRT algorithms. Our bridge has certain geometric characteristics, that en- able us to calculate a collision-free trajectory for each agent using simple interpolation at runtime. Moreover, we combine i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07472","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"},"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-05-18T01:03:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZatoCyIMFWc+ANVf77QClhrewq9yiXfn8DIAPu9Iw5kYY+cfQKxlB7eOXtIun4gEtz+BkD/Gsb9SBpr+bi+WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:26:09.383840Z"},"content_sha256":"a5d05981901a17327069155114897bba30f95316c5218dd4bd3355e05c148244","schema_version":"1.0","event_id":"sha256:a5d05981901a17327069155114897bba30f95316c5218dd4bd3355e05c148244"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/bundle.json","state_url":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFEXCWBKL544ELMHS5XKFS5WJI/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-05-21T17:26:09Z","links":{"resolver":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI","bundle":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/bundle.json","state":"https://pith.science/pith/BFEXCWBKL544ELMHS5XKFS5WJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFEXCWBKL544ELMHS5XKFS5WJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BFEXCWBKL544ELMHS5XKFS5WJI","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":"00d45e890c1148cacc318c73efef2b2af18b90a1dcf321ca2a8d64b8d6af64ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-25T20:50:47Z","title_canon_sha256":"615fbca2ad392b439b6a433987a5ab4cba47b9c8189cab273c0fa037ad228ef9"},"schema_version":"1.0","source":{"id":"1607.07472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07472","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07472v1","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07472","created_at":"2026-05-18T01:03:37Z"},{"alias_kind":"pith_short_12","alias_value":"BFEXCWBKL544","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BFEXCWBKL544ELMH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BFEXCWBK","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:a5d05981901a17327069155114897bba30f95316c5218dd4bd3355e05c148244","target":"graph","created_at":"2026-05-18T01:03:37Z","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"},"paper":{"abstract_excerpt":"We present a novel approach for collision-free global navigation for continuous-time multi-agent systems with general linear dynamics. Our approach is general and can be used to perform collision-free navigation in 2D and 3D workspaces with narrow passages and crowded regions. As part of pre-computation, we compute multiple bridges in the narrow or tight regions in the workspace using kinodynamic RRT algorithms. Our bridge has certain geometric characteristics, that en- able us to calculate a collision-free trajectory for each agent using simple interpolation at runtime. Moreover, we combine i","authors_text":"Dinesh Manocha, Jia Pan, Liang He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-25T20:50:47Z","title":"Efficient Multi-Agent Global Navigation Using Interpolating Bridges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07472","kind":"arxiv","version":1},"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:e6758723f857321ffde4ae0596035d251b2e4c1f87bb6239213f8d1756671ac1","target":"record","created_at":"2026-05-18T01:03:37Z","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":"00d45e890c1148cacc318c73efef2b2af18b90a1dcf321ca2a8d64b8d6af64ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-25T20:50:47Z","title_canon_sha256":"615fbca2ad392b439b6a433987a5ab4cba47b9c8189cab273c0fa037ad228ef9"},"schema_version":"1.0","source":{"id":"1607.07472","kind":"arxiv","version":1}},"canonical_sha256":"094971582a5f79c22d87976ea2cbb64a0ef7f16acf49a57db7150f4c1a36071c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"094971582a5f79c22d87976ea2cbb64a0ef7f16acf49a57db7150f4c1a36071c","first_computed_at":"2026-05-18T01:03:37.665083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:37.665083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XRvMpnh6kBmiR3hqibZluOASGsg2+uPdzyuYLQ/dTswlNYwALzFY9unaUDPwSEPgXIX4w/JLxqBjrdM+K8B0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:37.665651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6758723f857321ffde4ae0596035d251b2e4c1f87bb6239213f8d1756671ac1","sha256:a5d05981901a17327069155114897bba30f95316c5218dd4bd3355e05c148244"],"state_sha256":"8c657b1b3e025c5e4a42596a9a7d1d215e905e70e3097cdc7e5ed4a1fab7fd38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqiqrPAZOspXiccYC7uY9puDUqYiGgqgKoVAIEwQr1wQxLIagfQrVDsmWQMCRpHo3ICxaYFXaWZyIJIjYAjQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T17:26:09.386119Z","bundle_sha256":"76a0fefedd5ad9cff1fb4aa43bf27e1309331d03165a67bb8004ca6a5a45ad36"}}