{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HVPXVGV4NJCMH5FWZG2HHSZFLI","short_pith_number":"pith:HVPXVGV4","canonical_record":{"source":{"id":"2109.10106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-09-21T11:36:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"759fce9f2160a155d7904b088ab13b0ecfd69aa8d2e045bb3bea5d52a61f9afb","abstract_canon_sha256":"398b94a607fa5f29dd823a1c79e6acddf5f566fed2e58fe455a3e354ed2dae12"},"schema_version":"1.0"},"canonical_sha256":"3d5f7a9abc6a44c3f4b6c9b473cb255a20bcfc67c8a169a9793a67598eccaae7","source":{"kind":"arxiv","id":"2109.10106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.10106","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"2109.10106v1","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.10106","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"HVPXVGV4NJCM","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"pith_short_16","alias_value":"HVPXVGV4NJCMH5FW","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"pith_short_8","alias_value":"HVPXVGV4","created_at":"2026-07-05T03:15:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HVPXVGV4NJCMH5FWZG2HHSZFLI","target":"record","payload":{"canonical_record":{"source":{"id":"2109.10106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-09-21T11:36:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"759fce9f2160a155d7904b088ab13b0ecfd69aa8d2e045bb3bea5d52a61f9afb","abstract_canon_sha256":"398b94a607fa5f29dd823a1c79e6acddf5f566fed2e58fe455a3e354ed2dae12"},"schema_version":"1.0"},"canonical_sha256":"3d5f7a9abc6a44c3f4b6c9b473cb255a20bcfc67c8a169a9793a67598eccaae7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:58.177839Z","signature_b64":"DfVPxQLXaq8QNBf92HWMGyvzf07psVzazh51BgA5A/u2PEQqRgZen+RrC/WgysVWVnl50O9ihShR7OM/rrdFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d5f7a9abc6a44c3f4b6c9b473cb255a20bcfc67c8a169a9793a67598eccaae7","last_reissued_at":"2026-07-05T03:15:58.177470Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:58.177470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.10106","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-05T03:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Abl0gMNpMNQBhAtbV4hBLO8ft4OZNwdtxgdOnVUadri0g1QBlU/o5xRdJoptnSKRMPrAdFDvIqeSOOkr+kCnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:58:15.954542Z"},"content_sha256":"e7f12b52a50a89425ad82da0c2c8ad1178e44bca23339ff58e91c5229c3a9695","schema_version":"1.0","event_id":"sha256:e7f12b52a50a89425ad82da0c2c8ad1178e44bca23339ff58e91c5229c3a9695"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HVPXVGV4NJCMH5FWZG2HHSZFLI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Barbara Arbanas Ferreira, Stjepan Bogdan, Tamara Petrovi\\'c","submitted_at":"2021-09-21T11:36:11Z","abstract_excerpt":"In this paper, we propose a distributed multi-stage optimization method for planning complex missions for heterogeneous multi-robot teams. This class of problems involves tasks that can be executed in different ways and are associated with cross-schedule dependencies that constrain the schedules of the different robots in the system. The proposed approach involves a multi-objective heuristic search of the mission, represented as a hierarchical tree that defines the mission goal. This procedure outputs several favorable ways to fulfill the mission, which directly feed into the next stage of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.10106","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/2109.10106/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-05T03:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmsnPTTCLP9bB1Z3221H4rekomPHBwz1GMERJhXUqMxkLHpxgO7I9KL9SzHvK4JT1keevfzOPu1/tlS9qPKHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:58:15.955371Z"},"content_sha256":"deeafd6d4db2ae5c7d2f52dce860ee79b1612afc68abf79e9ae7d7ba6e2aaf1a","schema_version":"1.0","event_id":"sha256:deeafd6d4db2ae5c7d2f52dce860ee79b1612afc68abf79e9ae7d7ba6e2aaf1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/bundle.json","state_url":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/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-13T20:58:15Z","links":{"resolver":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI","bundle":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/bundle.json","state":"https://pith.science/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVPXVGV4NJCMH5FWZG2HHSZFLI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HVPXVGV4NJCMH5FWZG2HHSZFLI","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":"398b94a607fa5f29dd823a1c79e6acddf5f566fed2e58fe455a3e354ed2dae12","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-09-21T11:36:11Z","title_canon_sha256":"759fce9f2160a155d7904b088ab13b0ecfd69aa8d2e045bb3bea5d52a61f9afb"},"schema_version":"1.0","source":{"id":"2109.10106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.10106","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"2109.10106v1","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.10106","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"HVPXVGV4NJCM","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"pith_short_16","alias_value":"HVPXVGV4NJCMH5FW","created_at":"2026-07-05T03:15:58Z"},{"alias_kind":"pith_short_8","alias_value":"HVPXVGV4","created_at":"2026-07-05T03:15:58Z"}],"graph_snapshots":[{"event_id":"sha256:deeafd6d4db2ae5c7d2f52dce860ee79b1612afc68abf79e9ae7d7ba6e2aaf1a","target":"graph","created_at":"2026-07-05T03:15:58Z","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/2109.10106/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a distributed multi-stage optimization method for planning complex missions for heterogeneous multi-robot teams. This class of problems involves tasks that can be executed in different ways and are associated with cross-schedule dependencies that constrain the schedules of the different robots in the system. The proposed approach involves a multi-objective heuristic search of the mission, represented as a hierarchical tree that defines the mission goal. This procedure outputs several favorable ways to fulfill the mission, which directly feed into the next stage of the","authors_text":"Barbara Arbanas Ferreira, Stjepan Bogdan, Tamara Petrovi\\'c","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-09-21T11:36:11Z","title":"Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.10106","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:e7f12b52a50a89425ad82da0c2c8ad1178e44bca23339ff58e91c5229c3a9695","target":"record","created_at":"2026-07-05T03:15:58Z","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":"398b94a607fa5f29dd823a1c79e6acddf5f566fed2e58fe455a3e354ed2dae12","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-09-21T11:36:11Z","title_canon_sha256":"759fce9f2160a155d7904b088ab13b0ecfd69aa8d2e045bb3bea5d52a61f9afb"},"schema_version":"1.0","source":{"id":"2109.10106","kind":"arxiv","version":1}},"canonical_sha256":"3d5f7a9abc6a44c3f4b6c9b473cb255a20bcfc67c8a169a9793a67598eccaae7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d5f7a9abc6a44c3f4b6c9b473cb255a20bcfc67c8a169a9793a67598eccaae7","first_computed_at":"2026-07-05T03:15:58.177470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:15:58.177470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DfVPxQLXaq8QNBf92HWMGyvzf07psVzazh51BgA5A/u2PEQqRgZen+RrC/WgysVWVnl50O9ihShR7OM/rrdFCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:15:58.177839Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.10106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7f12b52a50a89425ad82da0c2c8ad1178e44bca23339ff58e91c5229c3a9695","sha256:deeafd6d4db2ae5c7d2f52dce860ee79b1612afc68abf79e9ae7d7ba6e2aaf1a"],"state_sha256":"873caf18fadc9286fa020dc0f7591dc9fed2686b2886935cfdc30239baf889fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZcQsrxFOhUXNKZP92OiPbYDri5TW72DoJd50bW4OokuiW6w47pEQuZSz5B4I6vqoaTeMYare7xCwPa3q2mnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T20:58:15.969513Z","bundle_sha256":"e7776264c6243c42e4d3eb7626382b734d9f7734c250005d926568aa07c37be4"}}