{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OSTF4YMYOUQUKW3F6YVNPYI5SY","short_pith_number":"pith:OSTF4YMY","canonical_record":{"source":{"id":"2303.17459","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-03-30T15:37:08Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"d6efdf0a8bed2603a355652a5d80e48762e0cc49a9376704928723b374e38660","abstract_canon_sha256":"f266d0d4b534a5b570acfc748f11eecfb0bbf8356fb38a47a06384bdcfed8efd"},"schema_version":"1.0"},"canonical_sha256":"74a65e61987521455b65f62ad7e11d963c7635690d69dc2b409c1268ba05a1a9","source":{"kind":"arxiv","id":"2303.17459","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17459","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17459v2","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17459","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"pith_short_12","alias_value":"OSTF4YMYOUQU","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"pith_short_16","alias_value":"OSTF4YMYOUQUKW3F","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"pith_short_8","alias_value":"OSTF4YMY","created_at":"2026-07-05T05:59:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OSTF4YMYOUQUKW3F6YVNPYI5SY","target":"record","payload":{"canonical_record":{"source":{"id":"2303.17459","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-03-30T15:37:08Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"d6efdf0a8bed2603a355652a5d80e48762e0cc49a9376704928723b374e38660","abstract_canon_sha256":"f266d0d4b534a5b570acfc748f11eecfb0bbf8356fb38a47a06384bdcfed8efd"},"schema_version":"1.0"},"canonical_sha256":"74a65e61987521455b65f62ad7e11d963c7635690d69dc2b409c1268ba05a1a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:23.981075Z","signature_b64":"quEs26W4suZi3J780pYEbTk1newfXb7NZhXDbbzwqQHfNLgy/YprCOWbniTIwRTFmFwknISxLf/MogDkiLe+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74a65e61987521455b65f62ad7e11d963c7635690d69dc2b409c1268ba05a1a9","last_reissued_at":"2026-07-05T05:59:23.980653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:23.980653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.17459","source_version":2,"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-05T05:59:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXCXyQup3oV1yaiav3N/JAW5dj8k9cYTCmWNRNYjRWKEh5KvoWD1a7hk6fHBxp0XU0xmMHzT23oUrqNs/1X4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:29:49.118978Z"},"content_sha256":"d616a8840812bb977e2fd69bac2361f14dfca48a67090940954e60a66ee185ce","schema_version":"1.0","event_id":"sha256:d616a8840812bb977e2fd69bac2361f14dfca48a67090940954e60a66ee185ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OSTF4YMYOUQUKW3F6YVNPYI5SY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"coExplore: Combining multiple rankings for multi-robot exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Ingo Scheler, Robin Dietrich","submitted_at":"2023-03-30T15:37:08Z","abstract_excerpt":"Multi-robot exploration is a field which tackles the challenge of exploring a previously unknown environment with a number of robots. This is especially relevant for search and rescue operations where time is essential. Current state of the art approaches are able to explore a given environment with a large number of robots by assigning them to frontiers. However, this assignment generally favors large frontiers and hence omits potentially valuable medium-sized frontiers.\n  In this paper we showcase a novel multi-robot exploration algorithm, which improves and adapts the existing approaches. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17459","kind":"arxiv","version":2},"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/2303.17459/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-05T05:59:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lr7iYAOh7pq0Q7zsDeyc9E2e5yoDLuDbnyLKzWmsT4mWpNMf7tv1CVVzFsJoXIhBpuJwftJhz0LCSqMf2STCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:29:49.119898Z"},"content_sha256":"5c5b9525cad345b076c2ff8df052d35f34c7bca742e5666c9fdbc195f83197e9","schema_version":"1.0","event_id":"sha256:5c5b9525cad345b076c2ff8df052d35f34c7bca742e5666c9fdbc195f83197e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSTF4YMYOUQUKW3F6YVNPYI5SY/bundle.json","state_url":"https://pith.science/pith/OSTF4YMYOUQUKW3F6YVNPYI5SY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSTF4YMYOUQUKW3F6YVNPYI5SY/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-17T12:29:49Z","links":{"resolver":"https://pith.science/pith/OSTF4YMYOUQUKW3F6YVNPYI5SY","bundle":"https://pith.science/pith/OSTF4YMYOUQUKW3F6YVNPYI5SY/bundle.json","state":"https://pith.science/pith/OSTF4YMYOUQUKW3F6YVNPYI5SY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSTF4YMYOUQUKW3F6YVNPYI5SY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OSTF4YMYOUQUKW3F6YVNPYI5SY","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":"f266d0d4b534a5b570acfc748f11eecfb0bbf8356fb38a47a06384bdcfed8efd","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-03-30T15:37:08Z","title_canon_sha256":"d6efdf0a8bed2603a355652a5d80e48762e0cc49a9376704928723b374e38660"},"schema_version":"1.0","source":{"id":"2303.17459","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17459","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17459v2","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17459","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"pith_short_12","alias_value":"OSTF4YMYOUQU","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"pith_short_16","alias_value":"OSTF4YMYOUQUKW3F","created_at":"2026-07-05T05:59:23Z"},{"alias_kind":"pith_short_8","alias_value":"OSTF4YMY","created_at":"2026-07-05T05:59:23Z"}],"graph_snapshots":[{"event_id":"sha256:5c5b9525cad345b076c2ff8df052d35f34c7bca742e5666c9fdbc195f83197e9","target":"graph","created_at":"2026-07-05T05:59: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.17459/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-robot exploration is a field which tackles the challenge of exploring a previously unknown environment with a number of robots. This is especially relevant for search and rescue operations where time is essential. Current state of the art approaches are able to explore a given environment with a large number of robots by assigning them to frontiers. However, this assignment generally favors large frontiers and hence omits potentially valuable medium-sized frontiers.\n  In this paper we showcase a novel multi-robot exploration algorithm, which improves and adapts the existing approaches. T","authors_text":"Ingo Scheler, Robin Dietrich","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-03-30T15:37:08Z","title":"coExplore: Combining multiple rankings for multi-robot exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17459","kind":"arxiv","version":2},"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:d616a8840812bb977e2fd69bac2361f14dfca48a67090940954e60a66ee185ce","target":"record","created_at":"2026-07-05T05:59: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":"f266d0d4b534a5b570acfc748f11eecfb0bbf8356fb38a47a06384bdcfed8efd","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-03-30T15:37:08Z","title_canon_sha256":"d6efdf0a8bed2603a355652a5d80e48762e0cc49a9376704928723b374e38660"},"schema_version":"1.0","source":{"id":"2303.17459","kind":"arxiv","version":2}},"canonical_sha256":"74a65e61987521455b65f62ad7e11d963c7635690d69dc2b409c1268ba05a1a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74a65e61987521455b65f62ad7e11d963c7635690d69dc2b409c1268ba05a1a9","first_computed_at":"2026-07-05T05:59:23.980653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:59:23.980653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quEs26W4suZi3J780pYEbTk1newfXb7NZhXDbbzwqQHfNLgy/YprCOWbniTIwRTFmFwknISxLf/MogDkiLe+CA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:59:23.981075Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.17459","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d616a8840812bb977e2fd69bac2361f14dfca48a67090940954e60a66ee185ce","sha256:5c5b9525cad345b076c2ff8df052d35f34c7bca742e5666c9fdbc195f83197e9"],"state_sha256":"b3913d3ee77825151a362ee3b07570a8415f609217f94a79af07e67e36e2c462"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+LzR7zIRvtg6E/OOXrPHHqCWpbd2neornCThGgjYPlXRW80dviu4kmmipJalgsjg/pRvdR3QLyZWiv+p15vDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:29:49.132178Z","bundle_sha256":"9394986ddb399f1d88c5d2fc07eafe18869d75602d6b007bd7bad9d4e96e1d18"}}