{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GJ3HHGBSXXNPCIDAIDBJHEZGGO","short_pith_number":"pith:GJ3HHGBS","canonical_record":{"source":{"id":"1902.05107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-13T20:09:35Z","cross_cats_sorted":[],"title_canon_sha256":"fc8dc49cfa3d6c9bb77c143c86c1dbf254a248eb1ad85adb93521e1225941f0a","abstract_canon_sha256":"4c6e46ddf6d20501ad7cc1911b373d8779a81b8e3320fc1ef2fca007882bdf97"},"schema_version":"1.0"},"canonical_sha256":"3276739832bddaf1206040c29393263387a46684a330f751e0f50865ba189f52","source":{"kind":"arxiv","id":"1902.05107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05107","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05107v1","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05107","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"pith_short_12","alias_value":"GJ3HHGBSXXNP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJ3HHGBSXXNPCIDA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJ3HHGBS","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GJ3HHGBSXXNPCIDAIDBJHEZGGO","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-13T20:09:35Z","cross_cats_sorted":[],"title_canon_sha256":"fc8dc49cfa3d6c9bb77c143c86c1dbf254a248eb1ad85adb93521e1225941f0a","abstract_canon_sha256":"4c6e46ddf6d20501ad7cc1911b373d8779a81b8e3320fc1ef2fca007882bdf97"},"schema_version":"1.0"},"canonical_sha256":"3276739832bddaf1206040c29393263387a46684a330f751e0f50865ba189f52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:01.924942Z","signature_b64":"NaaN2N4j9HBDhFSct1MxjpCxdQgiOEVaiZhSp8TShZL3+M9x9BGeD3AEZhmXHm2+ZKbcERU0Dup4UpI7mpyODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3276739832bddaf1206040c29393263387a46684a330f751e0f50865ba189f52","last_reissued_at":"2026-05-17T23:54:01.924329Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:01.924329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05107","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-17T23:54:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MwmYyiTxObDl1upSlbVmFEDq9vE+1UHqhG8ijRNq1QPvKdSP8VMplOKUDDlIY7+EQrF/JJSZeabsCPvx2wwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:55:37.584791Z"},"content_sha256":"7e381635310050484d11bcee1e83d1629579578f8c296a8de1f246540c04a023","schema_version":"1.0","event_id":"sha256:7e381635310050484d11bcee1e83d1629579578f8c296a8de1f246540c04a023"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GJ3HHGBSXXNPCIDAIDBJHEZGGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A framework for synchronizing a team of aerial robots in communication-limited environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"A. Ollero, I. Maza, J.M. D\\'iaz-B\\'a\\~nez, L.E. Caraballo, M.A. Lopez, S. Bereg","submitted_at":"2019-02-13T20:09:35Z","abstract_excerpt":"This paper addresses a synchronization problem that arises when a team of aerial robots (ARs) need to communicate while performing assigned tasks in a cooperative scenario. Each robot has a limited communication range and flies within a previously assigned closed trajectory. When two robots are close enough, a communication link may be established, allowing the robots to exchange information. The goal is to schedule the flights such that the entire system can be synchronized for maximum information exchange, that is, every pair of neighbors always visit the feasible communication link at the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05107","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-17T23:54:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3m74t4mI22BaP72HXPufSeDtHTbmppZKJUBjO63seXyazigmoT2Ky0495L7bGszax7J6+J+75sm+Ip/Z8cGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:55:37.585387Z"},"content_sha256":"cd07f670a7e675e1e17443d214dd4da0942a5493d53b432ad2e00c05815932c3","schema_version":"1.0","event_id":"sha256:cd07f670a7e675e1e17443d214dd4da0942a5493d53b432ad2e00c05815932c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJ3HHGBSXXNPCIDAIDBJHEZGGO/bundle.json","state_url":"https://pith.science/pith/GJ3HHGBSXXNPCIDAIDBJHEZGGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJ3HHGBSXXNPCIDAIDBJHEZGGO/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-06-05T12:55:37Z","links":{"resolver":"https://pith.science/pith/GJ3HHGBSXXNPCIDAIDBJHEZGGO","bundle":"https://pith.science/pith/GJ3HHGBSXXNPCIDAIDBJHEZGGO/bundle.json","state":"https://pith.science/pith/GJ3HHGBSXXNPCIDAIDBJHEZGGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJ3HHGBSXXNPCIDAIDBJHEZGGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GJ3HHGBSXXNPCIDAIDBJHEZGGO","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":"4c6e46ddf6d20501ad7cc1911b373d8779a81b8e3320fc1ef2fca007882bdf97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-13T20:09:35Z","title_canon_sha256":"fc8dc49cfa3d6c9bb77c143c86c1dbf254a248eb1ad85adb93521e1225941f0a"},"schema_version":"1.0","source":{"id":"1902.05107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05107","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05107v1","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05107","created_at":"2026-05-17T23:54:01Z"},{"alias_kind":"pith_short_12","alias_value":"GJ3HHGBSXXNP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJ3HHGBSXXNPCIDA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJ3HHGBS","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:cd07f670a7e675e1e17443d214dd4da0942a5493d53b432ad2e00c05815932c3","target":"graph","created_at":"2026-05-17T23:54:01Z","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":"This paper addresses a synchronization problem that arises when a team of aerial robots (ARs) need to communicate while performing assigned tasks in a cooperative scenario. Each robot has a limited communication range and flies within a previously assigned closed trajectory. When two robots are close enough, a communication link may be established, allowing the robots to exchange information. The goal is to schedule the flights such that the entire system can be synchronized for maximum information exchange, that is, every pair of neighbors always visit the feasible communication link at the s","authors_text":"A. Ollero, I. Maza, J.M. D\\'iaz-B\\'a\\~nez, L.E. Caraballo, M.A. Lopez, S. Bereg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-13T20:09:35Z","title":"A framework for synchronizing a team of aerial robots in communication-limited environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05107","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:7e381635310050484d11bcee1e83d1629579578f8c296a8de1f246540c04a023","target":"record","created_at":"2026-05-17T23:54:01Z","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":"4c6e46ddf6d20501ad7cc1911b373d8779a81b8e3320fc1ef2fca007882bdf97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-13T20:09:35Z","title_canon_sha256":"fc8dc49cfa3d6c9bb77c143c86c1dbf254a248eb1ad85adb93521e1225941f0a"},"schema_version":"1.0","source":{"id":"1902.05107","kind":"arxiv","version":1}},"canonical_sha256":"3276739832bddaf1206040c29393263387a46684a330f751e0f50865ba189f52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3276739832bddaf1206040c29393263387a46684a330f751e0f50865ba189f52","first_computed_at":"2026-05-17T23:54:01.924329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:01.924329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NaaN2N4j9HBDhFSct1MxjpCxdQgiOEVaiZhSp8TShZL3+M9x9BGeD3AEZhmXHm2+ZKbcERU0Dup4UpI7mpyODQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:01.924942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e381635310050484d11bcee1e83d1629579578f8c296a8de1f246540c04a023","sha256:cd07f670a7e675e1e17443d214dd4da0942a5493d53b432ad2e00c05815932c3"],"state_sha256":"b0593c7517ec83ef3e18cdc3670f1ba7aa1153eeae3cb4c51d28a875390c8acf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+fkoY1P44v44MRFifHgEocjM/2NqR8c2KhJILOWRu3/PWwS/heuWNq9lPGXo15x/3CL4i0L9J1pK0QPN+zIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:55:37.588157Z","bundle_sha256":"24a0322b0cfd5781d7582256bb9468f3a4542405ba44b3ff387e18cd1e27e3bb"}}