{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MSD7FQZULY4P44NS22WXJZASMA","short_pith_number":"pith:MSD7FQZU","canonical_record":{"source":{"id":"2212.02231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-12-05T13:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"e4ada97a9f256741b61ed025409ad6b43155e78c651d30ee988dffdce547f2e4","abstract_canon_sha256":"ac6566722439427005fd829ee0c158f0198101f3e639f5b1e9da0bba44df5c8e"},"schema_version":"1.0"},"canonical_sha256":"6487f2c3345e38fe71b2d6ad74e4126006efe57ff1009bd42cf1e47cff357769","source":{"kind":"arxiv","id":"2212.02231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02231","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02231v1","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02231","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"MSD7FQZULY4P","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"pith_short_16","alias_value":"MSD7FQZULY4P44NS","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"pith_short_8","alias_value":"MSD7FQZU","created_at":"2026-07-05T05:22:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MSD7FQZULY4P44NS22WXJZASMA","target":"record","payload":{"canonical_record":{"source":{"id":"2212.02231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-12-05T13:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"e4ada97a9f256741b61ed025409ad6b43155e78c651d30ee988dffdce547f2e4","abstract_canon_sha256":"ac6566722439427005fd829ee0c158f0198101f3e639f5b1e9da0bba44df5c8e"},"schema_version":"1.0"},"canonical_sha256":"6487f2c3345e38fe71b2d6ad74e4126006efe57ff1009bd42cf1e47cff357769","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:22.139513Z","signature_b64":"EQdc2IQvrxE0IFtXNv5dl4+BdFFJNkzx9ty/HaRkvCegb8xQOSoS/bczMeUvw1tMRRRlzEf4JG3rRzo18/+4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6487f2c3345e38fe71b2d6ad74e4126006efe57ff1009bd42cf1e47cff357769","last_reissued_at":"2026-07-05T05:22:22.139081Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:22.139081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.02231","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-05T05:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPyglL+ZJ/+j5lcpmTMahcHI5RN4UIR8Ni9U8CeDBfUMCLWT6INiwwZV/Mo+QmmmHgTmMdSqVTTJf0L53v0SCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:53:34.549859Z"},"content_sha256":"00bbb6925a40a9903121b9191a84284eee01a2834ed0e3005ebf1c50bd9b1870","schema_version":"1.0","event_id":"sha256:00bbb6925a40a9903121b9191a84284eee01a2834ed0e3005ebf1c50bd9b1870"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MSD7FQZULY4P44NS22WXJZASMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TMSTC*: A Turn-minimizing Algorithm For Multi-robot Coverage Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bi Zeng, Jingtao Tang, Junjie Lu, Tin Lun Lam","submitted_at":"2022-12-05T13:00:25Z","abstract_excerpt":"Coverage path planning is a major application for mobile robots, which requires robots to move along a planned path to cover the entire map. For large-scale tasks, coverage path planning benefits greatly from multiple robots. In this paper, we describe Turn-minimizing Multirobot Spanning Tree Coverage Star(TMSTC*), an improved multirobot coverage path planning (mCPP) algorithm based on the MSTC*. Our algorithm partitions the map into minimum bricks as tree's branches and thereby transforms the problem into finding the maximum independent set of bipartite graph. We then connect bricks with gree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02231","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/2212.02231/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:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHl3dHv2mWqkSSfqEg6v8sbbjCF9z5JxpEENHFdFlRyMM/QJhTZNjROtDUHZWBlHqHINYa8+tyQF6u9kJfWVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:53:34.550236Z"},"content_sha256":"c081362fb16c25671de43b088c79ec7759117d474999be0e5970d37910b73e6b","schema_version":"1.0","event_id":"sha256:c081362fb16c25671de43b088c79ec7759117d474999be0e5970d37910b73e6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSD7FQZULY4P44NS22WXJZASMA/bundle.json","state_url":"https://pith.science/pith/MSD7FQZULY4P44NS22WXJZASMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSD7FQZULY4P44NS22WXJZASMA/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-07-07T04:53:34Z","links":{"resolver":"https://pith.science/pith/MSD7FQZULY4P44NS22WXJZASMA","bundle":"https://pith.science/pith/MSD7FQZULY4P44NS22WXJZASMA/bundle.json","state":"https://pith.science/pith/MSD7FQZULY4P44NS22WXJZASMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSD7FQZULY4P44NS22WXJZASMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MSD7FQZULY4P44NS22WXJZASMA","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":"ac6566722439427005fd829ee0c158f0198101f3e639f5b1e9da0bba44df5c8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-12-05T13:00:25Z","title_canon_sha256":"e4ada97a9f256741b61ed025409ad6b43155e78c651d30ee988dffdce547f2e4"},"schema_version":"1.0","source":{"id":"2212.02231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02231","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02231v1","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02231","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"MSD7FQZULY4P","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"pith_short_16","alias_value":"MSD7FQZULY4P44NS","created_at":"2026-07-05T05:22:22Z"},{"alias_kind":"pith_short_8","alias_value":"MSD7FQZU","created_at":"2026-07-05T05:22:22Z"}],"graph_snapshots":[{"event_id":"sha256:c081362fb16c25671de43b088c79ec7759117d474999be0e5970d37910b73e6b","target":"graph","created_at":"2026-07-05T05:22:22Z","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/2212.02231/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Coverage path planning is a major application for mobile robots, which requires robots to move along a planned path to cover the entire map. For large-scale tasks, coverage path planning benefits greatly from multiple robots. In this paper, we describe Turn-minimizing Multirobot Spanning Tree Coverage Star(TMSTC*), an improved multirobot coverage path planning (mCPP) algorithm based on the MSTC*. Our algorithm partitions the map into minimum bricks as tree's branches and thereby transforms the problem into finding the maximum independent set of bipartite graph. We then connect bricks with gree","authors_text":"Bi Zeng, Jingtao Tang, Junjie Lu, Tin Lun Lam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-12-05T13:00:25Z","title":"TMSTC*: A Turn-minimizing Algorithm For Multi-robot Coverage Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02231","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:00bbb6925a40a9903121b9191a84284eee01a2834ed0e3005ebf1c50bd9b1870","target":"record","created_at":"2026-07-05T05:22:22Z","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":"ac6566722439427005fd829ee0c158f0198101f3e639f5b1e9da0bba44df5c8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-12-05T13:00:25Z","title_canon_sha256":"e4ada97a9f256741b61ed025409ad6b43155e78c651d30ee988dffdce547f2e4"},"schema_version":"1.0","source":{"id":"2212.02231","kind":"arxiv","version":1}},"canonical_sha256":"6487f2c3345e38fe71b2d6ad74e4126006efe57ff1009bd42cf1e47cff357769","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6487f2c3345e38fe71b2d6ad74e4126006efe57ff1009bd42cf1e47cff357769","first_computed_at":"2026-07-05T05:22:22.139081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:22:22.139081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EQdc2IQvrxE0IFtXNv5dl4+BdFFJNkzx9ty/HaRkvCegb8xQOSoS/bczMeUvw1tMRRRlzEf4JG3rRzo18/+4DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:22:22.139513Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.02231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00bbb6925a40a9903121b9191a84284eee01a2834ed0e3005ebf1c50bd9b1870","sha256:c081362fb16c25671de43b088c79ec7759117d474999be0e5970d37910b73e6b"],"state_sha256":"23459f309a227697f004e50cd25985e282687fc9d8ee57b588cd913b77c88e98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCtO/HsutDaJ4JCdTqWR5qww5Nd+RAB0bKsh2DSqqR1wpk7cn2y2rO9A0AOxCTPZbSeHtU2L77b7zo4OuT5nBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:53:34.552455Z","bundle_sha256":"7ff1d4de9017e8cf904ba941140bb370155bc1401fbfea1519f7f2a4223276d4"}}