{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:42UIQQWKEU56MOYCGK7F6QRHHH","short_pith_number":"pith:42UIQQWK","canonical_record":{"source":{"id":"2408.05111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-09T15:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"6a053a28f131e293e619ea664e6b6c577ec0661b13c440b03438b573011333bb","abstract_canon_sha256":"d125dc7e18678dec967938e52d19f5b6fa10af0da076c1658b6caf6cc96ae6e3"},"schema_version":"1.0"},"canonical_sha256":"e6a88842ca253be63b0232be5f422739f5cdbc4962af802e6d1dce74cad1b45f","source":{"kind":"arxiv","id":"2408.05111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05111","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05111v1","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05111","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"42UIQQWKEU56","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_16","alias_value":"42UIQQWKEU56MOYC","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_8","alias_value":"42UIQQWK","created_at":"2026-07-05T08:53:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:42UIQQWKEU56MOYCGK7F6QRHHH","target":"record","payload":{"canonical_record":{"source":{"id":"2408.05111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-09T15:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"6a053a28f131e293e619ea664e6b6c577ec0661b13c440b03438b573011333bb","abstract_canon_sha256":"d125dc7e18678dec967938e52d19f5b6fa10af0da076c1658b6caf6cc96ae6e3"},"schema_version":"1.0"},"canonical_sha256":"e6a88842ca253be63b0232be5f422739f5cdbc4962af802e6d1dce74cad1b45f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:56.963007Z","signature_b64":"VKt5lqb/Tx2KXDzpEdJhIKeQ08JCrgHuiNYGjI8m9s1yfO1CfB3pUrncjEj+WtPFi6LgO4oBDMGHJAuvLPpiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6a88842ca253be63b0232be5f422739f5cdbc4962af802e6d1dce74cad1b45f","last_reissued_at":"2026-07-05T08:53:56.962665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:56.962665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.05111","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-07-05T08:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INJkmnzE1HXVoaZbKN+HzBTnq6NB3+4M/SCOVySUFjuWDFI8kaSI3uqA9mzlp4pyHTScpRA1PwUxjVKFuaE4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:40:09.420991Z"},"content_sha256":"2be4151a6b83b5279ca2f3cf889e048c79f596f91f942018155c5081ebd4d8aa","schema_version":"1.0","event_id":"sha256:2be4151a6b83b5279ca2f3cf889e048c79f596f91f942018155c5081ebd4d8aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:42UIQQWKEU56MOYCGK7F6QRHHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Distributed Multi-Robot Communication-Aware Trajectory Planning using Alternating Direction Method of Multipliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jeppe Heini Mikkelsen, Matteo Fumagalli, Roberto Galeazzi","submitted_at":"2024-08-09T15:02:39Z","abstract_excerpt":"This paper presents a distributed, optimal, communication-aware trajectory planning algorithm for multi-robot systems. Building on prior work, it addresses the multi-robot communication-aware trajectory planning problem using a general optimisation framework that imposes linear constraints on changes in robot positions to ensure communication performance and collision avoidance. In this paper, the optimisation problem is solved distributively by separating the communication performance constraint through an economic approach. Here, the current communication budget is distributed equally among "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05111","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/2408.05111/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-05T08:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Pp0r3gsr3XKxFjOhEavwwsUd/+tWfVEuEttGqXaJhUcFPaOxJLsFdlPl9PpKQUeQb4IKU8nWSpKTm9yCq99Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:40:09.421515Z"},"content_sha256":"d37dc83309dabefa9322dfb4c26d3466f9ce9bdac58e6c7ad862dd1198814343","schema_version":"1.0","event_id":"sha256:d37dc83309dabefa9322dfb4c26d3466f9ce9bdac58e6c7ad862dd1198814343"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42UIQQWKEU56MOYCGK7F6QRHHH/bundle.json","state_url":"https://pith.science/pith/42UIQQWKEU56MOYCGK7F6QRHHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42UIQQWKEU56MOYCGK7F6QRHHH/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-04T12:40:09Z","links":{"resolver":"https://pith.science/pith/42UIQQWKEU56MOYCGK7F6QRHHH","bundle":"https://pith.science/pith/42UIQQWKEU56MOYCGK7F6QRHHH/bundle.json","state":"https://pith.science/pith/42UIQQWKEU56MOYCGK7F6QRHHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42UIQQWKEU56MOYCGK7F6QRHHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:42UIQQWKEU56MOYCGK7F6QRHHH","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":"d125dc7e18678dec967938e52d19f5b6fa10af0da076c1658b6caf6cc96ae6e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-09T15:02:39Z","title_canon_sha256":"6a053a28f131e293e619ea664e6b6c577ec0661b13c440b03438b573011333bb"},"schema_version":"1.0","source":{"id":"2408.05111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05111","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05111v1","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05111","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"42UIQQWKEU56","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_16","alias_value":"42UIQQWKEU56MOYC","created_at":"2026-07-05T08:53:56Z"},{"alias_kind":"pith_short_8","alias_value":"42UIQQWK","created_at":"2026-07-05T08:53:56Z"}],"graph_snapshots":[{"event_id":"sha256:d37dc83309dabefa9322dfb4c26d3466f9ce9bdac58e6c7ad862dd1198814343","target":"graph","created_at":"2026-07-05T08:53:56Z","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/2408.05111/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a distributed, optimal, communication-aware trajectory planning algorithm for multi-robot systems. Building on prior work, it addresses the multi-robot communication-aware trajectory planning problem using a general optimisation framework that imposes linear constraints on changes in robot positions to ensure communication performance and collision avoidance. In this paper, the optimisation problem is solved distributively by separating the communication performance constraint through an economic approach. Here, the current communication budget is distributed equally among ","authors_text":"Jeppe Heini Mikkelsen, Matteo Fumagalli, Roberto Galeazzi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-09T15:02:39Z","title":"Optimal Distributed Multi-Robot Communication-Aware Trajectory Planning using Alternating Direction Method of Multipliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05111","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:2be4151a6b83b5279ca2f3cf889e048c79f596f91f942018155c5081ebd4d8aa","target":"record","created_at":"2026-07-05T08:53:56Z","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":"d125dc7e18678dec967938e52d19f5b6fa10af0da076c1658b6caf6cc96ae6e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-09T15:02:39Z","title_canon_sha256":"6a053a28f131e293e619ea664e6b6c577ec0661b13c440b03438b573011333bb"},"schema_version":"1.0","source":{"id":"2408.05111","kind":"arxiv","version":1}},"canonical_sha256":"e6a88842ca253be63b0232be5f422739f5cdbc4962af802e6d1dce74cad1b45f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6a88842ca253be63b0232be5f422739f5cdbc4962af802e6d1dce74cad1b45f","first_computed_at":"2026-07-05T08:53:56.962665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:53:56.962665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VKt5lqb/Tx2KXDzpEdJhIKeQ08JCrgHuiNYGjI8m9s1yfO1CfB3pUrncjEj+WtPFi6LgO4oBDMGHJAuvLPpiBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:53:56.963007Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.05111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2be4151a6b83b5279ca2f3cf889e048c79f596f91f942018155c5081ebd4d8aa","sha256:d37dc83309dabefa9322dfb4c26d3466f9ce9bdac58e6c7ad862dd1198814343"],"state_sha256":"9d39d5ef0e1cd9cf758a04f524266d9076a9bd0d25fc74e3f55e23c024e1e014"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6Yu5t6XtuFbsYm6ClT5iAh8QARPslUDB9mty3Rn972BnNumWMazx48vtLBib6hYyowj67R0ODfmvgLGBjgDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:40:09.426350Z","bundle_sha256":"2e61b3d1a2cbf18cfe248b0641e6052e963895216bfcbae0b0768f3fb98dcf7e"}}