{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S3TWERHZ2INX6IOJSMPW2REW7I","short_pith_number":"pith:S3TWERHZ","canonical_record":{"source":{"id":"1709.03641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-12T01:18:10Z","cross_cats_sorted":[],"title_canon_sha256":"0713ec0618c0c5776e40dda0fbc94583364924d8ecf5304903a018ec014b37dc","abstract_canon_sha256":"1fc14eb04e9aa1e0a7ea4c57a4f53d1d2cb067f8f06ecf6dc864005693bb220c"},"schema_version":"1.0"},"canonical_sha256":"96e76244f9d21b7f21c9931f6d4496fa39ef6bc97374b92720052eeb5a75071c","source":{"kind":"arxiv","id":"1709.03641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03641","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03641v1","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03641","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"S3TWERHZ2INX","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3TWERHZ2INX6IOJ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3TWERHZ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S3TWERHZ2INX6IOJSMPW2REW7I","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-12T01:18:10Z","cross_cats_sorted":[],"title_canon_sha256":"0713ec0618c0c5776e40dda0fbc94583364924d8ecf5304903a018ec014b37dc","abstract_canon_sha256":"1fc14eb04e9aa1e0a7ea4c57a4f53d1d2cb067f8f06ecf6dc864005693bb220c"},"schema_version":"1.0"},"canonical_sha256":"96e76244f9d21b7f21c9931f6d4496fa39ef6bc97374b92720052eeb5a75071c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:29.970234Z","signature_b64":"+7n3WuWwmysCNjty/3WW0jF0RFbOKww9g25fJZtt9rgnzSXIgObMTT/BU/RJLt7SrgRh6Imq0tUMe3sqLItvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96e76244f9d21b7f21c9931f6d4496fa39ef6bc97374b92720052eeb5a75071c","last_reissued_at":"2026-05-18T00:35:29.969606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:29.969606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03641","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-18T00:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWfaJ8rqWtgIue5tOH9zsBhdaTXYAzXTBjrpfwUkEllTxzK3NNziP9kRIyChpdT1D3NyRp4wUeHvXi2o0V0MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:06:46.064522Z"},"content_sha256":"e71483d606984132a345ce2bf867d73e68362d655d6bf9d6bb9ed8b08918af55","schema_version":"1.0","event_id":"sha256:e71483d606984132a345ce2bf867d73e68362d655d6bf9d6bb9ed8b08918af55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S3TWERHZ2INX6IOJSMPW2REW7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-centralized control for multi-robot formation and theoretical lower bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jiaxun Lu, Khaled B. Letaief, Pingyi Fan, Shuo Wan","submitted_at":"2017-09-12T01:18:10Z","abstract_excerpt":"Multi-robot formation control enables robots to cooperate as a working group in completing complex tasks, which has been widely used in both civilian and military scenarios. Before moving to reach a given formation, each robot should choose a position from the formation so that the whole system cost is minimized. To solve the problem, we formulate an optimization problem in terms of the total moving distance and give a solution by the Hungarian method. To analyze the deviation of the achieved formation from the ideal one, we obtain the lower bound of formation bias with respect to system's par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03641","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-18T00:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMzGERffVJZ/oco9z08/pzZ//2y43X+k2glfwwov2lCcz8K0ACfaDfMXnBT0rIwBmcwBuIB/3QwO/4c100ujBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:06:46.064853Z"},"content_sha256":"66dcda9709a007044cdd454067e5167cd3198031b315cfcd525c247b442bb4cb","schema_version":"1.0","event_id":"sha256:66dcda9709a007044cdd454067e5167cd3198031b315cfcd525c247b442bb4cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3TWERHZ2INX6IOJSMPW2REW7I/bundle.json","state_url":"https://pith.science/pith/S3TWERHZ2INX6IOJSMPW2REW7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3TWERHZ2INX6IOJSMPW2REW7I/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-01T21:06:46Z","links":{"resolver":"https://pith.science/pith/S3TWERHZ2INX6IOJSMPW2REW7I","bundle":"https://pith.science/pith/S3TWERHZ2INX6IOJSMPW2REW7I/bundle.json","state":"https://pith.science/pith/S3TWERHZ2INX6IOJSMPW2REW7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3TWERHZ2INX6IOJSMPW2REW7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S3TWERHZ2INX6IOJSMPW2REW7I","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":"1fc14eb04e9aa1e0a7ea4c57a4f53d1d2cb067f8f06ecf6dc864005693bb220c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-12T01:18:10Z","title_canon_sha256":"0713ec0618c0c5776e40dda0fbc94583364924d8ecf5304903a018ec014b37dc"},"schema_version":"1.0","source":{"id":"1709.03641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03641","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03641v1","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03641","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"S3TWERHZ2INX","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3TWERHZ2INX6IOJ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3TWERHZ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:66dcda9709a007044cdd454067e5167cd3198031b315cfcd525c247b442bb4cb","target":"graph","created_at":"2026-05-18T00:35:29Z","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":"Multi-robot formation control enables robots to cooperate as a working group in completing complex tasks, which has been widely used in both civilian and military scenarios. Before moving to reach a given formation, each robot should choose a position from the formation so that the whole system cost is minimized. To solve the problem, we formulate an optimization problem in terms of the total moving distance and give a solution by the Hungarian method. To analyze the deviation of the achieved formation from the ideal one, we obtain the lower bound of formation bias with respect to system's par","authors_text":"Jiaxun Lu, Khaled B. Letaief, Pingyi Fan, Shuo Wan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-12T01:18:10Z","title":"Semi-centralized control for multi-robot formation and theoretical lower bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03641","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:e71483d606984132a345ce2bf867d73e68362d655d6bf9d6bb9ed8b08918af55","target":"record","created_at":"2026-05-18T00:35:29Z","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":"1fc14eb04e9aa1e0a7ea4c57a4f53d1d2cb067f8f06ecf6dc864005693bb220c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-12T01:18:10Z","title_canon_sha256":"0713ec0618c0c5776e40dda0fbc94583364924d8ecf5304903a018ec014b37dc"},"schema_version":"1.0","source":{"id":"1709.03641","kind":"arxiv","version":1}},"canonical_sha256":"96e76244f9d21b7f21c9931f6d4496fa39ef6bc97374b92720052eeb5a75071c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96e76244f9d21b7f21c9931f6d4496fa39ef6bc97374b92720052eeb5a75071c","first_computed_at":"2026-05-18T00:35:29.969606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:29.969606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+7n3WuWwmysCNjty/3WW0jF0RFbOKww9g25fJZtt9rgnzSXIgObMTT/BU/RJLt7SrgRh6Imq0tUMe3sqLItvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:29.970234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e71483d606984132a345ce2bf867d73e68362d655d6bf9d6bb9ed8b08918af55","sha256:66dcda9709a007044cdd454067e5167cd3198031b315cfcd525c247b442bb4cb"],"state_sha256":"5634e4a88725f1e658c164a9fdc5158daacceb77cebcc7380b15bb9c2c6bc5ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kpd3fAihZ9KUWZS0stMRNQg4AgovBRdUH4q6SEVi6XNb7JNfciBs1qpmxi8k+40QSyy5Ld7EK3s0sFEP+fLFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:06:46.066628Z","bundle_sha256":"66fa0f15fc1f06879ddeda266f0681b137ee15c75a403bc3fe9c20092fcbb9a5"}}