{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IJN6ZU6P7HG4YKW3OA4YK3AQG3","short_pith_number":"pith:IJN6ZU6P","canonical_record":{"source":{"id":"2605.13006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-13T05:00:07Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"48bdb3cf6c5d8e6c86c7db8ebadebcc8c8dfc7745a84d23e5b4eab5daa2dc321","abstract_canon_sha256":"37cf161328dbc85375ddf8b9b5e7e4b0075872e3a5d842ed4d46c1190fd428f2"},"schema_version":"1.0"},"canonical_sha256":"425becd3cff9cdcc2adb7039856c1036d46d5895e731b57f8fddcf39e8de9026","source":{"kind":"arxiv","id":"2605.13006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13006","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13006v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13006","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"IJN6ZU6P7HG4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IJN6ZU6P7HG4YKW3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IJN6ZU6P","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IJN6ZU6P7HG4YKW3OA4YK3AQG3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-13T05:00:07Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"48bdb3cf6c5d8e6c86c7db8ebadebcc8c8dfc7745a84d23e5b4eab5daa2dc321","abstract_canon_sha256":"37cf161328dbc85375ddf8b9b5e7e4b0075872e3a5d842ed4d46c1190fd428f2"},"schema_version":"1.0"},"canonical_sha256":"425becd3cff9cdcc2adb7039856c1036d46d5895e731b57f8fddcf39e8de9026","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:00.320152Z","signature_b64":"vWkH+SnrU7vEGAhlgfcggKL0og9y+qULh8BY5gquyUym/0+oXrk+bf0xuvkAQcppffRBYq3Mf/VwvEZudJ64Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"425becd3cff9cdcc2adb7039856c1036d46d5895e731b57f8fddcf39e8de9026","last_reissued_at":"2026-05-18T03:09:00.319361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:00.319361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13006","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-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"012cCd5ArkZRTyiy0uNQwhoYe66oqFFAOxxH3/V8PBlL9wm9pY9OviCRYI16SWQ8ow2KuWJNpZjRt+VitlLGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:47:51.098658Z"},"content_sha256":"0cc39bb8768ec76d60f4167022d279f3c38bff6e9d0d71d9cc1ba7182f5fe29e","schema_version":"1.0","event_id":"sha256:0cc39bb8768ec76d60f4167022d279f3c38bff6e9d0d71d9cc1ba7182f5fe29e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IJN6ZU6P7HG4YKW3OA4YK3AQG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Occlusion-Based Object Transportation Around Obstacles With a Swarm of Miniature Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Finite-state machines enable swarms to transport objects around blocking obstacles by forming local sub-goal chains without communication.","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Breno Cunha Queiroz, Daniel MacRae","submitted_at":"2026-05-13T05:00:07Z","abstract_excerpt":"Swarm robotics utilises decentralised self-organising systems to form complex collective behaviours built from the bottom-up using individuals that have limited capabilities. Previous work has shown that simple occlusion-based strategies can be effective in using swarm robotics for the task of transporting objects to a goal position. However, this strategy requires a clear line-of-sight between the object and the goal. In this paper, we extend this strategy by allowing robots to form sub-goals; enabling any member of the swarm to establish a wider range of visibility of the goal, ultimately fo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our finite-state machine allows a sufficiently large swarm to transport objects around obstacles that block the goal while preserving the fully decentralised and communication-free nature of the original strategy.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That individual robots can reliably detect occlusion and establish accurate sub-goals using only local sensing, and that the swarm size will always be sufficient to maintain the chain without breaking.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A decentralized swarm of miniature robots can transport objects around obstacles by forming sub-goal chains using occlusion rules and a finite-state machine.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Finite-state machines enable swarms to transport objects around blocking obstacles by forming local sub-goal chains without communication.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"41b09b8eab25fcfa08b2feaaa7b6d5ec70f8010446b9b198e4869208de6077bb"},"source":{"id":"2605.13006","kind":"arxiv","version":1},"verdict":{"id":"a89cef3a-5d97-44d2-a34d-1d95232d4509","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:17:24.353510Z","strongest_claim":"Our finite-state machine allows a sufficiently large swarm to transport objects around obstacles that block the goal while preserving the fully decentralised and communication-free nature of the original strategy.","one_line_summary":"A decentralized swarm of miniature robots can transport objects around obstacles by forming sub-goal chains using occlusion rules and a finite-state machine.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That individual robots can reliably detect occlusion and establish accurate sub-goals using only local sensing, and that the swarm size will always be sufficient to maintain the chain without breaking.","pith_extraction_headline":"Finite-state machines enable swarms to transport objects around blocking obstacles by forming local sub-goal chains without communication."},"references":{"count":55,"sample":[{"doi":"","year":null,"title":"Cooperative object transport with a swarm of e-puck robots: robustness and scalability of evolved collective strategies , volume =","work_id":"1311ae13-9f42-4821-a43b-95c142894bab","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"A review of swarm robotics tasks , volume =","work_id":"77bb9758-a238-4f29-979a-d1bb21f8823d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Experimental Study and Modeling of Group Retrieval in Ants as an Approach to Collective Transport in Swarm Robotic Systems , volume =","work_id":"caf1b5bc-c4c5-4f58-ad66-6334e356c62b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Autonomous transportation and deployment with aerial robots for search and rescue missions , volume =","work_id":"26cc9c90-15de-4c4b-aa8f-03f480213e56","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1995,"title":"A pusher/steerer model for strongly cooperative mobile robot manipulation , volume =","work_id":"88f97ec8-d69d-416a-b50b-15303274420f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":55,"snapshot_sha256":"167862f445327381ee4ce37b4c874042a85e6040450e4a7927743c3c5deaa15a","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"264e4b4cf9d4dc532e407f121287f74dfad3afddac758ebaeccc19c30c5331e7"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a89cef3a-5d97-44d2-a34d-1d95232d4509"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fx+xBhZrLz/mKMG9G7ptGokV4KDlDmGokyjoafCUw5fod4ThbqxIU6IHq9kbLqXvkYlfD3juG3IHlEFH2qzvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:47:51.099188Z"},"content_sha256":"dd41995bdba8f689ba3ca0227e5c82891411b2ffd0ae0e70f40958fb073490a5","schema_version":"1.0","event_id":"sha256:dd41995bdba8f689ba3ca0227e5c82891411b2ffd0ae0e70f40958fb073490a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJN6ZU6P7HG4YKW3OA4YK3AQG3/bundle.json","state_url":"https://pith.science/pith/IJN6ZU6P7HG4YKW3OA4YK3AQG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJN6ZU6P7HG4YKW3OA4YK3AQG3/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-11T14:47:51Z","links":{"resolver":"https://pith.science/pith/IJN6ZU6P7HG4YKW3OA4YK3AQG3","bundle":"https://pith.science/pith/IJN6ZU6P7HG4YKW3OA4YK3AQG3/bundle.json","state":"https://pith.science/pith/IJN6ZU6P7HG4YKW3OA4YK3AQG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJN6ZU6P7HG4YKW3OA4YK3AQG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IJN6ZU6P7HG4YKW3OA4YK3AQG3","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":"37cf161328dbc85375ddf8b9b5e7e4b0075872e3a5d842ed4d46c1190fd428f2","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-13T05:00:07Z","title_canon_sha256":"48bdb3cf6c5d8e6c86c7db8ebadebcc8c8dfc7745a84d23e5b4eab5daa2dc321"},"schema_version":"1.0","source":{"id":"2605.13006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13006","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13006v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13006","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"IJN6ZU6P7HG4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IJN6ZU6P7HG4YKW3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IJN6ZU6P","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:dd41995bdba8f689ba3ca0227e5c82891411b2ffd0ae0e70f40958fb073490a5","target":"graph","created_at":"2026-05-18T03:09:00Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our finite-state machine allows a sufficiently large swarm to transport objects around obstacles that block the goal while preserving the fully decentralised and communication-free nature of the original strategy."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That individual robots can reliably detect occlusion and establish accurate sub-goals using only local sensing, and that the swarm size will always be sufficient to maintain the chain without breaking."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A decentralized swarm of miniature robots can transport objects around obstacles by forming sub-goal chains using occlusion rules and a finite-state machine."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Finite-state machines enable swarms to transport objects around blocking obstacles by forming local sub-goal chains without communication."}],"snapshot_sha256":"41b09b8eab25fcfa08b2feaaa7b6d5ec70f8010446b9b198e4869208de6077bb"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"264e4b4cf9d4dc532e407f121287f74dfad3afddac758ebaeccc19c30c5331e7"},"paper":{"abstract_excerpt":"Swarm robotics utilises decentralised self-organising systems to form complex collective behaviours built from the bottom-up using individuals that have limited capabilities. Previous work has shown that simple occlusion-based strategies can be effective in using swarm robotics for the task of transporting objects to a goal position. However, this strategy requires a clear line-of-sight between the object and the goal. In this paper, we extend this strategy by allowing robots to form sub-goals; enabling any member of the swarm to establish a wider range of visibility of the goal, ultimately fo","authors_text":"Breno Cunha Queiroz, Daniel MacRae","cross_cats":["cs.MA"],"headline":"Finite-state machines enable swarms to transport objects around blocking obstacles by forming local sub-goal chains without communication.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-13T05:00:07Z","title":"Occlusion-Based Object Transportation Around Obstacles With a Swarm of Miniature Robots"},"references":{"count":55,"internal_anchors":0,"resolved_work":55,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Cooperative object transport with a swarm of e-puck robots: robustness and scalability of evolved collective strategies , volume =","work_id":"1311ae13-9f42-4821-a43b-95c142894bab","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A review of swarm robotics tasks , volume =","work_id":"77bb9758-a238-4f29-979a-d1bb21f8823d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Experimental Study and Modeling of Group Retrieval in Ants as an Approach to Collective Transport in Swarm Robotic Systems , volume =","work_id":"caf1b5bc-c4c5-4f58-ad66-6334e356c62b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Autonomous transportation and deployment with aerial robots for search and rescue missions , volume =","work_id":"26cc9c90-15de-4c4b-aa8f-03f480213e56","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A pusher/steerer model for strongly cooperative mobile robot manipulation , volume =","work_id":"88f97ec8-d69d-416a-b50b-15303274420f","year":1995}],"snapshot_sha256":"167862f445327381ee4ce37b4c874042a85e6040450e4a7927743c3c5deaa15a"},"source":{"id":"2605.13006","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:17:24.353510Z","id":"a89cef3a-5d97-44d2-a34d-1d95232d4509","model_set":{"reader":"grok-4.3"},"one_line_summary":"A decentralized swarm of miniature robots can transport objects around obstacles by forming sub-goal chains using occlusion rules and a finite-state machine.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Finite-state machines enable swarms to transport objects around blocking obstacles by forming local sub-goal chains without communication.","strongest_claim":"Our finite-state machine allows a sufficiently large swarm to transport objects around obstacles that block the goal while preserving the fully decentralised and communication-free nature of the original strategy.","weakest_assumption":"That individual robots can reliably detect occlusion and establish accurate sub-goals using only local sensing, and that the swarm size will always be sufficient to maintain the chain without breaking."}},"verdict_id":"a89cef3a-5d97-44d2-a34d-1d95232d4509"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0cc39bb8768ec76d60f4167022d279f3c38bff6e9d0d71d9cc1ba7182f5fe29e","target":"record","created_at":"2026-05-18T03:09:00Z","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":"37cf161328dbc85375ddf8b9b5e7e4b0075872e3a5d842ed4d46c1190fd428f2","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-13T05:00:07Z","title_canon_sha256":"48bdb3cf6c5d8e6c86c7db8ebadebcc8c8dfc7745a84d23e5b4eab5daa2dc321"},"schema_version":"1.0","source":{"id":"2605.13006","kind":"arxiv","version":1}},"canonical_sha256":"425becd3cff9cdcc2adb7039856c1036d46d5895e731b57f8fddcf39e8de9026","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"425becd3cff9cdcc2adb7039856c1036d46d5895e731b57f8fddcf39e8de9026","first_computed_at":"2026-05-18T03:09:00.319361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:00.319361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vWkH+SnrU7vEGAhlgfcggKL0og9y+qULh8BY5gquyUym/0+oXrk+bf0xuvkAQcppffRBYq3Mf/VwvEZudJ64Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:00.320152Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cc39bb8768ec76d60f4167022d279f3c38bff6e9d0d71d9cc1ba7182f5fe29e","sha256:dd41995bdba8f689ba3ca0227e5c82891411b2ffd0ae0e70f40958fb073490a5"],"state_sha256":"46bf49997404c43d28f63c3ba7b6ae4db9c5be24fba050fadddf48482ae270ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Ij7kdApK/ANiIzlIc7am08zT3o9T/HKmCws/pFnMhEPwE2nv3RZW3MdjgYxILpUFGZTqc1sQusNodIfmabDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:47:51.101590Z","bundle_sha256":"4317942644189adcfecd849b762ff1b4a1b75a82a7e82b134d6bef4fd782eaef"}}