{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Y3XWHK2FRYYQNZEPP6IZJBSRPQ","short_pith_number":"pith:Y3XWHK2F","canonical_record":{"source":{"id":"1905.04771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-12T19:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"4a6dbcc614d299ce0781c1ae2429386366c93cef124f6464238ec3ca9ddc6f8f","abstract_canon_sha256":"52d224e74d9c0ee57c20fccb3a7d9522a9f57fd731443d1e2f915a2e2501bf19"},"schema_version":"1.0"},"canonical_sha256":"c6ef63ab458e3106e48f7f919486517c23277a9f83d083d27ab00d17f8cba55e","source":{"kind":"arxiv","id":"1905.04771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04771","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04771v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04771","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"Y3XWHK2FRYYQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y3XWHK2FRYYQNZEP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y3XWHK2F","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Y3XWHK2FRYYQNZEPP6IZJBSRPQ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-12T19:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"4a6dbcc614d299ce0781c1ae2429386366c93cef124f6464238ec3ca9ddc6f8f","abstract_canon_sha256":"52d224e74d9c0ee57c20fccb3a7d9522a9f57fd731443d1e2f915a2e2501bf19"},"schema_version":"1.0"},"canonical_sha256":"c6ef63ab458e3106e48f7f919486517c23277a9f83d083d27ab00d17f8cba55e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:23.555096Z","signature_b64":"65ZXm6PE86F3C3EK+170PbzRRIHKdJN6Dyj4w0qX/jMFrRxY0nZjNV1moPfN4mTZrvcRTcBcUWPLBs7EDs/7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6ef63ab458e3106e48f7f919486517c23277a9f83d083d27ab00d17f8cba55e","last_reissued_at":"2026-05-17T23:46:23.554368Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:23.554368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04771","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:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30U8L1HKZMJue/HyG3cJZiDxUJXfWRwZnwbZHXMULdezGC3teOiax6u/iXv/dZpH4Q9ZoNaOIO07boPXDOFqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:03:05.756304Z"},"content_sha256":"52675e812ee7b4e962bf6116100ca5a51d4ca0979ce7db6a25ee190fb248dafb","schema_version":"1.0","event_id":"sha256:52675e812ee7b4e962bf6116100ca5a51d4ca0979ce7db6a25ee190fb248dafb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Y3XWHK2FRYYQNZEPP6IZJBSRPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Failure-Tolerant Connectivity Maintenance for Robot Swarms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bram Adams, Giovanni Beltrame, Vivek Shankar Varadharajan","submitted_at":"2019-05-12T19:05:08Z","abstract_excerpt":"Connectivity maintenance plays a key role in achieving a desired global behavior among a swarm of robots. However, connectivity maintenance in realistic environments is hampered by lack of computation resources, low communication bandwidth, robot failures, and unstable links. In this paper, we propose a novel decentralized connectivity-preserving algorithm that can be deployed on top of other behaviors to enforce connectivity constraints. The algorithm takes a set of targets to be reached while keeping a minimum number of redundant links between robots, with the goal of guaranteeing bandwidth "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04771","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:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oh4Ix5Wxh8ZZoo3ONoVgqrXPjX5lKVKgmo5MnJO+mv80DlB0eLc/Y8/E5Xv9tuP24fIwVzhpeRQ7kz0eyYkMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:03:05.756654Z"},"content_sha256":"80c258617f0b22a1d5ff9330d205222155cdd51fc47d043ca3551fd037f5de3b","schema_version":"1.0","event_id":"sha256:80c258617f0b22a1d5ff9330d205222155cdd51fc47d043ca3551fd037f5de3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3XWHK2FRYYQNZEPP6IZJBSRPQ/bundle.json","state_url":"https://pith.science/pith/Y3XWHK2FRYYQNZEPP6IZJBSRPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3XWHK2FRYYQNZEPP6IZJBSRPQ/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-10T20:03:05Z","links":{"resolver":"https://pith.science/pith/Y3XWHK2FRYYQNZEPP6IZJBSRPQ","bundle":"https://pith.science/pith/Y3XWHK2FRYYQNZEPP6IZJBSRPQ/bundle.json","state":"https://pith.science/pith/Y3XWHK2FRYYQNZEPP6IZJBSRPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3XWHK2FRYYQNZEPP6IZJBSRPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Y3XWHK2FRYYQNZEPP6IZJBSRPQ","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":"52d224e74d9c0ee57c20fccb3a7d9522a9f57fd731443d1e2f915a2e2501bf19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-12T19:05:08Z","title_canon_sha256":"4a6dbcc614d299ce0781c1ae2429386366c93cef124f6464238ec3ca9ddc6f8f"},"schema_version":"1.0","source":{"id":"1905.04771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04771","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04771v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04771","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"Y3XWHK2FRYYQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y3XWHK2FRYYQNZEP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y3XWHK2F","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:80c258617f0b22a1d5ff9330d205222155cdd51fc47d043ca3551fd037f5de3b","target":"graph","created_at":"2026-05-17T23:46:23Z","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":"Connectivity maintenance plays a key role in achieving a desired global behavior among a swarm of robots. However, connectivity maintenance in realistic environments is hampered by lack of computation resources, low communication bandwidth, robot failures, and unstable links. In this paper, we propose a novel decentralized connectivity-preserving algorithm that can be deployed on top of other behaviors to enforce connectivity constraints. The algorithm takes a set of targets to be reached while keeping a minimum number of redundant links between robots, with the goal of guaranteeing bandwidth ","authors_text":"Bram Adams, Giovanni Beltrame, Vivek Shankar Varadharajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-12T19:05:08Z","title":"Failure-Tolerant Connectivity Maintenance for Robot Swarms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04771","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:52675e812ee7b4e962bf6116100ca5a51d4ca0979ce7db6a25ee190fb248dafb","target":"record","created_at":"2026-05-17T23:46:23Z","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":"52d224e74d9c0ee57c20fccb3a7d9522a9f57fd731443d1e2f915a2e2501bf19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-12T19:05:08Z","title_canon_sha256":"4a6dbcc614d299ce0781c1ae2429386366c93cef124f6464238ec3ca9ddc6f8f"},"schema_version":"1.0","source":{"id":"1905.04771","kind":"arxiv","version":1}},"canonical_sha256":"c6ef63ab458e3106e48f7f919486517c23277a9f83d083d27ab00d17f8cba55e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6ef63ab458e3106e48f7f919486517c23277a9f83d083d27ab00d17f8cba55e","first_computed_at":"2026-05-17T23:46:23.554368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:23.554368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"65ZXm6PE86F3C3EK+170PbzRRIHKdJN6Dyj4w0qX/jMFrRxY0nZjNV1moPfN4mTZrvcRTcBcUWPLBs7EDs/7Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:23.555096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52675e812ee7b4e962bf6116100ca5a51d4ca0979ce7db6a25ee190fb248dafb","sha256:80c258617f0b22a1d5ff9330d205222155cdd51fc47d043ca3551fd037f5de3b"],"state_sha256":"0c6dfb2adaaee19b948b276f53b255eaf8dcb40e10ec308fe91a6ec7b89b8134"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yWnuvlfxPIvgveCeMlvE9ULzTeOzAy4q1b2ihU6pHLnt6RvjbBDkHObYncpNCS9Hd0yrhYAbuptfXGfn3CnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:03:05.758490Z","bundle_sha256":"353a917a8e4261d55a53a0a0cd88e883e4879141f974b28e2017470e599c4091"}}